Total No. of Questions : 8] SEAT No.

8
23
P-1532 [Total No. of Pages : 3

ic-
[6002]-161

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

3:3
02 91
DATA STRUCTURES AND ALGORITHMS

0:3
0
(2019 Pattern) (Semester - IV) (210252)

31
4/0 13
0
Time : 2½ Hours] [Max. Marks : 70

om
6/2
.23 GP

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.
E
82

rsic-238
.c
2) Assume suitable data, if necessary.
C

3) Draw neat labelled diagram wherever necessary.

16

tat
4) Figures to the right indicate full marks.
8.2

es
:32
.24

Q1) a) :33p
Write an algorithm for depth first traversal of a graph. [6]
02P 91
49

0a
b) Construct the minimum spanning tree (MST) for the given graph using
0
31
4/0 n13

Prim’s Algorithm staring from vertex 6. [6]

P0
6/2
8 2 io
.23 tG
CE
s

38
ue

c-2
i
16

tat
Q
8.2

2s
.24

3:3
PU

91
49

0:3

c) What is topological sorting? Find topological sorting of given graph.

30
31

[6]
SP

01
02
6/2
GP
4/0
CE
82
.23
16
8.2

OR
.24
49

P.T.O.
Q2) a) Write an algorithm for breadth first traversal of a graph. [6]

8
23
b) Using Prim’s Algorithm, find the cost of minimum spanning tree

ic-
(MST) of the given graph starting from vertex ‘a’ - [6]

tat
2s
3:3
02 91
0:3
0
31
4/0 13
0

om
6/2
.23 GP
E
82

c) Define the following terms : [6]

rsic-238
.c
C

i) Complete Graph
16

tat
ii) Connected Graph
8.2

es
:32
iii) Subgraph
.24

:33p
02P 91
49

0a
0

Q3) a) Construct an AVL Tree by inserting numbers from 1 to 8. [6]

31
4/0 n13

b) Define Red Black tree. List its properties. Give example of it. [6]
P0
6/2
8 2 io

c) Write functions for RR and RL rotation with respect to AVL tree. [6]
.23 tG

OR
CE
s

38
Q4) a) Construct an AVL Tree for following data : [6]
ue

50, 25, 10, 5, 7, 3, 30, 20, 8, 15 c-2

i
16

tat
Q
8.2

2s

b) Explain with example K dimensional tree. [6]

.24

3:3
PU

c) Explain static and dynamic tree tables with suitable example. [6]
91
49

0:3
30
31
SP

Q5) a) Construct a B-Tree of order 3 by inserting numbers from 1 to 10. [9]

01
02
6/2

b) Explain following primary index, Secondary index, Sparse index and

GP

Dense index with example. [8]

4/0
CE
82

OR
.23

Q6) a) Construct a B Tree of order 5 with the following data : [9]

16

DHZKBPQEASWTCLNYM
8.2

b) What is trie tree? Explain insert and search operation on it. [8]
.24
49

[6002]-161 2
Q7) a) Explain multilist files & coral rings. [9]

8
23
b) What is Sequential and index sequential file organization? State its

ic-
advantages and disadvantages. [8]

tat
OR

2s
3:3
Q8) a) Explain inverted file & cellular partitions. [9]

02 91
0:3
b) Explain direct access file organization. State its advantages and

0
31
4/0 13
disadvantages. [8]
0

om
6/2
.23 GP


E
82

rsic-238
.c
16
C

tat
8.2

es
:32
.24

:33p
02P 91
49

0a
0
31
4/0 n13
P0
6/2
8 2 io
.23 tG
CE
s

38
ue

c-2
i
16

tat
Q
8.2

2s
.24

3:3
PU

91
49

0:3
30
31
SP

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

[6002]-161 3