M

Mr. Dubey • 100.69K Points
Coach

Q. Which of the following problems is NOT solved using dynamic programming?

  • (A) 0/1 knapsack problem
  • (B) matrix chain multiplication problem
  • (C) edit distance problem
  • (D) fractional knapsack problem
Share
Explanation by: Mr. Dubey
the fractional knapsack problem is solved using a greedy algorithm.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. Well formed xml document means

Q. Components such as wheel, chain, handle etc are assembled to produce bicycle. The use of bicycle as transportation device is considered to be

Q. Which of the following is NOT one of the situational factors thought to influence the relationship between leader behavior and subordinate motivation

Q. The user's vocal system is categorically used as

Q. (1+1) ES

Q. A method of modelling and describing user tasks for an interactive application is referred to as:

Q. Which mechanism performs an analysis on the code to determine which data items may become unsafe for caching, and they mark those items accordingly?

Q. Which of the following operators has its associativity from right to left?

Q. A Stored Procedure is a

Q. Bi-stable devices remain in either of their states unless the inputs force the device to switch its state

Question analytics