CECSISCHENE | BCS401 ISEB: hester B.E./B.Tech. Degree Examination, June/July 2024 | Analysis and Design of Al jorithms | Max. Marks: 100 | . Answer any FIVE full questions, chose OE full question from eh module. 2. M: Marks , L: Bloom’s level , eT tcomes., ¢ L __ Moduls1 [M[ LT QA [a | What is an algorithm? Explain the fundamentals of algoriinié-problem | | 10) 12 | solving. | b, | Develop an algorithm to seafch an element in an array psing sequential | 10 | 13 | | search. Calculate the = Worst case and eae efficiency of | | this algorithm. ‘OR . | a. | Explain asymptotic nOtations with example. 1. 10 b.| Give the general |plan for analyzing the fficiency of the recursive | 10 | algorithm. Develop recursive algorithm'for computing factorial of a| | | | | positive number,’Calculate the efficiency Jn terms of order of growth. j j | Module—2 ty | Ta. | Explain Strassen’s matrix multipligation approach wig and derive | 10| 13 | CO2 | |__| its time complexity. I b. | What is divide and conquer"Develop the quick ca algorithm and write | | best case. Make use of this algorithm to sort the list of charaoters: 10 | 12 | Co2 | le EXAMPLE oe’ 2 | east oR 5 ey 3 ae] [Q4 [a | Distinguish Denyestndecrease & congiier and divide & coriquer algorithm | 10] 13 | CO2 | | | design techniqués.svith block diagr ‘velop insertion sort algorithm to Beet _sort a list of integers and estimate the éfficiency. | | b. | Define topological sorting. ae approaches 0 Frome sorting | 10 | L2 | CO2 | | and illustrate with examples, ¢ ee eo as rE 3 | Defin€ AVL tree with =apoe Give Sos efficiency of operations | 10] L3 | CO3 ORAVL tree. Construct. an AVL tree ofthe, Ist of Keys: 5, 6, 8,3, 2, 4,7 {indicating each st. insertion and rotation. |b. | Define Heap. ExplBin’ the bottom-ypyheap construction algorithm. Apply |_| heap sort to softthe list of numbers 259, 7, 6, 5, 8 in ascending order using |__| array represefitation, i a w 7 OR = 1 Q6 |a. | Define 2-3 tree. Give the case efficiency of operations on 2-3 tree. | 10 | L3 | CO3 Ae | Build 2-3 tree for the listP keys 9, 5, 8, 3, 2,4, 7 by indicating each step of slearie | key insertion and node splits. | | | D. | Design Horspool algorithm for string matching. Apply this algorithm to | 10 | find the pattern Apply DilGiap's algori to find the single souree shortest path for given | 10 ean | raph [Fig,Q7(@)] by considering ‘s’ as souree vertex, Ilustate each step. (os i = Tof2| | i | a Fig.Q7(a)___° BCS401 = | | | | | | | 'b, | Define transitive closure. Write Warshall’s aljprithm to compute weanate | closure. lustrate using the following diréeted graph. | | / | | i i 10/13 | Coa [cos [Character | A™)B | C Probability | 0.47| 0.1 | 0.2 | 0.1 é ) Ode x {| Fig.Q8(@)n by | Consirust Haffinay Wee and resulting code f6F the followin D [fs ais (ii) Dece text : 10001 ee a0 | (@ Encode the text : ABACAR, Re _ | | Ls |__| The knapsack’s capacity corithm, ea ee mS a Item | We ; ule a] SoS 's problem ¥ me using backtracking approach. b. an ‘the following inst sy knapsack yblem by the branch-and- i 3¢ (CMRIT LIBRARY BANGALORE - 560 087 OR a, | Differentiate between Branch and Bound technique and Backtracking Apply backtracking:to Solve the following instance of subset-sum problem S= (3, 5, 6, 7} 15 Construct a state space tree. }10 713] COs b. Explain greedySapproximation algorithm to solve discrete knapsack | [problem + 10 | £2 | COs