911744 (Pages: 2) NOM Ce scerscseneessctneners Reg Noss SIXTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, DECEMBER 2005 CS2K 601—DESIGN AND ANALYSIS OF ALGORITHMS ime : Three Hours Maximum : 100 Marks I. (a) What is dynamic programming ? Compare this technique with greedy method. (b) Define NP-hard problems. (¢) Explain any one hashing algorithm. (d) Describe the Floyd-Warshall algorithm. (e) What is 8-queens problem ? ( Show that the vertex eover problem is NP complete. (g) What is meant by ‘randomized algorithm’ ? th) Describe the amortized time analysis. (8x5 = 40 marks) IL. (a) (i) Solve the recurrence equation T(r) - 2T (n/2) + Cn log n, where the recurrence is for n>1,Cis some positive constant and T (1) = 1. (8 marks) Go Wash wich ee inca g asl sea (7 marks) Or (b) Analyse and explain the Kauth-Morris-Pratt matching algorithm. (5 marks) IL (a) Explain with an a eg eee ere ee eel by @ Bynamic programming. (i) Branch and Bound. (15 marks) Or {b} Explain Strassen matrix multiplication technique. Determine when Strassen’s method ‘outperforms the classical matrix multiplication. (15 marks) IV. (a) G) Write a non-deterministic algorithm for clique problem. (8 marks} (2) Explain class P and NP problems with examples. (7 marks) Or (bh) Show that the Hamiltonian cycle problem is reducible to the tvalng ‘salesperson problem. (15 marks) Turn over2 Divs V. (2) @) Describe Primality testing. (8 marks) Gi) Explain Universal hashing. (7 marks) Or (b) Gi) How can integer factorization be performed using Pollard’s rho heuristic ? (8 marks) Gi) What is Les-Vegas algorithm ? (7 marks) Hx 15 = 60 marks!D 11745 @Pages) Name. Time ; Three Hours bi TM. . Ca} ib) Cc} (dy te) in «b) & (hb) Reg. Now SIXTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION, DECEMBER 2005 CS 2K 608—GRAPH THEORY AND COMBINATORICS Maximum : 100 Marks Part A Define planar graphs and show that complete graph on five vertices is not planar. ‘Write the five rules of construction of Hamilton paths and eyeles. Write Dijkstra’s algorithm. Write Prim’s algorithm, ‘How many integral sohutions are there tax, +x, +2, +2, +%, = 20, where each x, 227 How many ways are there to select 2 cards: (i) (Without replacement) from the deck of 52? (Gi) The first is an ace and the second is 2 king? ii) The first is an ace and the second is not a king ? Find the generating function for a, = the number of non-negative integral solutions of e, + @, +e, 40,40, =F, where 0Se,53, 050,53, 2Se, $6, 250, £6,¢,i8 add and 1s", 5 9. Find the generating function of hn (n + I}(n + 2). (8x6 = 40 marks) Part B State and prove Grinberg’s theorem on Hamiltonian planar graph, (10 marks) (i) Show that Petersen graph is non-planar. {5 marks) Or (i) Derive Euler's formula for connected planar graph and show that 4, , is not planar. (10 marks) (ii) Show that there does not exist any bipartite Hamiltonial graph with odd number of vertices. (6 marks) State and prove max flow and mini-cut Theoren, (16 marks) Or Find the minimum and maximum spanning trees of the following graph :— (15 marks) ‘Turn over