T
Ft2023t7483 Total Pages : 4
Third Semester
Computer Science & Engineering/IT
Scheme OCBC July 2022
DATASTRUCTURES
Time: Three Hours Maximum Marks : 70
Note :I Attempttotalsxquestions. QuestionNo. 1(Objectivefype) is
compulsory. From the remaining questions affempt arryfwe.
gd{ u: qaq E-f, frftqt qqc trqifi (q-qfrE q-m]{ or) I
GTftqrd tr iq qet { t fr-fl q"rq d ea frfrrqr
D ln case of any doubt or dispute, the English version question
should be treated as final.
frffi tfr e-n-R *'qttt eierqr ft-4rq fr fufr it 3iifr qTsr b
qeq oi 3iftq q-ay er}lnt
1. Choose the correct answer. 2 each
v$ uot cn-r qq-q fiftqr
D Which ofthe following is a lineardata sfructure?
(a) Array (b) AWtrees
(c) Binarytees (d) Graphs
ftq it t otq-sr mfrqr srdr qfl{ t? {r
(er) it (e) Awil
(v) am+S fl (q) qr.6
0 When a PoP( ) operation is called on an empty staclg what is the
conditioncalled
(a) Over{ow (b) Underflow
(c) Syntaxerror (d) Garbagevalue
w PoPQ eftten 6) ffi qrd €ffi q{ efm fr-qr qmr t, d
Rrfr t
6-d-.flfr
(eT) *+qwfr (e) dsid
(q) fubtr TR (<) rntto 161
F12023t7483 P.TO.
rts
I
l2l
m) which of the following represents the postorder traversal of a
binaryTree?
(a) Left+Right-+Root
(b) Left + Root + Right
(c) Right-+Left-rRoot
(d) Right-+Root+Left
ffifur if t ot{ nqrs il fr fr€qydr *rda 6t e-qf{ln
trrfi t
(s{) AqE -+ tr{d + sz
(e) d.E + 6z + {r{c
(s) tt-{c -+ atqe + s-d
(q) ttEe + Ez + dqe
iv) Which data structure is based on the Last In First Out (LIFO)
principle?
(a) Tree (b) Stack
(c) Linkedlist (d)eueue
otq-$r srcT qffi{ ane fi m-€ eirse fr-<id qr ord oror t
(er) fl (e) ra6
(s) fuas furz (q) rt
v) What is the outcome ofthe prefix expression-t- ,-,*,3,2, /,8,
4, r?
ftq fifr-tr g+wisr{ irr ansemq rqr t?
*r_, *r 3r2, lrgr4, I
(a) t2 -(b) il
(c) 5 (d) 4
2. a) Whatdoyouunderstandbydatastructure? 2
srer qtrq-t t enq rqr q,rsi te
b) Differentiate between primitive and non primitive data stuchre.
4
ftfrfu si qfT-ftfreq srer EnR it Biffi 6ftqr
c) Explain different tlpes of operations on data structures: 6
srer qqqr w riq{ Eti qT-e frfr.d sfiqtetq utr qrsr{}r
F1202317483 Contd.....
t3l
3. a) WhatisStack?Whataretheapplicationsofstack? 2
fr qqr Bqq)fr-dT t?
€m eqr tz rto
b) ExplainaboutDe-queue. 4
d-oXb qTt d er-seir
c) Convert the inf,rx expression Q into its equivalent postfix
expressionusingstack. 6
Q:a+b*(c+d)-elf
$|6 b fl{r qtRiffi gqnuism aa} vrgeq ffiffi \'ffiiqq
d e-qftqr
Q:a+b*(c+d)-elf
4. a) Definelinkedlistinbrief. 2
frqs ftr$e o) iifl*H ii e,rs{r{ir
b) Explaintheapplicationoflinkedlist. 4
krs ft-€ a sqdftor o) qrrflr-Sr
4 Compare among circular linked list, doubly linked list and
generalizedlistindetail. 6
q-{ffi fttrs fr€, sd ft€ ft-€ si qqrdr{w fu{e & frE
d fr-qd ga-rr fiftq;
5. a) Whataretree? 2
* aqr ator tz
b) Definegraphwithdiagram " 4
qr$'o) frr $frd qffif, fiFrqr
c) Explain various tee taversal methods with example. 6
frfrq * ffia +ers et .g+fl. stro qrETI$At
6. a) Whatdoyouunderstandbydegreeoftree? 2
* fr Rfr t eirq aqr qqgd ta
b) Explaindifferenttypesofqueues. 4
frft-{ q-6.n fr rqq o1 qr-flrsSr
c) Explain various graph representation methods with example. 6
qrs fffffu* q-qqh ilf,-+di o\ sqr{rq stro wwr}r
Ft2023t7483 P.TO.
t4)
7. a) Explaintypesofbinarytree. 2
eTT{-S ** q'mTti o} qrrflIdr
b) Explainvarious Graph Traversals. 4
fr&T qm t{fu qi Bqsrsdr
c) DiscussRoundRobinalgorithm. 6
ir.is {fR-{ vailRerq' o\ erfls$r
8. a) Explainlnorder,preorderandpostorderisonesentence. 2
g{stigr, frqfrft si qtffiif& o} go qrq ii qrsr$r
b) Explainthe followingrelatedto graphs. 4
D Adjacentvertices
0 Adjacentedges
qls't qd&d ft"{ #i d e.rsrq}r
D ssqifu qfffi
0 wq+c qiIT
c) Evahratethe followingpostfixexpression.Also give each step of
stackprocpsslng. 6
12,7,3,-,1,2,1, 5, +, *, +
ffifun frrRffi \'triem 6) evaluate fifrq G *t frefiqIT
* q-.n-6 €c 6\ rfr ftfuqr
12,7,3,-r1,2,1,5, +, *, +
*r?r@<s-
Ft2023t7483
