Total No. of Questions : 8] SEAT No.

8
23
P654 [Total No. of Pages : 2

ic-
[5869] - 283

tat
S.E. (Information Technology)

3s
DATA STRUCTURES & ALGORITHMS

0:5
(2019 Pattern ) (Semeser - III) (214443)

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

0
20
8/0 13
Instructions to the candidates:
1) Answer Q.1, or Q.2, Q.3 or Q.4, Q.5or Q.6, Q.7 or Q.8.
0
2) Neat diagrams must be drawn wherever necessary.
6/2
.23 GP

3) Figures to the right side indicate full marks.

4) Assume suitable data, if necessary.
E
82

8
C

23
ic-
Q1) a) Convert the following infix expressions to prefix expressions using stack
16

tat
data structure.
8.2

3s
i) A+B*C^D-E/F
.24

0:5
ii) ((A+B)*C-(D-E))^(F+G) [9]
91
49

8:5
b) Implement Priority queue using linked representation and mention the
30
20

time complexity of operations. [9]

01
02

OR
6/2
GP

Q2) a) Write sudo code for converting a given infix expression to postfix
8/0

expression and apply the algorithm to convert (a+b)*c to postfix. [9]

CE
82

b) Write a code for singly linked list creation, insert and Display and mention

8
23
the time complexity of operations. [9]
.23

ic-
16

tat
8.2

Q3) a) Suppose the following sequence lists the nodes of a binary tree in preorder
3s

and inorder respectively. [9]

.24

0:5
91

Preorder - G B Q A C K F P D E R H
49

8:5

Inorder - Q B K C F A G P E D H R
30
20

Construct a binary tree from the given traversals

01
02

b) Write a note non-recursive function to delete a node in the BST. [8]

6/2
GP
8/0

OR
CE
82

Q4) a) Explain the difference between array representation and linked

.23

representation of binary tree. Justify your answer using suitable example

16

of each. [9]
8.2

b) What are the advantages and disadvantages of TBT? Write a algorithm

.24

to implement Inorder Traversal of Inorder TBT. [8]

[5869] - 283
49

1
P.T.O.
Q5) a) For the given graph, construct the Adjacency Matrix and Adjacency

8
23
List. Discuss the limitation(s) of Adjacency Matrix. [9]

ic-
tat
3s
0:5
02 91
8:5
0
20
8/0 13
0
6/2
.23 GP

b) What is topological Sorting? Illustrate with an example how topological

sorting is performed. List any two applications where topological sorting
E
82

8
can be used. [9]
C

23
OR

ic-
16

Q6) a) What is the cost of the MST? Construct a minimum spanning tree for

tat
8.2

3s
the given graph using Prim’s Algorithm. List applications where MST is
.24

required. [9]
0:5
91
49

8:5
30
20
01
02
6/2
GP
8/0
CE
82

8
23
b) Illustrate with examples the Reheap up and Reheap down operations
.23

ic-
w.r.t. heaps. List any three applications of Heap. [9]
16

tat
8.2

3s

Q7) a) Explain basic concept of Hash table? Define Hash table? Write
.24

0:5

characteristics of good hash function. [9]

91
49

8:5

b) Write Comparison of different file organizations (sequential, index

30
20

sequential and Direct Access) [8]

01
02

OR
6/2

Q8) a) Explain with example hash functions. [9]

GP
8/0

b) Explain Concept of File? Write all File types and explain file organization.
CE

[8]
82
.23
16


8.2
.24

[5869] - 283
49