cs43 Fourth Semester BE, Degree Examination, July/August 2004 Computer Science /Information Science and Engineering Analysis & Design of Algorithms ‘ime: 3 hrs. {Max.Marks ¢ 300 Note: Answer any FIVE full questions. ‘5 a) Define 0,0, 2 notations. (6 Marks) (b) Prove 3n? +2 tnt £00") (omits) © NI) = Ff) and Te(n) = OC@(n)) en show that Tym) + Daln) = Omar fln),g(n)))- (ents) 2. (a) Write the bubble sort algorithm and show that the worst case efficiency #° quadratic. (oo Marks) (b) Outline an exhaustive search algorithm for travelling salesman problem. What is ‘the efficiency class of this algorithm? Ulustrate with an example. aD Make! «Bu. (a) Describe a binary search algovithin, Show that the woEs cHSS efficiency is in (log n) (Mat (b) Write algorithms for preorder postorder, and inorder traversals of a tree. List the tree of Fig 3(b) in preorder, postorder and inorder. (Macks) rq. 3b) 4. (@) Write DFS algorithm and find its worst case efficiency: (Mats) (b) Write an algorithm to topologically sort adiagraph using DFS. Prove the correctness ‘and find the time efficiency: (Maris) Contd... 2Page No... 2 cs43 (© Topologically sort the following graph shown in Fig 4(c) (6 Maks Rade) 5. (@) What is a 2-3 tree? Explain search, insertion and deletion operations and show that these operations are all in @(Jog n) in both worst and average case. (10 Maia) (©) What is a heap?. Outline an algorithm to construct a heap. Derive the efficiency class of this algorithm. ‘a0 Marks) &- {@) Deseribe an algorithm with an example to compute binomial coefficient and derive its time efficiency, (10 Marks) (b) Design a. @(n2) algorithm for finding an optimal binary search tree. Go Maks) 7. (@) Write the Kruskal’s algorithm to find’ minimum spanning tree in time O() B | tog | E |), where | E | is the number of edges. Prove the correctness and derive the efficiency class of the algorithm. (14 Marks) ©) Apply Kruskal’s algorithm fo find minimum spanning tree of the graph shown in Fig.7(b). (6 Marks) 8. (@) Define P, NP, and NP-complete problems: Make (0) Write twice around the tree approximation algorithm for travelling salesman Problem. Illustrate the working of the algorithm with an example. GoMira) (©) Show that the above algorithm is a 2 approximation algorithm, (7M i we eePage No... 1 CS43 USN Fourth Semester B.E. Degree Examination, January/February 2005 Computer Science /Information Science and Engineering Analysis and Design of Algorithms ‘Time: 3 hrs] [Max.Marks : 100 Note: 1, Answer any FIVE full questions. 2. Algorithms should be accompanied by sufficient explanations. 1. (@) With the help of a flow chart, explain the various stages of algorithm design and analysis process. (2 Marks) (b) Distinguish between the two common ways to represent a graph. Given the rep- resentation of an undirected grapli, explain how the following can be ascertained by the representation i) The graph is complete ii) The graph has a loop iii) The graph has an isolated vertex answer for each of the representations separately. (8 Marks) 2. (a) Explain the concept of asymptotic notations, indicating the normally used nota- tions. (6 Maris) -(b) Suggest a general plan for analysing the efficiency of non recursive algorithms. Suggest an algorithm to find whether the elements in an array are unique. Analyse it’s efficiency using the method suggested by you. (12 Maks) 3. (a) What is a ‘bruteforce’ method? Under what conditions does the method become desirable? (6 Mas) (b) Discuss whether the travelling sales person problem can be solved by exhaustive search methods. (6 Mats) (© State the merge sort algorithm and analyse its complexity. (sak) 4, (a) Suggest an algorithm based on divide and conquer methodology to multiply two large integers and analyze its performance, (10 Maks) (b) Suggest an algorithm for generating combinational objects based on decrease and conquer methodology. (10 Mas) 5. (a) Explain the concept of 2-3 tree. How can keys be inserted into it? Comment on the efficiency of search operations on a 2-3 tree. (a0 Marks} (©) With the help of necessary algorithms, explain the bottom up heap sort method of sorting, (Mads) 6. (a) Explain the concept of hashing as a method of implementing dictionaries. What are the two main methods of resolving collisions? Briefly explain them. (0 Mads) Contd... 2Page No... 2 ; cs43 (0) With help of a Pseudocode, explain Warshall’s algorithm to find the transitive closure of a directed graph. Apply it to the following graph 2 | ab: ¢ d o | se LEeO: b 0 00 1 © 0 0 0 Oo d 1 o 1 0 | (10 Marks) 7. (@) State and explain Dijkstra’s algorithm to find single source shortest paths. oman) (b) What is a Huffman tree? Explain an algorithm to construct the Huffman tree. ‘a0 Mais) 8. (a) Explain the concept of decision trees for sorting algorithms. a0 Maks (0) What is backtracking? Explain it's usefulness with the help of an algorithm. What are the specific areas of ils applications? ao Marks eePage No... 1 ; cs43 NEW SCHEME venf [TT ETT Tt Fourth Semester B.E. Degree Examination, July/August 2005 Time: 4, Computer Science and information Science Engineering Analysis and Design of Algorithms 3 hrs] (Max.Marks : 100 Note: 1. Answer any FIVE full questions. 2, Algorithms should be accompanied by sufficient explanations. (a) Explain the various stages of algorithm design and analysis process with the help of a flow chart. (10 Marks) (b) Define the terms sparse and dense with reference to graph. With suitable example explain the methods used to represent sparse and dense graphs comment on space complexity of each representation (10 Maries) (a) Explain various asymptotic notations used in analysing algorithm. Give the examples. (10 Marks) () If ty(n) € O(gi(n)) and ta(n) € O(ga(n)) then prove the following assertion y(n) + 4(m2) € Olmaaeta(r), 92(2)}) (Marks) (c) With suitable example explain the significance of order of growth in analysing algorithms efficiency, (6 Masks) (a) Suggest goneral plan for analysing recursive algorithms. Mathematically analyse the tower of hanoi problem and find its complexity. do Marks) (b) What is a brute force method? Write a brute force string matching algorithm. Explain with suitable example the correctness of that algorithm. Analyze for complexity. do Marks) (a) Bxplain the divide and conquer methodology. Suggest a pseudocode for merge- ‘and analyse its complexities. ‘Trace algorithm tothe data set 8,4,1,6,7,2,3,8. do Marks) (b) Briefly explain Strassen’s matrix multiplication and how it uses divide and conquer method. Obtain its time complexity, (10 Marks) (a) With suitable exampie, explain depth first search and breadth first search algorithms. Write the pseudocodes for both. Derive the time-complexities. Explain its use in topological sorting. (12 Marks) (b) State Horspool’s algorithm for pattern matching. Apply it to search for the pattern BARBER in the given test ; consider all the 4 cas (8 Marks) (a) Define the three variations of transform and conquer algorithms. Construct an ‘AVL tree for the list 5,6,8,3,2,4,7 by successive insertions. State four rotation ‘types used in the construction of ALV tree, and explain the same. (10 Marks) (b) Construct heap for the list 2,9,7,6,5,8 using bottom up construction algorithm. ‘Explain clearly procedure of adding new element in that method. Explain in brief heap sort algorithm and obtain its complexity. (10 Marks) Contd... 2Page No... 2 cs43 7. (a) Explain how dynamie programming is used to compute all pair shortest paths for a weighted digraph. Write the pseudocode for same and derive the time complexity. (10 Marks) (b) Give Huffinan’s algorithm to construct Huffman tree and explain same with suitable example. Marks) (©) Using greedy method trace the following grpah to get shortest path from vertex a to all other vertices. ( Marks) 8. (a) Explain backtracking concept and apply same to n-queen's problem. (Marks) (b) Explain how TSP problem can be solved using branch and bound method. (@ Marks) (c) Write brief note on P, NP and NP-complete problems. Maries) sob aePage No... 7 Reg. No. Fourth Semester B.E. Degree Examination, January/February 2006 Computer Science and Information Science and Engineering Analysis and Design of Algorithms Time: 3 hrs) (Max.Marks : 100 1 Note: Answer any FIVE full questions. (@) Define : © - notation , 9 - notation and @notation. Wis GaN sedipesah ere (6 Marks) (©) Develop an cigorithm to determine the minimum and maximum values in an array 1, 0, -..)n OF integers (Here m > 1 and the enitles in the array need not be distinct). Determine worst-case complexity function for this algorithm. 7 Marks) (©) What is wrong with the following argument ? “Since n = O(n), 2n= O(n), we have Yokn= LY Oln)=O(n*y” @ Maris) igkgn——agkn (@) Design a brute-force algorithm for computing the value of a polynomial plz) =an2” +n 42"! +. + are +g ta given point ay and determine its worst - case complexity class, (6 Maks) (®) If the algorithm designed in port (a) is in @(n2), design a linear algorithm for this problem. 6 Marks) (©) Write quick sort algorithm. Derive worst - case and average - case complexities for this algorithm, (@ Marks) (@ Wite a decrease - by - one algorithm to generate all 2” subsets of a set {1, @2,...,an} in quashed order i.e. subset involving a; can be listed only of- ter all subsets Involving ay, a2) a5) (j= 1,2,..m- 1) @ Marks) (2) Design a decrease - by - one algerinm for generating @ gray code of order. jan (©) Solve the system of linear equations given below by Gaussian elimination 2a ~ 2p +25 =1 ey +a2-23=5 ay +22 +23 =0 (7 Marks) (@) Define o heap, Prove that a nelement heap has height [Jog n]. Show that there isa linear algorithm to construct a heap of size n. (16 Marks) (®) What is the running time of heapsort on an array A of length n that is already sorted in increasing order ? What about decreasing order? (4 Marks) Contd... 2Page No... 2 C843 5. (@) What is input enhancement ? Apply this technique to design o linear sorting aigoritm. @ Marks) () When does collision occur in hashing ? What ore different mechanisms used to resolve collisions ? (4 Marks) (@ Consider open hashing with linear probing policy, For the input 1055, 1492, 1776, 1812, 1918, 1945 inserted in the order and hash function A(k) = 5k(mod 8) Construct the open hash table |) Show the sequence of key comparisons needed to search for 1945 and 1543 in the table, (@ Marks) 6 (@) White Warshall’s algorithm to find transitive closure of a digraph. Prove that the time complexity of the algorithm Is @ (n°) . (10 Marks) (b) Apply Warshall’s algorithm to find transitive closure of the digraph defined by the following adjacency matrx oo00 (10 Marks) moo ero 1 0 0 7. (@) What is a decision tree ? Use decision trees to establish lower bound on worst-case ‘ond average - case efficiency of comparison based sorting algorithm. (10 Marks) (®) Define NP - complete problem. Prove that the Homittonion circuit problem is polynomially reducible to the decision version of traveling salesman problem (ISP). (0 Maria) 8. (@) What is. C - approximation algorithm ? Write o 2 - approximation algorithm for TSP with Euclidian aistances. (10 Marks) ©) If P NP. Prove that there exists no C - approximation algorithm for TSP. ‘(0 Marks)Page No.1 csa3 vss TTT 1a Fourth Semester B.E. Degree Examination, July 2006 CSAS SJ Analysis and Design of Algorithm Time: 3 hes.] [Max. Marks:100 Note: 1. Answer any FIVE full questions. 1 With @ neat diagram, briefly explain the design and explain the design and analysis of an algorithm. (07 Marks) >. Explain what property of the adjacency matrix of an undirected graph indicates that the graph is complete has loop / has an isolated vertex. (03 Marks) © Design a recursive algorithm for computing 2* for a non negative integer ny based on the formula 2" = 2"'+2"", Set up a recurrence relation for the number of additions made by the algorithm and solve it. For n = 5, draw a tree of recursive calls for this algorithm and count the number of calls. (10 Marks 2 a. Explain how we can compare the order of growth of 2 functions using limits, Compare order of growth of logan and Yn. (07 Marks) b. Define asymptotic notations 0,0,9 and prove that 4 n(n—1)< 6(r?) (08 Marks) © Sort the list ‘QUESTION? in alphabetical order using the Bubble Sort algorithm, (05 Marks) 3a Write down an algorithm to search for a key ina given array, using linear search. Find its best, worst and average case efficiencies. (10 Marks) | b. State whether ¢.¢ following are true or false: Win+5e O(n), n?-+120(10000n), n° +5 (7) +1 O(n). 2 Marks) ©. Apply Quick Sort to sort the list ‘QUESTION’ in alphabetical order. Draw the tree of the recursive calls made, (08 Marks) 4a. Write down a recursive algorithm to compute the number of leaves in a binary tree, (05 Marks) Prove the correctness of the above algorithm in Q4(a), (05 Marks) j Write a i d to solve | topologi (10 Marks) 5 a. Design a presorting — based algorithm to find the mode and determine its efficiency class. (07 Marks) 5. Construct an AVL tree by inserting the elements successively. for 3,6,5.7,1,2,8.4, staring from an empty tree. (05 Marks) © Write down an algorithm to construct a heap by bottom-up method. Trace your algorithm for the list 1,8,6,5,3,7.4 (08 Marks) Contd... 2Page No. 2 cs43 6 a. Constract a shift table for the pattern BAOBAB, and search for the same in the text BESS-KNE W-ABOUT-BAOBABS, using Horspool’s algorithm. (06 Marks) Briefly explain the dynamic programming technique using Floyd's algorithm for the problem of all-pairs, shortest path as an example. (07 Marks) ¢. What are the requirements to be satisfied to apply greedy technique? Explain Prim’s algorithm with a suitable example. °? (07 Marks) 7a. Construct a Huffman code for the following data: Character A BC DE Probability 0.4 0.1 0.2 0.14 0.16 Encode the text ABACABAD using the above code, Decode the text whose encoding is 100010111001010, using the above Huffman code, (07 Marks) b. What is back tracking? Apply back tracing algorithm to solve the instance of the sum-of-subset problem $={1,3,4,5} and d=11 (07 Marks) c. With the help of 2 state-space tree, solve the following instance of the Knapsack problem by the branch-and-bound algorithm. (06 Marks) Item Weight Value 1 10 100 207 63 W=l6 3.8 56 404 12 8 a. What is the need for approximate algorithms? Explain; with 2 suitable example, the nearest neighbour algorithm, (10 Marks) b. Write down the decision tree for the three-element insertion sort. c. Define the following: (06 Marks) Decision problem, Class of NP problems, NP-Complete problem and Polynomially reducible problems. (04 Marks)Page No...1 CS43 ied Et an a Fourth Semester B.E. Degree Examination, Dec. 06 / Jan. 07 CcS/Is Analysis and Design of Algorithms Time: 3 hrs.] [Max. Marks:100 Note: Answer any FIVE full questions. 1 a. What is an Algorithm? Illustrate the important points to be noted with respect to an algorithm, with an example. (06 Marks) b. Describe the standard algorithm for finding the binary representation of a positive decimal integer with a neat pseudo code. (06 Marks) ©. Design an algorithm for checking whether two given words are anagrams, for example the words ‘tea’ and ‘cat’ are anagrams. i.e. one word can be obtained by permuting the letters of the other. (08 Marks) 2 a. For the following algorithms, indicate i) Natural size metric for its inputs ii) Basic operations iii) Whether the basic operations count can be different for inputs of the same size. (08 Marks) 1) Computing sum of ‘n? numbers 2) Computing x", 3) Finding largest element in a list of ‘n’ numbers. 4) Euclid’s algorithm, b. Find the Big—on notation for the following : (06 Marks) i) lognt+ vn ii) ntntogn iii) 6n+2n‘+4n' ©. Find the time efficiency of the definition based algorithm for computing product of nx nmatrices. (06 Marks) 3a. Designa brute~ force algorithm for computing the value of a polynomial P(x)= a,x" +a, ,x"" +....4a,74a, ata given “xp” and determine it’s worst case | efficiency class. (08 Marks) b. Sort the list { E,X, A, M, P, L, E} in alphabetical order using insertion sort. (06 Marks) c. Give the pseudo code for finding maximum and minimum element in an array of *n? numbers using divide ~ and — conquer technique. (06 Marks) 4a, Draw the tree of recursive calls made to sort the elements { C,O,M, P, U, T, 1, N, G} b in alphabetical order using Quick sort method (10 Marks) b. Apply Strassen’s algorithm to compute, using 2x2 matrices, exiting the recursion | when n= 2, (10 Marks) 1021) fo1rotr | 411090 i 2104 } 0130) j2011 OHO er ee Rear. | S a. Apply the D F $ ~ based and source removal methods to obtain the topological sorting of the following graph, (10 Marks) Contd...2 _ E EPage No...2 CS43 6 a Fig 5(@) Construct the A V L tree and 2~3 tree for the input sequence :3 6 $124 (10 Marks) Sort the elements { 8, 0, R, T, I, N, G } in alphabetical order using Heapsort method. (10 Marks) Construct the open hash table and closed hash table for the input : 30, 20, 56, 75, 31, 19 using the hash function h (k) = k mod 13 (10 Marks) Apply Floyd’s algorithm to compute all ~ pairs shortest paths for the following graph. Zz (10 Marks) Apply Kruscal’s algorithm to find a minimum spanning ttee of the following gph. (Ot Tarksy S ry a = Fig, 7(6) Construct a Huffman code for the following data, (04 Marks) r [A BC D ak Probability [04 0.1 02 0.15 Prove that the classic recursive algorithm for the Tower of Hanoi problem makes the smallest member of disk moves needed to solve the problem. (06 Marks) Draw the state ~ space tree for solving 4-Queens problem using back tracking, (04 Marks) Solve the following instance of the Knapsack problem by the branch ~ and ~ bound algorithm, (10 Marks) Tiem_| Weight [Value 1 10 $100 2 7 363 3 8 356 4 4 $12 w=i6Page No... | C843 “COT Fourth Semester B.E. Degree Examination, July 2007 CS/IS Analysis and Design of Algorithm Time: 3 hrs.] [Max. Marks:100 a Note: Answer any FIVE full questions, ' With the help of a flowchart, explain the various stages of algorithm design and analysis process. (08 Marks) List the different problem types and name oneal (07 Marks) Distinguish between the two common graph, Given the representation of un is i) Weighted (05 Marks) Fxplain in bret the basic asymptotic efficiency clases, (08 Maris) Indicate whether the first function of each of the following pairs has a smaller, same ot latger order of growth than second function ) n+) and 2000n? ii) 100n? and 0,010? iii) Jogn and Inn iv) 2" and 2" Y) logon and logon? vi) (M1)! and nt (06 Marks Explain the concept of asymptotic notations indicating the normally used notations (06 Marks) with suitable example the eorteciness of that algorithm. Analyse for complexity. {DPLY the depth first search based algorithm to solve she topological sorting problem for the following diagraph, (05 Marks) Write the Johnson Trotter algorithm for generating permutation of the given set of “hibers. Also generate all permutations of {3, 5. 74 by i) The bottom up minimal change algorithm it) The Johnson Trotter algorithm iil) The lexicographic order algorithm, (10 Marks) Contd.... 2Page No. 5a b ©. 6 a b. Toa. b c. a b. a 2 cS43 . Explain “Transform and Conquer” technique. What are the 3 major variations of this idea? (05 Marks) The time efficiency of searching, inserting and deleting in a binary search tree is (log n) in the average case. It degenerates to Q(n) in the worst case. How is it overcome using transform and conquer technique? Explain both techniques by re-arranging the given data : i) 7,8,10,5,4,6,9 i) COMPUTING (10 Marks) Write and analyse the Horspool matching algorithm for searching a given patter in a string. (0S Marks) Write and explain the funetions of Warshall’s and Floyd's algorithm. (10 Marks) Explain how the drawbacks of top-down and bottom-up approach of dynamic programming are overcome using memory functions. Apply the memory function ‘method to solve the instance of the knapsack problem given below: _ Ttem Weight | Value 1 3 $25 2 2 $20 3 1 $15 Capacity W=6 4 4 $40 5 5 | $50 i) Indicate the entries of the dynamic programming table that are never computed by the memory function method on this instance. (10 Marks) What is greedy technique? Explain how the different steps of this technique are taken care in generating a minimum spanning tree through 2 sequence of expanding subtrees, Apply this algorithm to the following graph. 5 (10 Marks) Write Kruskal’s algorithm. What are its applications? How is it different from prim’s algorithm? (05 Marks) Construct a Huffiman code for the following data : _ é Character A B Cc Df: [Probability | 04 of 02 0.15 05 Using this code encode the code ABCD-ABAC (05 Marks) . Distinguish between P, NP and NP complete problems. Give examples for each category. (05 Marks) Apply backtracking to solve the following instance of the subset sum problem $= {2,3,4,5} andd=1l ‘Will the backtracking algorithm work correctly if we use just one of the two in equalities to terminate a node as non-promising. (05 Marks) Write short notes on : i) Backtracking ii) Branch and bound technique. (10 Marks)USN eee aa “esas Fourth Semester B.E. Degree Examination, Dec. 07 / Jan. 08 Analysis and Design of Algorithms Time: 3 hrs. Max. Marks:100 3 Note : Answer any FIVE full questions. What do you mean by a stable algorithm and an algorithm is inplace? Explain the same and give an algorithm to sort a given list of numbers which should be stable but not inplace (08 Marks) What are the differences between set and multiset? Compare it with list. Explain with example two ways of defining sets. (06 Marks) Give three different algorithms to compute ged of given two positive numbers and comment on their performance. (06 Marks) Define the commonly encountered asymptotic notations and illustrate with figures. Express the following functions using asymptotic notations : i) 6* 2% +n? ii) Kn(o-1) Give the necessary steps to prove the same. (10 Marks) Give the general plan for analyzing the recursive algorithms. Mathematically analyse the tower of Hanoi problem, clearly indicating the steps and comment on its complexity. (10 Marks) What is brute force method? Explain the exhaustive search technique. How would you apply it to a job assignment problem? Explain with suitable example. Analyse for complexity. (08 Marks) Give the general divide and conquer recurrence and explain the same, Give the Master’ s theorem and explain with example how would you apply it to solve the recurrence. (06 Marks) Using complexity analysis prove that Strassen's matrix multiplication algorithm is more efficient compared to conventional matrix multiplication for large values of n, (06 Marks) Explain the concepts of divide and conquer. methodology indicating three major variations of same. (06 Marks) With suitable example explain Johnson trotter algorithm to generate permutation of given objects. (06 Marks) Give BFS and DFS algorithm. Clearly bring out the differences and comment on the complexity, (08 Marks) What is an AVL tree? Explain four types of rotations used to construct AVL tree. Construct an AVL tree for the list 5, 6, 8, 3, 2, 4, 7 showing clearly successive insertions (40 Marks) What is a heap? Give an algorithm to construct a heap for the elements of given array by bottom up approach. What is its complexity? Show heap construction for the given list 2,9, 7, 6, 5, 8 stage by stage. (0 Marks) With suitable example explain Boyer-Moore algorithm used in string matching. (08 Marks) Explain the concept of dynamic programming. With a suitable example explain an algorithm to solve all pair shortest path problem, Discuss about its complexity, (12 Marks) Justify the statement “Prim’s algorithm always yields minimum cost spanning tree”. Give the Prim’s algorithm and discuss about its complexity. (08 Marks) ‘What is a Huffman tree? Explain it with suitable example and give Huffiman’s algorithm. (06 Marks) Give Dijkstra’s algorithm. What is its complexity? Discuss with a simple example. (06 Marks) Explain backtracking concept and apply the same to n-queen’s problem (08 Marks) Write notes on i) Branch and bound method —_ ii) P, NP and NP complete problems. (12 Marks)ead USN / | 06CS43 Fourth Semester B.E. Degree Examination, Dec 08 / Jan 09 Analysis and Design of Algorithms Time: 3 hrs. Max. Marks:100 ges Note : Answer any FIVE full questions, selecting atleast TWO questions from Part A and Part B. PART-A Discuss the various stages of algorithm design and analysis process using flow chart, 10 Maris) Explain important fundamental problem types of different category. (10 Ntarks) Explain in brief the basic asymptotic efficiency classes. (06 Marks) Explain the method of comparing the order of the growth of two functions using limits. Compare order of growth of following functions i) logyn and Vn ii) (loge n)? and log: n’. (09 Marks) Discuss the general plan for analyzing efficiency of non recursive algorithms. (05 Marks) What is brute — fore method? Explain sequential search algorithm with an example. Analyse its efficiency. 10 Marks) Write the merge sort algorithm and discuss its efficiency. Sort the list E, X, A, M, P, L, E in alphabetical order using merge sort. (0 Marks) What is divide — and — conquer technique? Apply this method to find multiplication of integers 2101 and 1130. (08 Marks) Explain the differences between DFS and BFS. Solve topological sorting problem using DFS algorithm with an example. (12 Marks) PART-B Explain bottom ~ up heap sort algorithm with an example. Analyse its efficiency. (10 Marks) Write Horspool’s algorithm. Apply Horspool algorithm to search for the pattern BAOBAB inthe text BESS_ KNEW_ABOUT_BAOBABA. (10 Marks) Write Warshall’s algorithm. Apply Warshall’s algorithm to find the transitive closure of the following Fig. 6(a). (10 Marks) a b Bier a 4 e Fig. 6(a) Fig. 7(a) Solve the following knapsack problem with given capacity W ~ 5 using dynamic programming. (oO Marks) Ttem | Weight | Value P1 2 $12 12 1 $10 3. | 3 | s20 4 | 2 | sis Write Dijkstra’s algorithm and apply the same to find single source shortest paths problem for the following graph taking vertex ‘a’ as source in fig. 7(a). (10 Marks) ‘What are decision trees? Explain the concept of decision trees for sorting algorithms with an example. (10 Marks) Briefly explain the concepts of P, NP and NP complete problems. (10 Marks) Explain back — tracking algorithm, Apply the same to solve the following instance of the subset — sum problem : S = {3, 5, 6, 7} and d= 15. (10 Marks)06CS43 PART Design a Presorting — based algorithm to find the distance between the 2 closest numbers in an array of ‘n’ numbers, Compare the efficiency of this algorithm. With that of brute — force algorithm, (0 Marks) Construct AVL tree for the set of elements — 5, 6, 8, 3, 2, 4, 7. (06 Marks) Apply Horspool’s algorithm to search for the paitern BAOBAB in the text BESS b KNEW b ABOUT BAOBABS Also, find the total number of comparisons made. (04 Marks) For the input — 30, 20, 56, 75, 31, 19 construct the open hash table, Find largest and average number of key comparisons in a successful search in the table. (06 Marks) Explain Dynamic programming. (04 Marks) Write the formula to find the shortest path using Floyd’s approach. Use Floyd’s method to solve the below all-pairs shortest paths problem. (10 Marks) 0 «a 3 & 2 0 © 2-701 6 @ © 0 Use Kruskal’s method to find min cost spanning tree for the below graph (06 Marks) ° Write Huffman tree construction algorithm, (08 Marks) Draw the decision tree for the 3 — elements insertion sort. (06 Marks) Differentiate between back tracking and Branch —- and — bound algorithm, (06 Marks) Draw the state space tree to generate first solution to 4 — queens problem. With the first solution, generate another solution, making use of board’s symmetry. (08 Marks) Explain P and NP problems. (06 Marks) wee 20f2USN | | | 2002 SCHEME cs43 Ee Fourth Semester B.E. Degree Examination, June-July 2009 Analysis and Design of Algorithms Time: 3 hrs. Max. Marks:100 Note: Answer any FIVE full questions. 1 a Compare adjacency matrix and adjacency list methods of representing graphs. Give examples. (08 Marks) Write two separate algorithms to compute the indegree and outdegree of a directed, connected graph, which is represented as adjacency list. (12 Maria) 2 Define the following asymptotic notations: 0,(@), 0. (06 Marks) Prove the following, using limit theory: i) log, (n!)=©nlog,, n) ii) ¥10n?+7n+3 =@ @ (06 Marks) Write an iterative/tecursive algorithm to find a" and determine the time taken by your algorithm (apply brute-force method). (08 Marks) Show the steps in sorting the list using quicksort: 60, 50, 20, 80, 10, 90, 30, 70, 40. (05 Marks) Using divide-and-conquer approach, write an algorithm for Quicksort and derive the best, worst, and average complexity of the same. (15 Marks) Write DFS and BES trees for the following graph: (08 Marks) Fig. Q4 (a) Write an algorithm or C/C++ program to find the path between any two given vertices u and v of an undirected graph G = {V, E} based on DFS. You must print all the vertices appearing between u and v. Note that the path need not be the shortest. (12 Marks) What do you understand by Topological sort? Give its applications. Apply source removal method to find the topological order of the following graph: (10 Marks) ‘An efficient algorithm to generate all permutations of a positive integer n is by using Johnson-Trotter algorithm. Show the algorithm and all the intermediate steps for n = 3. Suggest the best data structure to implement this algorithm. (10 Marks) 1 of 2S43 Show how would you sort the following list using Heapsort algorithm: 34, 12, 89, 34, 21, 12, 64, 10 (05 Marks) Explain the Horspool algorithm by taking an appropriate example. (05 Marks) Devise a dynamic programming based algorithm for finding the all-pairs shortest path of a given connected, directed graph G. Trace your algorithm for the below given cost matrix. (10 Marks) g og vol onsale 1 0 2 o ~ gO gl) afoln[= Let G = {V, E} be an undirected, connected graph. Write the Prim’s algorithm that finds the minimum spanning tree based on greedy technique. Give an example of a 5 vertex graph to illustrate its working. (10 Marks) . Apply backtracking to solve the following instance of sum-of-subset problem: S=(1,5,2,7} withd=8 (10 Marks) Solve the following problem using Branch and Bound technique: (20 Marks) Job Tobi | Job2 | Tob3 [Job4 AT 9 | 2 [718 Persons Bi 6 4 3. 7 cls ayia se} pi7[é[o}4]) Discuss the approximation algorithms for NP-hard problems. (10 Marks) keen 20f2pages, 50, will be treated as malpractice. neg, 4248 jonal cress lines on the remaining blank ‘appeal to evaluator andlor equations write compulsorily draw diag ig Your answe; 2. Any revealing of identification, Important Note: 1, On completin USN im E] o6csa3 Fourtti:Semester B.E. Degree Examination, Dec.09/Jan.10 Analysis and Design of Algorithms Time: 3 hrs. Max. Marks:100 Note: Answer any FIVE full questions, selecting at least TWO questions from each part. Part- A 1a. Explain theevarious stages of algorithm design and analysis process using a flow chart (10 Marks) Define thesfiillowing: i) Speciaditypes of list. Pathisand Cycles. iil) | Sets:and Dictionaries (06 Marks) ¢- Write an algorithm to find the distance between two closest elements in an array of numbers (04 Marks) 2 a Prove that ::1Bt,(n) ¢ O(g,(n)) and t(n) € O(g, (a) ttien (a) + t,(n) ¢ O(max{g,(n),g,(n)}) (06 Marks) b. Write an algorithm to compute n! recursively. Set up a recurence relation for the algorithm’ sstasic operation count and solve it (08 Mans) & Explain the: method of comparing the order of the growth of 2 functions using limite Compare order of growth of log, n and Vn. (06 Marks) 3 a. Discuss how-quiek sort works to sort an array and trace for the following data set. Draw the tree of recursive calls made. I, 1, 9, 9, 5, 5, 6, 6 (10 Marks) b, What is stabilé-algorithn? Is Quick Sort stable? (@2 Marks) ©. Write the algorithm for binary search and find the average case efficiency, (08 Marks) 4 a volain the-dfference between DFS and BFS. Solve topological sorting problem using DFS algorithm, with an example. (12 Marks) b Show the steps in multiplying the following 2 integers using efficiency integer ‘multiplicatiommethod: 5673 x 6342, (08 Marks) Part~B 5 a. What is an AVL tree? Explain the need for rotation of AVL tree. Construct an AVI. tree for the list 10, 20}.30, 25, 27, 7, 4 by successive insertion. (10 Marks) b. Wite an allgprithm for comparison counting and show how comparison counting method sorts the list:45, 2, 19, 10, 33, 22, 1,23 (10 Marks) 6 a. Explain hastiiig and various collision resolution techniques. (06 Marks) . Solve the all irs shortest path problem forthe diagraph with the weight matrix, (10 Marla) fo 2 § 8 60 32 @ oo 0 4 8 2 © 2 0 3 3m wma 0 Using dynamic:programming, solve the following knapsack instance =3,[0,,0,,0,]=[1,2,2] and IP.,P,,P,] = {18, 16, 6] and M=4 (04 Marks) 1 of 2 THB ET06CS43 Solve the following instances of the single source shortest path problem with vertex ‘a’ as the source. (06 Marks) Fig. Q7 (a) . Write the Kruskal’s algorithm to find the minimum cost spanning tree. Also trace the algorithm for the graph of figure Q7 (b). (10 Maris) What are Huffman codes and trees? Discuss the advantage of Hufman’s code. (04 Marks) Discuss p and np problems. (05 Maris) What is the central principle of back tracking? Taking n-queens problem as an example, explain the solution process. (05 Maris) What is branch and bound? How is it different from back tracking? (05 Marks) |. Draw the state space tree for the sum of subset problem of the instance: S= {5, 7,8, 10} and d= 15 (05 Marks) nenee 20f2