Partial preview of the text
Download Data structure and algorithm sample paper and more Exams Data Structures and Algorithms in PDF only on Docsity!
Printed Page: J of 4 WM Subject Code: BCS301 r vou no: [2 [3[0 [0 [6 TY] fs folol2| 1] BIECH (SEM IM) THEORY EXAMINATION 2024-25 DATA STRUCTURE PAPER ID- WA A _ TIME: M.MARKS: 70 Note: Attempt all Sections. In case of any missing data; choose suitably. SECTION A 1, Attempt aff questions In brief, 2x07=14 [Ono, Question (are) F Explain why do we need a pointer to maintain a linked list structure? col wars’ fa fas ah tern ot am wat & fem sit uiéex at _| snerereren weit ere 82 ‘b. If an array starts at address 2000 and each integer takes 4 bytes, evaluate the | COl | K5 address of arr[5]? ofa wa wu vat 2000 4 aps ah @ ate yee gota 4 aed Gm @, Marcio) Bl va yea Bee {xplain Priority Queue and its significance? coz | K4 wnufiird wae ae Tae Ae Bl BHT, | | The following sequence of operations is performed on stack: PUSH (10), | CO2_ | K3 PUSH (20), POP, PUSH (10), PUSH (20), POP, Pop, POP, PUSH (20), POP. | Demonstrate the sequence of the value popped out?s... em uy fanfare omgon H siete feo od & PUSH (20), POD d. : PUSH (10), PUBH (10), PUSH (20), POP, pop, pop, uo ane feu 7 AM oT err vefeta A ¢, | Iilustrate the concept of Indexed Sequenual search, fia spf aor a sau Hl We wx ixplain the concept of NonJinear data structures with the help of cxample. “| CO4 TAR Bt Te | acter Ser dea HT saan wt | Sere g Illustrate the significance of Threaded Binary Tree. “ cos | K4 [933 ae go mea ot we wt 2 Attempt any three of the following: AS) 07x3=21 Ono, Question’, ‘S ¥ CO | Level a. An array ARR[-5...15, 10,..20] stores ¢leménts in Row Major Wise with cach | COT | KS element requiring 2 bytes of storage. Hvaluate the address of ARR[LO}15] when the base addres?1$2500, ; TH Wot are(=5..15, 10.20] 2 Fer ago Haat ot daa jad 2, feet cer aa ol 2 ome eh oT onaermar ert Cl Wa ou vat 2500 Bt tt (10) (151 % Ud wr yeotea wet if a4 stack is implemented using Linked List, tien show the logical | CO2 | K4 representation of nodes as a stack. Ilustrate PUSH and POP operations of this type of stack. | ae feta fre er tein ae aw a arate Ar are Bat ee oy wy A crea om aiden vftifer feet ge vee a Ra | eusu 3h por tare ait fafa wt 1|Page QP2SDP2_005 | 01-Mar-2025 1:23:58 PM | 122.176.608.131 C scanned with OKEN Scanner A) OTA) 000 EA PAPER ID-311623 vy Printed Page; 2 org Subject Code: BCS301 Roll No: [ | Pi BTECH (SEM HI) THEORY EXAMINATION 2024-25 DATA STRUCTURE TIME: 3 HRS c. | Construct a binary tree with the following traversals: Inorder: BCAEGDHFIJ Preorder: ABCDEGF HIJ cae & ay ue gent sat, BI: BOAEG DEEL WI: ABCDEGFurTs M.MARKS: 70 COs [KI] Construct an AVL Tree by inserting following se with an empty tree: 71,41,91,56,60,30,40,80,50,55 we url de ae ad gu, aed & frofafar sgarm at Wa Sw we avi. a ar Ant wy, 71,41, 92,56, 60, 30,40, 80,50, 55 quence of elements, starting CO4 | K3 Explain the Depth-First Search (DFS) algorithm with the help of an example graph. Which data structure is used for DFS and BFS? SF So a A Had Y Sum HL ors) Wenan a BRE) OFS SR ars & few fee ser den a aoc feat UIT 8? | cos | K4 “| | | 3. SECTION QW CT. C 07x1=070- Qno. | CO evel ] a. | Illustrate the following: a, Asymptotic notations b. Time Space Tradeoff ) c. ADT x NY Prafafad #3 ze a. > b, Waa wr ord c. ADT | Qi \ | K4 Illustrate how to represent the polynomial using linked, list? Construct a C | Program to add two polynomials using linked list. o.0° Was ql ow wuain oe gue a ee eet ore, gam Sa <> fees Eh wT oe ae at aguel wt asa & fae c Sa wart) | col Ww)” c > Attempt any one part of the following: 07x 1=07 Qno. @ Quéstion CO | Level Construct a Queue using a lipked list? Include functions insert(), delete(), print().Explain how a circular queue overcomes the limitations of a simple queue, ‘ ‘ " fees eh wr sein ab wan 7 aio wt insert (}, delere(), print() Waa wifra wt) rent fe uw quer PIR UW WRT wa st ensil BH ag on ae 2 ] C02 1 K3 | | Construct a C program to check whether the parentheses are balanced in an expression, foal cine a whew vgfir Fo a, gaat ola at ® fac CO2 | K3 thm a fai ay. QP25DP2_005 | 04 C scanned with OKEN Scanner Printed Page: 4 of 4 IAIN WA A Il Subject Code: BCS301 APER ID-31 16; Roll No: | | [lt | | | BTECH (SEM IL) THEORY EXAMINATION 2024-25 DATA STRUCTURE _ TIME: 3 HRS M.MARKS: 70 (iv) Connveted and Disconnected Graph (v) Cyele ina Graph (vi) Directed and Undirected Graph (vii) | MST Puffa ap weaadt at gare Wea AARNE: (4) Te (iy WR oF (iii) hh a fen (iv) Ost sik feeartats orp (v) Oe Fy ap (vi) Pra sik shrek ae (vii) WAGE} C scanned with OKEN Scanner 
