DAA Quetions

Q.2) Any Two of below will be in Exam [ 3 * 2= 6Marks]

A) Compare Prime's and Kruskal's algorithm to find minimum spanning tree      

B) Write short note on optimal merge pattern algorithm with example                                                                                                                                        

C) State the difference between divide andConquer and dynamic programming approach

D)Write a  Short note on finding shortest pathusing Bellman Ford algorithm.      

Q.3)  Any Two of below will be in Exam[8 *1=8Marks]

A) What is greedy method?Explain elements of Greedy method?                          

B)  Explain Greedy approach to solve single source shortest path algorithm?                                                                                                                                       

  c) What do you mean by LCS Algorithm,How LCS problem is solved by using

         dynamic programming.                                                                                                                            

            Practical Que.......................

1) Write a program to implement Floyd-Warshall algorithm for solving all pairs of shortest path problem.

2) Program to implement Traveling salseperson problem by using dynamic programming 

3) Find optimal ordering of matrix multiplication. using dynamic programming method.