USN

ffiW ..1:' '::::::,, ,

BCS304

Third Semestcr B.E./[Link]. Degree Examinqtion, D ec.20l23/ J an.20l24

Data Structures and nshiCations
Time: 3 hrs. Max. Marks: 100
q;r::::

Note: 1. Answer any FIW full qaestions, choosin[ft]Nn full queslion from each modale.
2. M : Marks , L: Bloom's lcvel , C: Coursi outcomes.

Moduld;1.,: M L C
Q.l a, Define Data Structures. Explain witt+r,Sat"block schematic differenfutype of 10 L2 co1
data structures with examples. Whal i#e the primitive operationsryhat can be
performed? '
, ";
b. Differentiate between structp?g'#and unions shown examples for both. 5 Ll col
c. 5 L2 col
OR
Q.2 a. Define stack. GiV$,the implementation of Push q], POP ( ) and display ( ) 7 L2 co1
functions by cbpsidering iG empty and full conditions
b. Write ah algorithm to evaluate a postfx €tpression and apply the same for 7 L3 col
the givetl'riiosffix expression 6,2, 1,3, -,.4,2, *, *
cr Writo.{hE?ostfix form of the follo*inrg using stack : 6 L3 cor
'(l) " A*(B*C+D*E)+F (ii) (a+(b*c)/(d-e)) ,.,,...,:,:,,:.:,,,

Module - 2 ,,,,

Q.3 a" What are the disadvantages of ordinary quzue? Discuss the implementation 8 L2 co2
olcircular queue.
b. 6 L2 coz
c. Define Queue. Discuss how to represent g\ieue using dynamic arrays. 6 L2 co2
.l:.
",
llil'
o
Q.4 a. What is a linked list? Explain the;:difGient types of linked lists with neat 4 L2 c02
diagram.
b. Give:th'distructure definitioa Qr,piiigly linked tist (SLI,;. Write a C function 8 L3 coz
to,
,,(i) Insert on elemlirt"at the end of SI:Iu,
,,d1.
(ii) Delete q node at the beginning of S,LL.

t,,di Write a C-functi,5fii$to add two polyn6mials

- show the linked list 8 L3 co2
representation oiUbto* trvo polynomials
P(x):3x'o + 2xE +l
q(x)=8xr1"-3x'o+lox6
''$'Module - 3
Q.s a. Write a C-function for.'th6 following operations on Doubly Linked List 8 L3 co3
(DLL):
(i) addition of a node"
(ii) concptsndtion of two DLL.
b. Write C funcJibriWor the following operatiors on circular linked list 8 L3 c03
(D ffi*ting at the front ofa [st.
(ii) Findine the lensth of a circular list.
I of2
 BCS3O4
c. for the gi ren spa$e matrix, give the diagrammatic linked representation. 4 L3 c03
2000
40 0 3

A: 0000
8001
0060
OR
Q.6 a. Disc,rss how binary tree are represented uqp$' .it, :::::: 6 L2 co3
Array
(i) (ii) Linked lid " tri,r,,

b. @[Link] "lb$el order traversal with suitable 8 L2 co3

recursive function for each. ..,nr[a' .::..,::

c. 6 L2 co3
'.\ ]Ffodule - 4
Q.7 a. mite a function to perform the'following operations on-Bihary Search Tree 8 L3 co4
(BSr):
(t Inserting ft BST.
elerirent into tr'*mitl '

(ii) Recursivq'[Link] of a BST. ,::::i

b. 8 L2 co4
c. Explain'Traqsftding a frst into a binary tree:with an example. 4 L2 co4
OR,,*"
Q.8 a. Define graph. Show the adjacenc 6 L3 co4
ofthe aph given below (Refe;. F (a)).

, .'t''"..

:::::::::.

.! ::a- " ; rrrig,

,,,11[r* "',,

i;:'

b. Define the folktw,ing Terminologies yiffi,bxamples, 8 L1 co4

(i) Di'graph {
(ii) Weighted graph ,,..,,1*i' .." +
tiii2 SelllooP
(iv) Parallel edges ;
c. 6 L2 co4
Module -,,'5"'l::,::,,,,

Q.e .,'a::
,,,.What is collision? W,,
are the methodsnfto:iesolve collision? Explain linear 7 L2 cos
probing with an exdmple.
b. 6 L2 cos
c. Discuss Lef,tlitr,:Trees with an exitriple. 7 L2 cos
OR
Q.10 a. Explain different types o-ft{ASH function with example. 6 L2 cos
b. Discuss AVL tree wifhran example. Write a function for insertion into an 6 L3 cos
AVL Tree.
c. Define Red-blaekTree, Splay tree. Discuss the method to insert an element 8 L2 cos
into Red-Black',#
*****
2 of2
,it i=,,
USN

:i rii

Third Semester B.E./[Link]. De gft:p'T, x a min atio n o D-,es. 20 23 I J an,2O2 4

Data Struc,tr,rr'es and Appl ications

7 c. Explain Transforming a foiestinto a binary tree wrth an example.

'',,,t:

i;,
4.1*.]::,,,, .

',:ili