Dynamic Programming and Greedy Techniques Quiz

What algorithm is used to compute the Binomial Coefficient?

• Kruskal's Algorithm

• Floyd's Algorithm

• Warshall's Algorithm

• Dynamic Programming

Which algorithm is NOT part of the Greedy Technique?

• Prim's Algorithm

• Kruskal's Algorithm

• Dijkstra's Algorithm

• Bellman-Ford Algorithm

What is the purpose of Prim's Algorithm?

• Computing the Binomial Coefficient

• Solving the Knapsack Problem

• Finding the minimum spanning tree

• Finding the shortest path in a graph

Which algorithm is used for Topological Sorting?

• Dijkstra's Algorithm

• Kruskal's Algorithm

• Floyd's Algorithm

• Depth-First Search

What problem does the Knapsack Problem address?

• Finding minimum spanning trees

• Finding the shortest path

• Maximizing profit with weight constraints

• Sorting elements in a graph

What is the main goal of Dijkstra's Algorithm?

• Maximizing profit with weight constraints

• Sorting elements in a graph

• Finding the shortest path from a source to all vertices

• Finding the minimum spanning tree

Which of the following problems can be solved using Dynamic Programming?

• Finding the minimum spanning tree

• Solving the Traveling Salesman Problem

• Finding the maximum flow in a network

• Finding the shortest path

What is the primary use of the Bellman-Ford Algorithm?

• Computing the Binomial Coefficient

• Finding the shortest path in a graph with negative weights

• Finding the minimum spanning tree

• Sorting elements in a graph

What is the main advantage of using Kruskal's Algorithm?

• It works well with dense graphs

• It finds the shortest path efficiently

• It is easy to implement and understand

• It can handle negative weights

Which of the following is a characteristic of the A* Algorithm?

• It uses a heuristic to improve search efficiency

• It guarantees the shortest path in all cases

• It is only applicable to directed graphs

• It is a greedy algorithm