M

Mr. Dubey • 52.26K Points
Coach 

Q. The Knapsack problem is an example of

(A) greedy algorithm
(B) 2d dynamic programming
(C) 1d dynamic programming
(D) divide and conquer
Correct : Option (B)

Explanation: 
 knapsack problem is an example of 2d dynamic programming.

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs

Q. MSI is the abbreviation of

Q. Metal-oxide semiconductor field-effect transistors (MOSFETs) are the active switching elements in

Q. Which is the type of attack when Network is made unavailable for user

Q. Recursive program to raise an integer x to power y uses which of the following algorithm?

Q. What is the difference between the 54XX and 74XX series of TTL logic gates?

Q. Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least.

Q. Using which customized endpoint will be accessed over HTTP?

Q. The a priori frequent itemset discovery algorithm moves _______ in the lattice.

Q. What is the function of the controller in active vibration isolation systems?

Q. While other functions prepare a setting for action, name the function that initiates action in the organization.