GREEDY ALGORITHMS

1. : Which design strategy makes a locally optimal choice at every step hoping for a global optimum?
5. : Which programming method is typically used to solve 0/1 Knapsack optimally?
6. : In Job Sequencing, what is the maximum number of jobs that can be scheduled?
8. : Which greedy algorithm grows a single tree by adding the cheapest edge from the tree to a new vertex?
9. : In Dijkstra’s Algorithm, which data structure is commonly used to select the vertex with the smallest distance quickly?
11. : Which greedy algorithm builds an MST by repeatedly adding the smallest edge that doesn’t form a cycle?
13. : Which algorithm selects non-overlapping activities to maximize the number of activities?

2. : Which algorithm finds shortest paths from a single source when all edge weights are non-negative?
3. : In a graph, what is the connection between two vertices called?
4. : Which knapsack variant allows taking fractions of items for maximum profit?
7. : Which scheduling problem arranges jobs with deadlines and profits to maximize total profit?
10. : What does MST stand for in graph theory?
12. : What is a node in a graph called?