Design and Analysis of Algorithms - Old Questions
6. Explain the greedy algorithm for fractional knapsack problem with its time complexity. (5)
5 marks
|
Asked in 2076 (new)