Total No. of Questions—8] [Total No.

of Printed Pages—3

3
5:3
9:5
Seat
[5459]-192

80
1/2 1
No.

9
01
8 2 130
S.E. (CE) (Second Semester) EXAMINATION, 2018

2/1
16 P0
ADVANCED DATA STRUCTURES
8.2 G
.23
.24 CE

(2015 PATTERN)

Time : Two Hours Maximum Marks : 50

3
5:3
N.B. :— (i) Answer to the questions Q. 1 or Q. 2, Q. 3 or Q. 4,
49

9:5
Q. 5 or Q. 6, Q. 7 or Q. 8.

80
(ii)
91
Assume suitable data, if necessary.
01
30
1/2
(iii) Draw neat labelled diagram wherever necessary.
01
2/1
GP

(iv) Figures to the right indicate full marks.

82
.23
CE
16

1. (a) Let characters a, b, c, d, e, f have probabilities 0.07, 0.09,

8.2
.24

:33
0.12, 0.22, 0.23, 0.27 respectively. Find an optimal
49

:55
Huffman code and draw Huffman tree. What is the average
09

code length ? [6]

91
18
30
/20

(b) Write an aigorithm for Preorder traversal of binary tree and

/11
01

give suitable example. [6]

22
P

Or
8.2 G
38
CE
6.2

2. (a) Draw any directed graph with minimum 6 nodes and represent
1

graph using adjacency matrix, adjacency list, adjacency multilist

.24

and inverse adjacency list. [6]

49

P.T.O.
 (b) Consider the graph represented by the following adjacency matrix :

3
5:3
9:5
1 2 3 4 5 6

80
1/2 1
9
01
1 0 3 1 6 0 0

8 2 130
2 3 0 5 0 3 0

2/1
16 P0
3 1 5 0 5 6 4
8.2 G
.23
4 6 0 5 0 0 2
.24 CE

5 0 3 6 0 0 6

6 0 0 2 2 6 0

3
5:3
49

9:5
80
91
And find minimum spanning tree of this graph using Prim’s
algorithm. 01 [6]
30
1/2
01

3. (a) Explain about a skip list with an example. Give applications

2/1
GP
82

of skip list. [6]

.23
CE

(b) What is hash function ? Enlist characteristics of a good hash

16

function. Explain modulo Division and folding method. [6]

8.2
.24

:33
Or
49

:55
4. (a) Construct the AVL tree for the following data by inserting
09
91

each of the following data item one at a time : [6]

18
30
/20

10, 20, 15, 12, 25, 30, 14, 22, 35, 40

/11
01

(b) Explain the following :

22
8.2 G
P
38

(i) Static and dynamic tree tables with suitable example. [3]
CE
1 6.2

(ii) Dynamic programming with principle of optimality. [3]

.24
49

[5459]-192 2
 3
5. (a) Write an algorithm to arrange numbers in ascending order

5:3
using heapsort. Arrange the following numbers in ascending

9:5
80
order using heapsort : [7]

1/2 1
9
01
8 2 130
48, 0, –1, 82, 10, 2, 100

2/1
(b) Construct B+ tree of order 3 for the following data : [7]
16 P0
8.2 G

1, 42, 28, 21, 31, 10, 17, 7, 31, 25, 20, 18

.23
.24 CE

Or

6. (a) Build the min-heap for the following data : [8]

3
5:3
49

25, 12, 27, 30, 5, 10, 17, 29, 40, 35

9:5
80
91
After creation of min-heap perform one delete operation on
it and show the final min-heap. 01
30
1/2
01

(b) Write short notes on : [6]

2/1
GP
82

(i) Red-black tree

.23
CE

(ii) K-dimensional tree.

16
8.2

7. (a) Explain any three operations carried out on sequential file.

.24

:33
Write pseudo code for each these three operations. [6]
49

:55
(b) Explain Linked organization of a file. [6]
09
91
18

Or
30
/20
/11
01

8. (a) Define sequential file organization. State advantages and

22

disadvantages of sequential file organization. Write pseudo code

8.2 G
P
38

for insertion of records in sequential file. [6]

CE
1 6.2

(b) Explain any two types of indices. [6]

.24
49

[5459]-192 3 P.T.O.