DAA-IMP-QUEST

Hi,
 
Today's My First Blog is;
 Important Questions from Design Analysis & Algorithms..

 B.E. (Computer Science & Engineering)

Design & Analysis of Algorithms

   Semester: Seven   : QUESTION BANK

·         Analyse the following for loop     for iß1 to n do P(i)                
·         What are the different ways to improve efficiency of algorithms?
·         Explain Big oh, Omega, theta notations with example.
·         What are the Algorithms Strategies? Explain Design using  recursion          
·         What is divide and Conquer? Give suitable example            
·       Explain Matrix  multiplication example of divide and conquer                    
·         Explain Convex Hull, Gift-wrapping, Merge Hull and Quick Hull in detail.
·         What are the Drawbacks of Divide & Conquer? Explain Timing   Analysis.
·         Write Kruskal’s algorithm and Solve Kruskal’s algorithm.     
       Write Dijkstra’s algorithm and Solve Dijkstra’s algorithm

·         Write Prim’s algorithm and Solve Prim’s algorithm.
·         Explain Knapsack problem and give suitable example.    
·        What is Dynamic Programming? Explain with structure multi-stage graph