Total No. of Questions : 8] SEAT No.

8
23
P9135 [Total No. of Pages : 3

ic-
[6179]-261

tat
S.E. (Information Technology Engg.)

4s
DATA STRUCTURES & ALGORITHMS

9:4
02 91
9:3
(2019 Pattern) (Semester - III) (214443)

0
40
1/0 13
Time : 2½ Hours] [Max. Marks : 70
0
1/2
Instructions to the candidates:
.23 GP

1) Answer Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.

E

2) Neat diagrams must be drawn wherever necessary.

80

8
C

23
3) Figures to the right indicate full marks.

ic-
16

tat
8.2

Q1) a) Explain stack data structure as an ADT and Discuss briefly applications

4s
of stack. [6]
.24

9:4
91
49

b) Write sudo code for insert and delete operations of linear queue. [5]
9:3
30
40

c) Discuss the types of priority queue with their applications. [5]

01
02

OR
1/2
GP

Q2) a) Convert the following infix expressions to postfix using stack. Clearly
1/0

indicate the contents of stack. [6]

CE
80

8
23
( A + B) * C− D* F+ C
.23

i)
ic-
16

tat
ii) ( A − 5) * ( B+ C− D* E ) / F
8.2

4s
.24

9:4

b) Write sudo code for insert & delete operations of circular queue. [8]
91
49

9:3

c) Enlist applications of Queue data structures. [2]

30
40
01
02
1/2

Q3) a) Explain importance of threaded binary tree and Discuss inorder threaded
GP
1/0

binary tree with example. [6]

CE
80

b) Write sudo code for deleting a node in BST considering all scenarios.[8]
.23

c) Discuss with the help of example, the significance of height of tree and
16

depth of a tree. [4]

8.2
.24

OR
P.T.O.
49
Q4) a) Enlist the difference between a general tree & binary tree. Convert the

8
23
given general tree to binary tree and write down the steps required for the

ic-
same. [8]

tat
4s
9:4
02 91
9:3
0
40
b) 1/0 13
Write sudo code for creating a BST of N-nodes. [6]
0
1/2
c) Explain with the help of example, threaded binary tree traversals. [4]
.23 GP
E
80

8
Q5) a) For the given graph show step-wise representation of MST using
C

23
ic-
Kruskal’s algorithm. [6]
16

tat
8.2

4s
.24

9:4
91
49

9:3
30
40
01
02

b) Construct an AVL search tree by inserting the following elements in the

1/2
GP

order of their occurence. Show the balance factor and type of rotation at
1/0

each stage. [8]

CE
80

8
c) Enlist and discuss applications of Heap. [4]

23
.23

OR
ic-
16

tat
8.2

Q6) a) Find the MST using Prin’s algorithm for the following graph. Also write
4s
.24

9:4

algorithm for the same. [8]

91
49

9:3
30
40
01
02
1/2
GP
1/0
CE
80

b) Which data structures supports to perform sorting using heap data

.23

structure. Explain it to sort it in ascending order. 1, 12, 9, 5, 6, 10. [8]

16
8.2

c) What is the time-complexity of Prin’s algorithm & Kruskal’s algorithm.[2]

.24

[6179]-261
49

2
Q7) a) Explain why file opening nodes are important while opening any file.

8
23
Explain the use of following file-opening nodes. [8]

ic-
tat
i) ios : : app

4s
9:4
ii) ios : : ate

02 91
9:3
0
40
iii) ios : : in
1/0 13
0
b) For a given set of values : [10]
1/2
.23 GP

9, 45, 13, 59, 12, 75, 88, 11, 105, 46

E
80

8
C

23
Create a hash table and resolve collison using chaining and without

ic-
16

replacement.

tat
8.2

4s
.24

OR
9:4
91
49

9:3
Q8) a) Write sudo code to perform following operations on sequential file: [8]
30
40
01
02

i) Create and display

1/2
GP

ii) Insert a record

1/0
CE
80

8
23
b) What is hashing? Explain various hash collision resolution techniques.[8]
.23

ic-
16

tat
c) What is the time complexity of a deleting a record from indexed sequential
8.2

4s

file. [2]
.24

9:4
91
49

9:3
30
40


01
02
1/2
GP
1/0
CE
80
.23
16
8.2
.24

[6179]-261
49