Total No. of Questions : 8] SEAT No.

8
23
P1527 [Total No. of Pages : 2

ic-
[6002]-156

tat
S.E. ( Computer / AI & DS)

0s
FUNDAMENTALS OF DATA STRUCTURE

8:4
(2019 Pattern) (Semester - III) (210242)

02 91
0:2
Time : 2½ Hours] [Max. Marks : 70

0
31
4/0 13
Instructions to the candidates:
1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
0

om
2) Figures to the right indicate full marks.
6/2
.23 GP

3) Neat diagrams must be drawn whenever necessary.

4) Make suitable assumption whenever necessary.
E
81

rsic-238
.c
C

Q1) a) Write a pseudo code for binary search apply you algorithm on the
following no.s stored in an array to search no:23 & 100. [9]
16

tat
9,17,23,40,45,52,58,80,85,95,100
8.2

es
:40
.24

b) Explain the selection sort with algorithm sort the following no.s using
:28p
02P 91
selection sort & show the content of array after every pass. [9]
49

0a
27, 76, 17, 9, 45, 58, 90, 79, 100.
0
31
4/0 n13
P0
6/2

OR
8 1 io
.23 tG

Q2) a) Explain quick sort algorithm with suitable example. What is time
CE

complexity of quick sort algorithm. [9]

s

38
ue

c-2
b) Write a short note on sentinel search & Index sequential search with
i
16

tat
suitable example. [9]
Q
8.2

0s
.24

8:4
PU

91

Q3) a) Write a pseudo code to insert new node in to singly link list. [9]
49

0:2
30
31

b) Explain the representation of polynomial using GLL. [9]

SP

01
02
6/2

OR
GP
4/0

Q4) a) What is doubly linkedlist. Explain the process of deletion of element

CE

from doubly linked list with example. [9]

81
.23

b) What is dynamic data structure. Explain with circular linked list with it’s
16

basic operation. [9]

8.2
.24

Q5) a) Write a pseudo code for basic operation of stack. [8]

P.T.O.
49

[6002]-156 1
 8
23
b) What are the variants of recursion. Explain with example. [9]

ic-
tat
OR

0s
Q6) a) Write algorithm for posfix expression evalution. Explain with suitable

8:4
example. [8]

02 91
0:2
b) Explain the linked implementation of stack with suitable example. [9]

0
31
4/0 13
Q7) a) Write pseudo code to implement circular queue using array. Explain it’s
0

om
6/2
.23 GP

basic operation. [9]

E

b) Explain array implementation of priority queue with all basic operation.

81

rsic-238
.c
C

[8]
16

tat
OR
8.2

es
Q8) a) Explain linked implementation of queue with suitable example. [9]

:40
.24

:28p
02P 91
49

b) Write pseudo code for insertion operation of input restricted & output
0a
restricted double ended queue. [8]
0
31
4/0 n13
P0
6/2
8 1 io
.23 tG

… … …
CE
s

38
ue

c-2
i
16

tat
Q
8.2

0s
.24

8:4
PU

91
49

0:2
30
31
SP

01
02
6/2
GP
4/0
CE
81
.23
16
8.2
.24
49

[6002]-156 2