Total No. of Questions : 8] SEAT No.

8
23
PB-4462 [Total No. of Pages : 3

ic -
[6261]-36

ta t
0s
S.E. (Computer Engineering/Artificial Intelligence & Data

8:5
Science Engineering)

02 91
3:3
DATA STRUCTURES AND ALGORITHMS

0
41
8/0 13
(2019 Pattern) (Semester - IV) (210252)
0
5/2
.23 GP

Time : 2½ Hours] [Max. Marks : 70

Instructions to the candidates:
E
81

8
C

1) Answer to the questions Q. No. 1 or Q. No. 2, Q. No. 3 or Q. No. 4, Q. No. 5

23
or Q. No. 6, Q. No. 7 or Q. No. 8.

ic-
16

2) Draw neat labelled diagrams wherever necessary.

t
sta
8.2

3) Figures to the right indicate full marks.

:50
4) Assume suitable data, if necessary.
.24

91
:38
49

Q1) a) Elaborate following terminologies : [6]

13
30

i) Graph
24
01

ii) Adjacency List

/20
GP

iii) Adjacency Matrix

/05

b) Differentiate between tree and graph. [6]

8
CE
81

8
c) Write pseudo code for Floyd-Warshall algorithm. [6]

23
.23

OR
ic-
16

tat
Q2) a) Find the shortest path using Dijkstra’s algorithm. Write all the sequence
8.2

0s

of steps used in algorithms. [6]

.24

8:5
91
49

3:3
30
41
01
02
5/2
GP
8/0
CE
81

b) Write Prim’s algorithm to find minimum spanning tree. [6]

.23

c) Write the applications of : [6]

i) Graph
16
8.2

ii) BFS
.24

iii) DFS
49

P.T.O.
Q3) a) Explain following terms w.r.t. symbol table : [6]

8
23
i) Insert & lookup operations

ic -
ta t
ii) Advantages

0s
iii) Disadvantages

8:5
02 91
b) Construct an AVL tree having the following elements : [6]

3:3
0
41
H, I, J, B, A, E, C, F, D, G
8/0 13
c) Insert 15, 10, 17, 7 in splay tree. [6]
0
5/2
.23 GP

OR
E

Q4) a) What is the need of AA tree? List the five invariants that AA tree must
81

8
C

23
satisfy. [6]

ic-
b) Who developed K-D tree? What is the purpose of K-O tree? Insert step
16

t
sta
8.2

by step (7, 8), (12, 3), (14, 1), (4, 12), (9, 1), (2, 7) and (10, 19) into K-D

:50
tree. [6]
.24

91
:38
49

c) Show the balanced AVL tree after deletion of mentioned node : [6]
13
30

i) Delete 30
24
01
/20

ii) Delete 55
GP
/05

iii) Delete 60
8
CE
81

8
23
.23

ic-
16

tat
8.2

0s
.24

8:5
91
49

3:3
30
41
01
02

Q5) a) What is indexing? What are the advantages of indexing? Discuss clustering
5/2
GP

index with example. [6]

8/0

b) Construct a B-Tree of order 3 for following data : [6]

CE
81

50, 30, 21, 90, 10, 13, 20, 70, 25, 92, 80.
.23
16

c) Why B+ tree? List its properties and advantages. [5]

8.2

OR
.24
49

[6261]-36 2
Q6) a) Explain with example trie tree. Give properties and advantages of trie

8
23
tree. [6]

ic -
b) Build B+ tree of order 3 for the following : [6]

ta t
F, S, Q, K, C, L, H, T, V, W, M, R

0s
8:5
c) What is difference between B and B+ tree? [5]

02 91
3:3
0
41
Q7) a) 8/0 13
Explain Index Sequential file and discuss their advantages and
disadvantages. [6]
0
5/2
.23 GP

b) List & explain two possible ways of representing records. [6]

E

c) Differentiate between indexed sequential file and direct access file. [5]
81

8
C

23
OR

ic-
16

Q8) a) Explain Sequential file organization and discuss their advantages and

t
sta
8.2

disadvantages. [6]

:50
.24

b) What is coral rings? Describe inverted files w.r.t linked organization. [6]
91
:38
49

c) Explain Direct Access file. [5]

13
30
24
01


/20
GP
8 /05
CE
81

8
23
.23

ic-
16

tat
8.2

0s
.24

8:5
91
49

3:3
30
41
01
02
5/2
GP
8/0
CE
81
.23
16
8.2
.24
49

[6261]-36 3