i (0) AT AE Note: Printed Page: 1 of2 nie ‘Subject Code: BCS301 a neue: [TT] LEETtt BTECH (SEM 111) THEORY EXAMINATION 2023-24 DATA STRUCTURE HRS M.MARKS: 70 ing data; then choose suitably. 1, Attempt all Sections. If require any mis SECTION A 1. Attempt aif questions in brief. 2x74 [no aeration Mais [CO] — [a __| What are the various asymptotic notations? 2 1 ie Why are parentheses needed to specify the order of operations in infix|2 [2 expressions but not in postfix operations? : ¢ How the choice of pivot element effects the running time of quick son|2 {3 algorithm? a ,__[ What are the 2 different forms of hashing? PE) e | Whatis the significance of binary tree in Huffman algorithm? 2 |4 £.___| What is the number of edges in a regular graph of degree d and n vertices. 2] 5 le Write an algorithm to obtain the connected components of a graph. 2 5 SECTION B 2. Attempt any three of the following: oe 7x3=21 Nb fe ee L lie a Pseudo code that will concatenate two linked lists. Function should have owo parameters, pointers tothe infin ofthe lists and the function oer should link second list at the end ist. iS | Write an algorithm to converta'valid arithmetic infocexpwession inp @t7 | 2] | equivalent postfix expressigh|-Trace your algorithm for Rtowing eae expression. ~ ae : \ \ A+B*C-D/F > + + What are the disadvantages of Tinear probing in hashing? Discuss how |7 E \ quadratic probing canbe used to solve some ofthese probléas. \2* Write C function for non-recursive post order traversal, - 7 a_| 5 fo {¢ "| Consider the following graph and using Dijkstra Alga find the shortest 7 } > | path. A | | | | | 3. Attempt axt=7 [fe Foch clement of in array Data (20}[50) requires 4 bytes of storage. Base] 7 = [1 | | address of Data is 2000. Determine the location of Data [10]|10] when the array in stored us: (i) Row major | Gi) Column major _ A[Page oP-24002_146 | 16 03-2076 13:23:99 | 162.98.189.112Printed Page: 20 (OA AR (Coder BCSSOL ject Code: BCS301 ER ID-311405, fll Not Ll BTEC (SEM Ill) THEORY EXAMINATION 2023-24 DATA STRUCTURE, TIME: 3HRS How will you create link list representation of a polynomial. Explain it the suitable example. Attempt any one part of the following: ‘Write an algorithm to evaluate an arithmelic ex how the expression 3*(5-3) will be evaluate, A double ended Queue (deque) is a linear list in which additions may be made at either end, Obtain a data representation mapping a deque into one dimensional array. Write C function to udd and delete elements from either L | end of deque ‘Attempt any one part of the following: pression using st 7x1=7 Write aC program for sorting 100 integer nunibars wring selection sort fy _E\ rocedure. Discuss the worst-case time complexity of the algorithms. b. Write a program in C language to implement binary search algorithm. Also \ 3 \ discuss the average’ behavior of the algorithm. a ‘Attempt any one part of the following: Z TT a [EEE gn denois te external ad internal elpdehgih ofa binary Wee Raving Pe 1n internal nodes then show that E=I+2n, b Suppose character a, b, ¢, d.¢.f has probpbilities 0.07, 0.09, 0.12, 0.22, 0.23, | By a 0.27 respectively. Find an optional Huffrfian code and draw the Huffman tree t o What is the average code length? > ~_| Oe hs Attempt any one part of the fotipwiny VIxI=7 a Find the minimum spangingétree using Prim’s algorithm for the grag town | 7 5 Vea anny R 10 \ o—__©, © ass I~? @ 9 ex, Sf @ else \L% | ©o—7z_ e te ie a program in C language to compute the indegree and outdegree of 7 | every vertex of a directed graphy, ‘Shen the graph is represented by an adjacency matrix. 2 Page