Submission of Dissertation Report of MTech
Click Here👆
Posts
Showing posts from April, 2020
Assignment on Job Sequencing with Deadlines Using Greedy Method
- Get link
- Other Apps
Assignment on Job Sequencing with Deadlines Using Greedy Method 1.What is Job Sequencing with Deadlines problem? Let n=5, profits[10,3,33,11,40] and deadlines[3,1,1,2,2] respectively. Find the optimal solution using Greedy . 2. Four Jobs with following deadlines and profits Find the optimal solution using greedy method. JobID Deadline Profit A 4 20 B 1 10 C 1 40 D 1 30 3. Consider the following 5 jobs and their associated deadline and profit.And Find optimal job sequence JOB j1 j2 j3 j4 j5 DEADLINE 2 1 3 2 1 PROFIT 60 100 20 40 20 Submit Solutions Here👆
Assignment on Knapsack Using Greedy
- Get link
- Other Apps
Assignment on Knapsack Problem Using Greedy Method. 1. A thief enters a house for robbing it. He can carry a maximal weight of 70 kg into his bag. There are 5 items in the house with the following weights and values. What items should thief take if he can even take the fraction of any item with him? Item Weight Value 1 5 30 2 10 40 3 20 45 4 22 77 5 30 90 2. Knapsack Capacity W = 30 Item A B C D Value 50 140 60 60 Size 5 20 10 12 3. Solve the Greedy Knapsack Problem Where m=10,n=4,P=(40,42,25,12), W=(4,7,5,3) 4. Solve the Greedy Knapsack Problem where Capacity W=5 Item Value Cost 1 2 12 2 1