M

Mr. Dubey • 100.69K Points
Coach

Q. Fractional knapsack problem is solved most efficiently by which of the following algorithm?

  • (A) divide and conquer
  • (B) dynamic programming
  • (C) greedy algorithm
  • (D) backtracking
Share
Explanation by: Mr. Dubey
greedy algorithm is used to solve this problem. we first sort items according to their value/weight ratio and then add item with highest ratio until we cannot add the next item as a whole. at the end, we add the next item as much as we can.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. The number of tuples in a relation is called it’s …………. While the number of attributes in a relation is called it&rs

Q. What is an AVL tree?

Q. A packet whose destination is outside the local TCP/IP network segment is sent to the ___ _.

Q. The table wizard

Q. Which statement is true?

Q. Management should find ‘one best way’ to perform a task. Which technique of scientific management is defined in this sentence?

Q. Which of the following is non-functional testing?

Q. 4: How many gates (minimum) are needed for a 3-bit up-counter using standard binary and using T lip-lops ? Assume unlimited fan-in.

Q. Most user interface design patterns fall with in one of ____ categories of patterns.

Q. Which of the following statements is not applicable for cable internet access?

Question analytics