Questions by Syedabbas110

0 votes

2 answers

Activity Selection Problem
11. Explain and write an algorithm for greedy method of algorithm design. Given 10 activities along with their start and finish time as: A={A1,A2, A3, A4, A5, A6, A7, A8, A9, A10} S={1, 2, 3, 4, 7, 8, 9,9, 11, 12} F={3, 5, 4, 7, 10, 9, 11, 13, 12, 14} Compute a schedule where the largest numbers of activities take place.

11. Explain and write an algorithm for greedy method of algorithm design. Given 10 activities along with their start and finish time as:A={A1,A2, A3, A4, A5, A6, A7, A8, ...

9.1k views

asked Oct 30, 2017

0 votes

1 answer

Knapsack problem
5.Consider the Knapsack instance with 5 objects and a capacity M=11, profit P=(5,4,7,2,3) and weight W=(4,3,6,2,2.). Solve it using dynamic programming approach.

5.Consider the Knapsack instance with 5 objects and a capacity M=11, profit P=(5,4,7,2,3) andweight W=(4,3,6,2,2.). Solve it using dynamic programming approach.

2.8k views

asked Oct 30, 2017

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true