Time Left - 15:00 mins
GATE 2023 Algorithm Foundation Quiz 9
Attempt now to get your rank among 44 students!
Question 1
Which of the following is not the dynamic programming problem?
Question 2
Which of the following is/are property/properties of a dynamic programming problem?
Question 3
Which of the following problems can be solved using dynamic programming?
a) Merge sort
b) Rod cutting
c) 8-Queens problem
d) Subset sum problem
Choose the correct code from below:
Question 4
Which of the following is true about the time complexity of the recursive solution of the subset sum problem?
Question 5
The difference between maximum possible profit for 0/1 Knapsack and fractional Knapsack problem with capacity (W) =
- 44 attempts
- 0 upvotes
- 0 comments
Tags :
GATE & PSU CSAlgorithmsNov 22GATE & PSU CS