Dynamic Programming Questions

MCQ bookmark_border

11.

which is optimal value in the case of job sequence problem

item	1	2	3	4	5
profit	20	15	10	5	1
deadline	2	2	3	3	3

A

(1,3,4)

B

(4,2,3)

C

(1,2,4)

D

(1,5,2)

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

12.

which is optimal value in the case of job sequence problem

item	1	2	3	4	5	6	7
profit	3	5	20	18	1	6	30
deadline	1	3	4	3	2	1	2

A

(1,5,6,4)

B

(7,6,4,3)

C

(2,3,1,7)

D

(1,2,3,4)

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

13.

which is optimal value in the case of fractional knapsack problem, capacity of knapsack is 20 

item	1	2	3
profit	25	24	15
weight	18	15	10

A

498

B

480

C

499

D

485

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

14.

which is optimal value in the case of fractional knapsack problem, capacity of knapsack is 10

item	1	2	3	4	5
profit	12	32	40	30	50
weight	4	8	2	6	1

A

345

B

384

C

354

D

350

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

15.

In the case of sub problems share sub problems ,which method is suitable

A

greedy method

B

branch and bound

C

dynamic programming

D

divide and conquer

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

16.

Bin packing problem is the application of ____________

A

Knapsack

B

Branch and bound

C

Back tracking

D

Dynamic programming

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

17.

0/1 knapsack is based on ____________method

A

greedy method

B

branch and bound

C

dynamic programming

D

divide and conquer

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

18.

____________ is an algorithm design method that can be used when the solution to a problem can be viewed as the result of a sequence of decisions

A

Dynamic programming

B

Backtracking

C

Branch and bound

D

Greedy method

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion