Back to the 2025 paper
Similar questions
Design and Analysis of Algorithms The 0/1 Knapsack Problem is a classical combinatorial optimization problem. Explain how this problem can be solved using: (i) Brute-force method (ii) Greedy method (iii) Dynamic Programming (iv) Branch-and-Bound For each approach, explain the algorithm, time complexity, and limitations. Highlight why the greedy method may not always yield the optimal solution.20247mDesign & Analysis of AlgorithmsThe fractional Knapsack problem can be solved by using: - (i) Greedy method - (ii) Divide and conquer method - (iii) Dynamic programming - (iv) None of these20232mDesign & Analysis of AlgorithmsState the general Knapsack problem. Write a greedy algorithm for this problem and derive its time complexity.20237mDesign and Analysis of Algorithms Differentiate between divide & conquer, greedy method and dynamic programming with suitable examples.20227m
PreviousA FIFO Branch-and-Bound strategy is typically implemented using which data structure? (i) Stack (ii) Queue (iii) Priority Queue (iv) ArrayNextIn an unweighted graph, which algorithm is guaranteed to find the shortest path between two nodes? (i) Depth First Search (ii) Kruskal's Algorithm (iii) Breadth First Search (iv) Prim's Algorithm