B.e. Degree examination, Dec. 2013 / jan. 2014 design and analysis of algorithms time: 3 hrs. Max. Mark: 100 Note: answer FIVEfull questions, selecting atleast TWO questions from each port.
B.e. Degree examination, Dec. 2013 / jan. 2014 design and analysis of algorithms time: 3 hrs. Max. Mark: 100 Note: answer FIVEfull questions, selecting atleast TWO questions from each port.
B.e. Degree examination, Dec. 2013 / jan. 2014 design and analysis of algorithms time: 3 hrs. Max. Mark: 100 Note: answer FIVEfull questions, selecting atleast TWO questions from each port.
3 a. Write Krushal's algorithm to efficiency is O(l e llogl e l). State Floyd's algorithm. Solve Floyd algorithm. :::,,, construct a minimum spanning tree and l0cs43 (10 Marks) show that the time (08 Marks) (04 Marks) (04 Marks) of a directed graph. Apply this (08 Marks) given graph using (08 Marks) (J o () o () () !Qo 6U 6 o0 I gca .= .-..1 (6$ nbo go eO 71, ^ aI oO !oi -o 'O (6 -? .) 'Ca OE :9 o'v oj d .e, o= irE !o 5.v >- (F bo- -oo o= so tr> o U< J c'i o '7 o a Fourth Semester B.E. Degree Examination, Dec. 2013/Jan.2014 Design and Analysis of Algorithms Time: 3 hrs. Max. Marks:100 Note: Answer FIVEfull questions, selecting atleast TWO questions from each port. , PART-A ,, 1 a. With the help of a flow chart, explain the various steps of algoritfim design and analysis _ process. (08 Marks) b. If fi(n) O(gr(n)) and fz(n) e O(g2(n)) prove that fi(n) + fz(n) e O(max {g(n), gz(n)}). (04 Marks) c. Write an algorithm for selection soft and show that the time complexity of this algorithm is quadratic. (08 Marks) 2 a. What is divide and conquer method. Show that the worst case efficiency of binary search algorithm is 0(log n). (10 Marks) b. Explain quick sort algorithm. Find the time complexity of quick sort for best case, worst b. Apply Kruskal"s algorithm to find the min spanning tree of the graph. Fie. Q3(b) Write Dijikstra's algorithm to find single source shortest path. a. Write the dynamic programming algorithm to compute binomial co-efficient and obtain its time complexity. b. Explain Warshall algorithm to find the transitive closure algorithm to the graph given below. L Fig. Qa(c) all pairs shortest path problem for the Fig. Qa(b) c. For More Question Papers Visit - www.pediawikiblog.com For More Question Papers Visit - www.pediawikiblog.com w w w . p e d i a w i k i b l o g . c o m PART _ B Explain decrease and conquer method, with a suitable example. 10cs43 (04 Marks) 5a. b. Apply the DFS - based algorithm to solve the topological sorting problem for given graph. (0E Mzrks) Fig. Q5(b) , :" :' matching. Apply the same to (12 Marks) c. State Horspoolzs algorithm for pattern BARBER in a given text. a. Prove that the classic recursive algorithm for the tower of Hanoi puzzlemakes the minimum number of disks moves needed to solve it. (08 Marks) b. Write shoft notes on : i) Tight lower bound ii) Trivial lower bound iii) Information theoretic lower bound" , a. Explain how the TSP problem can be solved, using branch and bound method. (06 Marks) b. Explain back-tracking concept'and apply the,sq,np to n-queens problem. (08 Marks) c. Solve 8 - queens problem for a feasible sequence (6, 4,7, 1). (06 Marks) search for the pattern (08 Marks) a. Write short notes or, ' ," """'' i) Hamiltonian proptbm ii) M - Coloring.',,.,.,. "' b. Explain prefix,Computation problem and . , (10 Marks) list ranking algorithm, wilh suitable examples. (10 Marks) ,.{<**{< For More Question Papers Visit - www.pediawikiblog.com For More Question Papers Visit - www.pediawikiblog.com w w w . p e d i a w i k i b l o g . c o m
ChatGPT Side Hustles 2024 - Unlock the Digital Goldmine and Get AI Working for You Fast with More Than 85 Side Hustle Ideas to Boost Passive Income, Create New Cash Flow, and Get Ahead of the Curve