Question 8933 – Algorithms
May 13, 2024Question 11786 – Queues-and-Stacks
May 14, 2024Question 8471 – Algorithms
Which of the following problem cannot be solved using greedy approach?
Correct Answer: A
Question 379 Explanation:
Greedy Problems:
1. Job scheduling
2. Minimum spanning tree
3. Huffman code
Dynamic Programming:
1. O/1 knapsack
2. Optimal Binary search tree
3. Matrix chain multiplication
1. Job scheduling
2. Minimum spanning tree
3. Huffman code
Dynamic Programming:
1. O/1 knapsack
2. Optimal Binary search tree
3. Matrix chain multiplication
0-1 knapsack
Job scheduling
Minimum spanning tree
Huffman code