M

Mr. Dubey • 52.30K Points
Coach 

Q. Fractional knapsack problem can be solved in time O(n).

(A) true
(B) false
(C) ---
(D) ---
Correct : Option (A)

Explanation: 
 it is possible to solve the problem in o(n) time by adapting the algorithm for finding weighted medians.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Which of the following defines the Cookie visibility?

Q. The following box denotes?

Q. Which of the following is not a command to find specific word or phrases in a database?

Q. Testing OO class operations is made more difficult by

Q. Embedded systems are

Q. :.2}'.format(1/3))

Q. Which of the following is not a business risk?

Q. A user-interface that is easy to use is considered to be

Q. What is Decision Tree?

Q. is used to simplify the circuit that determines the next state.