10. a) Draw the binary tree for following alacbraic ‘expression and give preorder and postorder traversal ofthe tee. fa+(b-clle[id—eVnt+5—hi) 2 b) Explain following with example: 7 i) One way inorder threading of binary tree. ii) Two way inorder threading of binary tree 11. a) Howdoes Radix sort work? Explain with ‘example. 6 b) Suppose array A contains 14 elements as follows 66, 33, 40, 22, 55, 88, 60, 11, 80, 20, 50, 44, 77, 30. Apply merge sort algorithm to arrange this ist in ascending order. 7 OR 12. a) Explain Midsquare hash function method in detail. 6 b) Consider the graph shown below. Ye 4 iy 5| 1 Y It Apply shortest path algorithm to find the shortest path in this graph. 7 AJ-2336 4 212/225 myigea ab nia B.E. Fifth Semester Data Structure & Algorithm Pega: 4 SBMOL ‘ine: Tes Hom Max Mais: £0 Note: 1. Due credit will be given to neatness and adequate dimensions. 2. Assume suitable data wherever necessary, 3. Mlustrate your answer necessary with the help of neat sketches. 4. Use of pen Blue/Black inW/refill only for ‘writing the answer book. 1. a) Whatis complexity of algorithm ? Define following asymptotic notation for complexity of algorithm. 7 4) BigO notation. ii) Big © notation. fi) Big @ notation. b) White and explain various string storage structure also write advantages & disadvantages. 6 OR 2. a) Write and explain non linear data structure in brief, 7 AI-2936 1 PTO.For each of following patter P and T find 6. a) Wiite an algorithm to search an item x nto ‘number C of comparison to find index of Pin singly linked ist. 7 toner S 'b) Whats linked list ? What is main advantages ) P= abeT = (ab) ii) P= aga = (aabb? of two-way linked ist over one way linked list. 7 ee eee 7. a} Letaandb denotes positive integers. Let Data be the following sorted 13 elements anve{’ vacb 11, 22, 30, 33, 40, 44, 55, 60, 66, 77, 80, 88, (Qa-bb)+1, if bsa 99 bap omy serch ota oc erching find the value of Qi2,3) and Q (14,3). 4 an ITEM = a eats be 5) Suppose isthe folowing It of aiphabetc acseches! case 6 S: DATASTRUCTURES oR Use quick sort algorithm to sort the alphabets What are different searching algorithm ? and find the final postion of characterD. 6 Which searching algorithm is more efficient ? OR Wit u 8. a) Write an algorithm to insert element into stack Sor the following integers using bubble sort using linked list z: algorithm 32, 51, 27, 58, 66, 23, 13, 60. aes ie b) Consider following arithmetic expression ‘Show all the steps in each pass 6. erie ee Let P(x) denote following polynomial. ee i Pix) = 2x® ~5x” ~ 3x? +4. Give a diagram to ‘Bosttx expression by using represent P(x) by a header lst. Draw an array 9. a) Explain binary ree with an example. th representation ofthis header is. 7 i ae ait ma Explain the concept of Huffman Explain memory allocation and garbage ft plein pence 7 Huffman coding tree with suitable example. 7 is OR Ad -2336 2 AJ-2336 3 PTO.