USN ‘TIME: 03 Hours BCS401 Model Question Paper with effect from 2023-24 (CBCS Scheme) LITT TT ttt Fourth Semester B.E. Degree Examination nd Designs of Algorithms Max. Marks: 100 Note: 01. Answer any FIVE full questions, choosing at least ONE question from each MODULE. Module -1 BL |_| Marks QOL [a | Define algorithm. Explain axymptotic notations Big Oh, Big Omega and Big Theta | L2_ | | 08 notations » | Explain the general plan for analyzing the efficiency of a recursive algorithm, Suggest [2 | | 08 a recursive algorithm to find factorial of number. Derive its efficiene € | Ita) € O(gI(n)) and (2(n) € O(g2(n)), then show that U(n) + O(n) € OGmaxfeliny, | T2 |] OF 22). OR (Q02_[a | With neat diagram explain different steps in designing and analyzing an algorithm 12 | [08 b | Explain the general plan for analyzing the efficiency of a non-recursive algorithm. 12 | | os Suggest a non-recursive algorithm to find maximum element in the list of n: numbers. Derive its efficiency © [ With the algorithm derive the worst case effiiency for Bubble sort 12_| | 04 Moduled) 2 > Ste Q03 Ja | Explain the concept of divide and conquer. Design an algorithm for merge sort and |L2 | | 10 derive its time complexity b | Design an insertion sort algorithm and obtain its time complexity. Apply insertion sort [13 | 10 ‘on these elements. 25,75,40,10,20, OR (Q04 [a | Explain Strassen’s matrix multiplication and derive its time complexit 12 | [10 bb | Design an algorithm for quick sort algorithm. Apply quick sort on these elements 13 | /10 25,75,40,10,20.05,15 Module-3 (Q.05 [a | Define AVE Trees. Explain its four rotation types 12 | [10 bb [Construct bottom up heap for the list ,.7.6,5.8. Obtain its time complexit 13 | [10 OR Q.06 | a | Define heap. Explain the properties of heap along with its representation. 12 | | 10 bb | Design Horspools algorithm for string matching. Apply Horspools algorithm to find [L3 | | 10 the pattern BARBER in the text: JIM_SAW_ME_IN_A_BARBERSHOP Module-4 Q07 | a | Construct minimum cost spanning tree using Kruskals algorithm Tor the following Ts |) 10 ‘graph b | What are Huffman Trees? Construct the Huffinan tree for the following data 13 | | 10 Character [A B c D E ~ Probability | 0.5 035/05 on od [02 Encode DAD-CBE using Huffman Encoding. Page 01 of 02BCS401 OR Q.08 ‘a | Apply Dijkstra’s algorithm to find single source shortest path for the given graph by considering S as the source vertex. 1D | Define transitive closure of a graph. Apply Warshalls algorithm to compute transitive closure of a directed graph aoee econs ~eco cones 13 10 10 ‘Module-5 Q09 ‘a ] Explain the following with examples i) P problem ii) NP Problem iii) NP- Complete problem iv) _NP~ Hard Problems 10 | What is backtracking? Apply backtracking (0 solve the below instance of sum of subset problem $=(5,10,12,13,15,18) d=30 10 OR a | Tilustrate N queen's problem using backtracking to solve 4-Queens problem 10 b | Using Branch and Bound technique solve the below instance of knapsack problem. Item Weight Value 1 2 12 2 1 10 3 3 20 4 2 5 Capacity 5 10 Page 02 of 02