Fractional knapsack problem is solved most efficiently by which of the – McqOptions

MCQOPTIONS

1.	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
Answer» D. Backtracking

Discussion

No Comment Found

Related MCQs

What is the competitive analysis of the FIFO algorithm?
Optimal page replacement algorithm is also called as __________
In a optimal page replacement algorithm, when a page is to be replaced, which of the following pages is chosen?
Which of the following is the main drawback of FIFO page replacement algorithm?
Which of the following page replacement algorithms return the minimum number of page faults?
__________ algorithm associates with each page the time when the page was brought into memory.
FIFO algorithm is used by __________ operating system.
In a stack algorithm, the set of pages in a k-frame memory is always a subset of pages in a __________ frame memory.
________ is a typical online problem from the competitive analysis to determine the optimal solution.
__________ has the lowest fault rate of all the page replacement algorithms.