Printed Pages: r Pages: 2 Sub Code: KCS- 30) "aper Id: | 233380 Roll No, * Time: 3 Hours B.TECH, (SEM II) THEORY EXAMINATION 2022-23 DATA STRUCTURE Total Marks: 100 Note: 1. Attempt all Sections, If require any missing data; then choose suitably, 1. @) &) © @ ©) © (s) (a) a ® 2 @ (b) (&) @) (e) SECTION A Attempt aff questions in brief. 2x 10=20 Define best case, average case and worst case’ for analyzing the complexity of a + program, Differentiate between binary search tree and a heap. Write the condition for empty and full circular queue. ‘What do you understand by tail recursion? Construct an expression tree for the following algebraic expression: (a-b)/(c* d) +e) - Differentiate between internal sorting and external sorting. ‘What are the advantages and disadvantages of array over linked list? ‘Write an algorithm for Breadth First Search (BF; ) traversal of a graph. In a complete binary tree if the number of mee 1000000, What will be the height of complete binary tree. Ss Which data structure is used to perform ec) segibed Attempt any three of the fol gfe Assume that the declaration imensional arrays X and Y to be, A + ‘X (-2:2, 2:22) and ¥ (1:8, &, Mio:s) nN (| Find the len; ‘each dimension and number of elemept?¥n X and Y. (ii) Find the address of element Y (2, 2, 3), assuming Base Adress of ¥ = 400 and each element occupies 4 memory locations. Jon and why? What is Stack? Write a C program for linked list implemt kcn of stack. Write an algorithm for Quick sort, Use Quick sorvalgc thm to sort the following, ts: 2, 8, 7, 1, 3, 5, 6, 4 N Waene Bint algorithm for shortest path raph and also find the shortest path from ‘S? to all remaining vertices of graph wg lowing graph: ‘ s “The order of nodes of a binary tree in inorder and postorder traversal are as follows: In order : B, I, D, A, C, G, E, H, F. Post order: I, D, B, G, C, H, F, FE, A. (Draw the corresponding binary tree, (ii) Write the pre order traversal of the same tree. QP23DP2_027 {27-03-2023 13:29:27 | 117.55.241.39 hitps:/www.aktuonline.com(a) (b) fa) ) (@) ) @) ) 1 (a) (b) 7 SECTION c , . Attempt any one part of the following. How to. Tepresent the polynomi; polynomials using linked list, Discuss doubly linked list. Write an algorithm to insert a node after a gi in singly tinked list, 10x1=10 al using linked lst ? Write 8 C program to nag ‘wo Attempt any one part of the following: 10x1=10 Write an algorithm for Converting infix expression into postfix expression, Trace Your algorithm for infix expression Q into its equivalent postfix, expression P, Q:A+(B*C-(D/ EAF)*G)*H ‘What is circular Queue? Write a C code to insert an element in circular queue? Attempt any one part of the following: 10x1=10 What is Hashing? Explain division method to compute the hash function and also explain the collision resolution strategies used in hashing. Write an algorithm for Heap Sort. Use Heap sort algorithm, sort the following sequence: - 18, 25, 45, 34, 36, 51, 43, and 24, Attempt any one part of the following: 10x1=10 What is spanning tree? Write down the regs to obtain minimum cost spanning tree. Use Prim’s algorithm to fin; inimum cost spanning tree in the following graph: Write and explain the Floyd Warshall algorithm to find ep oair shortest path. Use the Floyd Warshall algorithm to find shortest path among As vertices in the given graph: nO 10x1=10 Attempt any one part of théfollowing: X i tree by Discuss left skewed and right skeveed binary tree. Construct an AVL y inserting the following elements in the order of their occurrenc 60, 2, 14, 22, 13, 111, 92, 86. i jes of B- Tree. Show the results of is B-Tree? Write the various properties o} results of inserting the keys F, S, Q, KC, L, H-T, V, W, M, R, N, P, A, B in order in empty B-Tree of order 5. QP23DP2_027 | 27-03-2023 13:29:27 | 117.55.241.39 https://wwvi.aktuonline.com