Explain the divide and conquer technique with a general algorithm Answer:- Divide and Conquer is one of the best-known general algorithm design technique. It worksaccording to the following general plan:…
21CS42 – Design and Analysis of Algorithm – DAA Solved Previous year question papers – PYQ’s MODULE – 1 1) What is an algorithm? Explain the criteria/properties to be satisfied…
Explain the general procedure to solve a multistage graph problem using a backward approach with an example. Answer: A multistage graph problem is to find the shortest path from a…
Explain multistage graph problem with example. Write an algorithm for multistage graph problem using forward approach. Answer: A multistage graph problem is to find the shortest path from a source…
Q. Explain N-Queen problem with example (or) Q. With the help Of State Space tree, solve the 4-queens problem by using backtracking approach The problem is to place n queens…
Solve multistage graph problem using forward approach for the given graph consider vertex 1 as the source and vertex 12 as sink. Answer:
Design Floyd’s algorithm to find the shortest distances from all nodes to all other nodes. Answer: Example:
Apply Floyd’s algorithm to find all pair shortest path for the given graph. Answer:
Q. Define transitive closure of a graph. Write Warshall’s algorithm to compute transitive closure of a directed graph. Apply the same on the graph defined by the following adjacency matrix:…
Sort the given list of number using Heap sort. Answer:-
