Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
5 views

Sem-III Data Structures and Algorithms

Uploaded by

Omkar Kumbhar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

Sem-III Data Structures and Algorithms

Uploaded by

Omkar Kumbhar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Total Na, of

Questions: 5]
P1288 SEAT Na
(Tutal Na, uf
(6055]-101
S.Y.B.Se. (Coaputer Scicnc)
CS-231:DATASTRUCTURES ANDALGORITHMS
(2019 Pattern) (Senester- IID (23121)
(Max. Marks:35
Time:2 lHours)
Instructions to the candidates:
I) All questians are compulsary.
Figures t the righ indicata full marks
J) Neut disraLIns hat he drgs mkenerr neorssurs.

(8xl=8]
Q) Altenipt any ilCGlHT od the fotewing.
) Definc Data Object.
ly What are the advantages of ADI
c) Write uny two applicativas of Queue
stak?
T WIhat is top of the
u False. "Queus Fotloe i.as in Fist out (1IFo) Order".
State Thue
Wite the time complexitýof nnerge sort.
What is stack undertow? oA6062028
1429
Define space complexity. APO11691
What is circularqueue?
in recursion?
Which data structure is used

|4x2=8|
the following.
02) Atempt any four of
What are difterent asymptotic notations?
a)
on dequeue.
the operations performed
List
expression of the followng(A+B) (C-D).
Write the postfix linked list.
singiy
Write noxde structure of
applications of stack.
Give any two
(2x4=8]
(03) Aempt any TWO ot the tollowing:
l1nked list.
Write a'C funtim for deleting element from singly
M Sot the following elementsusIne insertion sorting metho.

25. 15.45, 85. 5 $5. 35.65


Wite a Cfuncton to reverse singly linked list.

(2x4=8]
04) Attempt anytwoof he follow ing:
Explan with example -Generalized inked list
scarch algorithm.
b Wrie 'C huncion for inplementing Lincar
ABCLetA= 5, B=6, C=4).
Evaluate the tollow ing pxstfis expreson

|1x3=31
05) Atempt any one of thc tollow ng
Write a short note on prnts qoeie
b) Detine the folloWing terms

) Time complexity
u) Doubly Ended Queue.

|6055|-101

You might also like