Scribd
Upload
5 views

2022373(022)

Qp

Uploaded by

Rakesh gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

2022373(022)

Qp

Uploaded by

Rakesh gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Roll No.

2022373(0221
Dip. in Engg. (Third Semester)
EXAIINATION, ApriI-M ay, 2024
(Scheme : NITTTR)
(Branch : CSE, IT)
DATA STRUCTURE
Time : Three Hours ] t Mmimum Marks : 70
lMinimum Pass Marks : 25

Note : All questions are compulsory. Each question having


three parts, attempt any two of them. [n case of any
doubt or dispute the English version question
should be e treated as final.

wrft qM $tq+o, xr{ d ftq qrrr t, s{f,


qfi
frftddotwffistffifimndsaE
srQrqr frqrq of fufr d sti-fr qM d qyq Ei offrq
fl-{ qrgn I

1. (a) Explain various non-primitive data structures


t
with suitable example. 7

ftftq non-primitive data structures OT gP"m


vEr6lrr d qrq qrfl-d t

P. T. O.
I2l 202237310221

o) Write an algorithm to search an item from given


array of elements. ,l t

ftt .rV array of etements fr ot{ item qd 6Ti


d ldq gi"if€4 ftm I

(c) Define shing. Explain any nio predefined string


functions with suitable example. 7
String 01 qfuTrql ftffi I 6t$ d predefined
string tunctions .Dt $Erflut d ml qqEilSi I

2. (a) Explain PUSH operations on stack with suitable


example. 7
Stack d PUSH operations d gqg-m v{r6tur
qtrd srsr{q r

(b) Explain recursion with suitable example. 7


Recursion o) Bqgm EffErul qRT HT$r{q f

(c) Define queue. Explain the process to insert a new


element into a queue. 7

eueue 6i qR{Trk otfut I eueue { Tt


element thl insert o.{i 01 qfu-fl ol gqfl-{g f

3. (a) Define pointer variable. Explain various


arithmetic operators used in pointer. 7
Pointer variable O) qfuTf&d O1ffi I pointer t[
Bq+rf dt qrd frftq arithmetic operators iDt
HIT$Ir{q I
l3l 202237310221

(b) Write a simple C program to illustrate passing an


array to a function using pointer. 7

Pointer of {r6Frfl t fo, array o} fuft


tunction t qrfl o{t d fut f'o c frr;rq ftffi t

(c) Explain the differences between Structure and


Union. 7

Structure Sq Union d fiq simq wq-flEq t

4. (a) Define header node. Explain singly and doubly


brief.
linked list in 7

Header node irt qfuTrfud otfrrt l Singly Sr


doubly tinked list irl TifuK d vrgrgq t

(b) Write down the algorithm to insert a new node at


beginning ofthe linked list. 7

Iinked list at gwm t rqr node frst d fuq


algorithm frfui t

(c) Define circular linked list. Explain any five


detail.
applications of linked list in 7

Circular linked list et qfuTrB( otM I Linked

list d ot$ frq applications oi fuffiR t


wlffir{q I

P. T. O.
t4l 202237310221

5. (a) Define the term graph. Find an incidence matrix


for the following graph : 7

Graph o) qfuTrfrd otfuq I fit ftS r( eraph d


ftrg incio"nce matrix Hra otfui :

4
8
7

(b) Write syntax in C programming to declare a


bhury tree. Explain major difference between
Binary tree and Binary search ffee with suitable
example. 7

Binary tree of declare tD.-{i d ffiq C


programming i[ syntax ftm I Binary nee $]t

Binary search tree tf 19 $il{ o} B-{r6-rur Tfu


qrflr{s r
.:l

t5l 202237310221

(c) Perform in-order and pre-order traversal in the


following binary search hee : 7 +

frt fu$ ,rt uirru.y search tree tl in-order GlYt

pre-ordertraversal, of rffifil difug ,

)
2022373(022)

You might also like