C

9C
5
70

0
19

52

A7
Paper / Subject Code: 51422 / Data Structure & Analysis

Y1
CA
5Y

0X

9C
25

0
19
June 6, 2024 02:30 pm - 05:30 pm 1T01233 - S.E.(Information Technology Engineering)

52

A7

A7
Y1
X5
5Y
0X
(SEM-III)(Choice Base Credit Grading System ) (R- 19) (C Scheme) / 51422 - Data Structure &

9C

9C
25
0
52
A7

7
Analysis QP CODE: 10054513

1
5
A
5Y
(3 Hours) [Marks: 80]

Y
0X

X
9C

9C

25
0
52
7

7
Y1

Y1

5
CA

CA
0X

X
N.B.: 1) Question No. 1 is compulsory.

25

25

0
9

19

52
7

7
Y1
X5

X5
2) Answer any three out of remaining questions.

CA

A
5Y

0X
9C
25
70

70
3) Assume suitable data if necessary.

52

A7
1

Y1
X5
CA

CA
5Y

X
4) Figures to the right indicate full marks.

9C
25
70

70
19

9
52

Y1
X5
A

A
5Y

5Y
0X
C

25
0
9

19
52

52
A7

7
1

Y1

X5
CA
Q1. (a) Define directed and undirected graph with example. (5)

5Y

5Y
0X

0X
C

25

70
9

9
(b) Explain first fit, best fit and worst fit method with example. (5)

52

52
A7

7
Y1

1
5
CA

A
Y
0X

0X

0X
(c) Explain threaded binary tree. (5)
9C

9C
25

25
9
A7

A7
Y1

1
(d) Briefly explain memory fragmentation. (5)

X5

X5
CA
5Y

5Y
C

9C
25

70

70
9

9
2

52

7
1

Y1
X5

X5
CA

CA
Y

5Y

0X
9C
25

25
70

70
9

19
52
Q2. (a) Design an algorithm to perform the following operations on stack using link list: (10)

7
1

1
5

5
CA

A
Y

5Y

5Y
X

0X

X
C

9C
i) Push 5
70

70
19

9
2

52

52
7
Y1

Y1
5
CA

ii) Pop

CA

CA
5Y

0X

0X

0X
25

25
iii) Display
19

19
52

A7

A7
Y1
5

X5
CA
5Y

5Y
0X

0X
C

9C
25

70
19

9
52

52
A7

A7

Q2. (b)Explain merge sort by giving its algorithm and sort the following data using merge

Y1
X5

CA
5Y

5Y
0X

0X
9C

sort. (10)

25
70
9

19
52

52
A7

A7
Y1

X5
A

38, 27, 43, 3, 9, 82, 10

Y

5Y
0X

0X
9C

9C
25

70
9
2

52
A7

A7
Y1

Y1
X5

CA
5Y
X

0X
9C

Q3. (a) Evaluate the following expression using stack- (10)

25

25
70

70

19
52

7
Y1

Y1
X5

X5
(2-3+4) * (5+6*7)
CA

CA

5Y
0X
9C
25

25
70

70
19

52
A7
Y1

1
X5

X5
CA

CA
5Y

5Y

Q3.(b) Explain Double Ended Queue and variants of Double Ended Queue. (10)
0X
9C
25
70

70
19

19
52

A7
1
X5

X5
CA

CA
5Y

5Y
0X

9C
25

Q4. (a) Construct a minimum spanning tree for the graph shown in figure 1 using Kruskal’s
70

70
19

9
52

52
7

Y1
5
CA

CA

A
5Y

Y
0X

0X

and Prim’s Algorithm and find out the cost with all intermediate steps. (10)
C
5

25
70
19

9
52

2
7

7
Y1

Y1
5

X5
CA

CA

CA
5Y

0X

0X
25

25

70
19

9
52

A7

A7
Y1

Y1
X5

CA
5Y
0X

0X
9C

C
25

25
70

19

19
52
A7

A7
Y1

X5

X5
CA

5Y

5Y
0X

9C
25

70

70
19

52

52
A7

1
X5

CA

A
5Y

Y
0X

0X
9C

C
5
70

19

19
52

2
A7

A7
Y1

5
CA

5Y

5Y
0X

X
9C

9C
25

70
19

52

52
A7

Y1

Y1
X5

A
5Y

0X

0X
9C

9C
25

25
52

A7

A7
Y1

Y1
X5

X5
0X

9C

9C
25

25
70

70
A7

Y1

1
X5

X5
CA

CA

Figure 1: Graph
Y
9C

25

25
70

70

Q4. (b) Define AVL tree. Step by step construct an AVL tree for the following data: (10)
19

19
Y1

X5

X5
CA

CA
5Y

5Y

30,20,10,25,40,50,55,22,23
70

70
19

19
52

52
CA

CA
5Y

5Y
0X

0X

Q5. (a) Explain different hash functions. Assume a table has 8 slots (m=8). Using Linear
19

19
52

52
A7

A7

probing, insert the following elements into the hash table. 36, 18, 72, 43, 6, 10, 5, and 15 are
5Y

5Y
0X

0X
9C

9C
52

52

inserted in the order. (10)

A7

A7
Y1

Y1
0X

0X
9C
25

25
A7

A7
Y1
X5

X5
9C

9C
25
70

70
Y1

Y1

54513 Page 1 of 2
X5
CA

CA
25

25
70
19

19
X5

X5
CA
5Y

5Y
70
19
52

52
CA

X525Y19CA70X525Y19CA70X525Y19CA70X525Y19CA70
5Y
0X

0X
 X5 A7 Y1 X5 A7
25 0X 9C 25 0X
Y1 52 A7 Y1 52
0X 9C 5Y 0X 9C 5Y
52 A7 19 52 A7 19
5Y 0X CA 5Y 0X CA
19
CA
52
5Y 70 19
CA
52
5Y 70X
19 X5 19 52
5Y 70 CA 25 70 CA 5Y
X5 Y1 X5
19
CA 25 70 9C 25 7 0X 19
CA
Y1 X5 A7 Y1 52
70 70

54513
9C 25 0X 9C 5Y X5
X5 A7 Y1 52 A7 19
25 25

e)
c)
a)
9C

d)
b)
CA Y1 0X 5Y 0X CA Y1
70 52 A7 19 52 70 9C
X5 9C 5Y 0X CA 5Y X5
A7 19 52 70 19 25 A7
25
traversal:

Y1 0X CA 5Y X5 CA Y1 0X

B-tree
9C 52 70 19 25 70 9C 52

Q6. Solve any Four:

0X 5Y X5 CA Y1 X5 A7 5Y
52 A7 19 25 70 9 25 19

Radix Sort
0X

Game Tree
5Y 0X CA Y1 X5 CA Y1 CA
19 52 70 9C 25 70 9C 52 70
CA 5Y X5 A7 Y1 X5 A7 5Y X5
70 19 25 0X 9 25 0X 19 25
X5 CA Y1 CA Y1 Y1 CA
25 70 9C 52 70 9C 52 9C 70
Y1 X5 A X 5Y
5 A 19 X 5
5Y A7
25 70 19 25 70 25
9C
Y X C Y X C Y 0X

Round Robin Scheduling

A7 1 5 2 A7 1 5 2 A7 1 9 52
5 9C 5 C
Graph Traversal Algorithm

0X 9C 0X Y 0X 5Y
A7 Y 1 5 A7 1 5 A7
52
0X 9C 2 5 0X 9 C 2 5 0X 19
5Y
52 A7 Y 1 52 A7 Y 1 52
CA
19
CA 5Y 0X 9 CA 5Y 0X 9CA 5Y 70
X5
70 19 5 25 70 1 9 5 25 70 1 9 25
C A X5 C A X5 CA Y1
Determine the post-order of the tree drawn.

X5 Y1 Y1
25 70 9 C 25 70 9 C 25 70 9C
X5 A Y1 X5 A Y1 X5

Page 2 of 2
Y1 A7
9C 25 70 9 C 25 70 9 C 25 0X
__________________

A7 Y1 X5 A7 Y1 X5 A7 Y1 52
0X 9 CA 2 5Y 0X 9 CA 2 5Y 0X 9CA 5Y
1 1
In-order: D B H E A I F J C G

52 7 52 7 9 52 7 19
Pre-order: A B D E H C F I J G

5Y 0X 9 CA 5Y 0X CA 5Y 0X C
19 52 7 0X 1 9 52 7 0X 1 9 52
CA 5Y CA 5Y CA 5Y
70 19 52 7 0X 19 52 7 0X 19
X5 CA 5Y CA 5Y CA
70 19 52 7 1 9 52 70

X525Y19CA70X525Y19CA70X525Y19CA70X525Y19CA70
25 CA 5Y 0X CA 5Y
Y1
9C
X5
25 70 1 9C 525 70 1 9C
Paper / Subject Code: 51422 / Data Structure & Analysis

A7 Y1 X5 A Y1 X5 A7
0X 9C 25 70 9 C 25 0X
52 A7 Y1 X5 A 70
Y1 52
9C 25 9C 5
Q5.(b) Define Binary Search Tree. Construct the binary search tree from following

5Y 0X
A Y1 X A
19
CA
52
5Y 7 0X 9CA
52
5Y 7 0X5
70 19
CA
52
5Y 70 19
CA 25
X5
(10)

X5 1 Y1
7
(20)

25 70
X 9C 25 0 X 9C
Y1 5 25 A 70
Y1 5 25
9C 9C
A7 Y1 X5 A 7
Y1
0X 9C 25 0 X 9C
52 A7 Y1 5 A7
5Y 0X 9C 25
Y 0
19 52 A7
0X 19C
CA 5Y A7
7 19 52
0
 9E
1A

F1
5

F
DC
Paper / Subject Code: 51422 / Data Structure & Analysis

7E

02
86
92
18

9E
1A

F1
C5

F
1T01233 - S.E.(Information Technology Engineering)(SEM-III)(Choice Base Credit Grading System

69

7E

02
86
92
8D
C3
) (R- 19) (C Scheme) / 51422 - Data Structure & Analysis

9E
1A

F1
C5
1
69
B5
QP CODE: 10030183 DATE: 26/05/2023

7E
6
2
8D

8
9
3
53

F1
C5
C

91

1
B5
2B

86
2
D
6

9
3
(3 Hours) [Marks: 80]

8
53

1A
83

C5
C

91

F
5
B
2F

86
2
8D
6
3B
2

9
3
E0

1A
3

C5
5C

91
5
8
N.B.: 1) Question No. 1 is compulsory.

2B
2F
E9

92
8D
6
3B
2) Answer any three out of remaining questions.

3
E0

83
17

5
5C

91
5

DC
3) Assume suitable data if necessary.

B
2F
6F

36
B
7E

32

8
4) Figures to the right indicate full marks.

E0

3
A8

5C

91
B5
F8
1

DC
F

9
21

6
B
E

02
6

32

C3

18
53
8

7
59

E
A

F8
1

69
B5
B
6F

E9
DC

1
Q1. (a) Explain Linked lists in detail (5)

02

2
2

C3
53
8

3
17
9
18

E
A

8
(b) List down the applications of stack. (5)
5

B5
2B
F
6F

9
DC

21
69

7E

2
(c) Explain winding and unwinding phase of recursion. (5)

53
A8

3
9
C3

C
18

9E

F8
F1
5
(d) Briefly explain memory fragmentation. (5)

B5
2B
DC

1
9
B5

7E

02
86
2
36

53
83
9
18
3

9E
A

F1
5
C
B5

2B
2F
C

21
69
B5

E
86
8D

E0
32

83
7
59
Q2. (a) Design an algorithm to implement circular queue using an array. (10)
C3
53

1
1
F8

2F
F

E9
C

1
69
B5

Q2. (b)Explain quick sort with example by giving its algorithm and comment on its complexity.
2B

6
92
D
02

E0
8

17
C3

18
53

1A
3

(10)

5
9E

F8

6F

E9
DC
69
5
2B

2
B
7E

02

A8

17
59
3

8
3
3

Q3. (a) Write an algorithm to covert infix expression to postfix expression. 91 (10)
9E

5
8
F1

6F
DC

1
5
B
2F

2
6
3B

Q3. (b) Explain various collision resolution techniques in hashing. (10)

7E
86

A8
2

9
3

18
E0

83

5
5C
B5
1A

F1

DC

21
9
2F
E9

6
3B
86

32
92

59
C3

18
E0
7

B5
1A

F8
F1
5

DC
69
B5
E9
DC

Q4. (a) Define Minimum Spanning Tree. Construct a minimum spanning tree shown in figure 1 using
2
86

32
92

C3

18
0

3
7

Kruskal’s and Prim’s Algorithm and find out the cost with all intermediate steps.
18

(10)
E

B5
1A

F8
1
5

69
B5
6F

9
DC
69

02

32
92

C3
53
A8

17
3

18

9E

F8
5
5C

B5
2B
6F
DC

21
69

7E

02
3B

53
8

83
9
3

18

9E
A

F1
5
5C
B5

2B
2F
DC

21
69

7E
6
B

0
8
32

83
9
3

8
53

9E
A

F1
5
5C

91
F8

2F
C

1
2B

7E
86
2
8D
36
B

E0
59
53

1A
83

F1
5C

91

E9
C
2B
2F

86
92
8D
36
B

17
E0

53

1A
83

C5
5C

6F
69
2B
2F
9

92
8D
B
7E

A8
3
E0

53
83

5
5C

91
F1

DC

21
2B
2F
E9

36
3B

59
18
E0

83
17

Figure 1
5C
5

DC
69
2B
2F
F

E9

3B

Q4. (b) Define AVL Tree. Step by step construct a AVL tree for the following data
86

C3

18
E0

83
17

B5
A

23, 12, 25, 01, 45,63, 27, 29 ,90,78,5,6,10 (10)

69
B5
2F
F

E9
21

86

32

C3
E0

53
17
9

F8
C5

B5
B
F

E9
21

02
86

32

Q5. (a) Write down the algorithm for addition of two polynomials. (10)
53
17
9

E
A

F8
C5

2B
F

E9

Q5.(b) Define Binary Search Tree. Give the algorithms for various tree traversals. (10)
21

02
86
D

83
17
9
18

9E
A
C5

2F
F
21
69

7E
86
D

E0
9
C3

18

F1
C5

E9
21
9

86
D
36

17
9
18

A
C5
C

6F

30183 Page 1 of 2
21
9
B5

D
36

A8
9
18
53

C5
C

21
9
B5
2B

D
36

59
18
53
83

5C

DC
9
2B

36
3B

18
83

5C

832B53B5C36918DC5921A86F17E9E02F
B5

69
 83 C3 C5 F1 F8
2B 69 9 21 7E 32
53 18 A 9 E0 B5
B5 D 86 3B
83 C C5 F 2F 5C
2B 36
9 9 21
17
E9
83
2B 3 69
53 18
D A 86 E0 53 18
B5
C C5 F 2F B 5C DC
36 9 17 83 3 5
B5 9 18 21
A
E9 2B 69 92
1A
3B D E0 53 18

e)
c)
a)
86 B

d)
b)
5C F 2F DC 86

30183
C5 5C
36 9 17 83 3 5 F1
918 21
A
E9 2B 69 92
1A
7E
9E
D 86 E0 53 18
5C C5 F 2F B5C DC 86 02

B+-tree
36 9 17 83 36 5 F1 F8
918 21
A
E9 2B 91 92 7E 32
Game Tree
E0 53 8 1A 9E B5
D 86 B 86 3
F 2F DC 02
Selection Sort
C5 5C B5
9 17
9
83 F1
7
F85 3
Q6. Solve any Four:

69 21 36
E9 212B C3
18 E A 5 91 E9 2B 69
Depth First Search

DC 86 02 3B 8D A8 E0 53 18
F1 F8 5C C 6F 2F B5 DC
Threaded Binary Tree

59
21 7E 32 369 5 9 1 7 8 3 C 36 59
9E B5 1 21 E9 2B 9 21
A8
6F 02 3B 8D A 8 E0 53 18 A8
17 F8 5C C 6F 2F B5 DC 6F
E9 32
B 36 59
2
17
E
83
2
C3 5 9 17
E0 53 91 1 A 9 E B 5
69 2 1 E9
2F B5 8D 8 6 0 2 3 B
18 A 8 E0
83 C3 C5 F1 F8 5 DC 6F 2F
2B 69 92 7E 32 C3
69 59 1 7E 83
53 18 1A 9E B5 1 21 9 2B
B5 DC 86 02 3B 8D A 8 E0 53
C3 5 F1 F8 5 C C 5
6F
1
2F B5
69 92 7E 32 3 9 7 8 3 C3
18 1A 9E B5 69 2 1 E 9 2B 69

Page 2 of 2
86 02 3B 18 A8 E0 53 18
DC
F1 F8 5C D C 6F 2F B5
************

59 DC
21 7E 32 3 6 59
21
17 83 C 3 5
9E B5 91 E9 2B 69
A8
6F 0 2F 3 B5 8 DC A 86 E 02 5 3B 1 8D

832B53B5C36918DC5921A86F17E9E02F
17 83 C3 5 F1 F8 5 C C5
E9 2B 6 9 92
1
7E
9
32
B 3 6 92
E0
2F
53
B5
18
DC A 86 E 02 53B
91
8D 1A
83 C3 59 F1 F8 5C C5
2B 69 2 1A
7E
9E
32
B5 3 6 92
53 18 91
Paper / Subject Code: 51422 / Data Structure & Analysis

8 0 3 8 1A
B5 DC 6F 2 F B D 86
C3 5 9 1 7 8 3
5C
3
C5 F1
69 2 1 E 9E 2B 6 91 9 2
18 A8 53 1A
DC 6F 02
F8 B 5C
8D
C5 86
59 17 3 F1
21 E9 2B 36 9 2 7E
A8 E0 53 91 1 A 9E
6F 2F B5 8D
C5 8 6
17 83 C3 F1
9
(20)

E9 2B 6 91 2 1A
7E
9E
E0 53 8
2F B5 DC 86 02
83 C3 5 F1 F
2B 69 92 7E
53 18 1A 9E
B5 DC 86 02
C F F
 3 8 5 7
AE EAB B53 848 830 030B BDDD25 5CAA27 C52
8 8 3 5 C E
EAAB5 5384 4883 3030 0BDDD2 255C CA2 27C 52E 055
3 5 5 0
AB B53 848 8830 030B BDDD25 5CAA27 7C52 2E0 55F FAE
5 84 83 30 D 2 5C 2 C5 E 55 A AB
B5 384 883 03 BD D2 55C A2 7C 2E 055 FA EA 53
3 0 5 5 E B
53 848 8830 030B BDDD25 5CAA27 7C52 2E0 055F FAE AB 538 8488
84 83 30 D 2 5C 2 C5 E 55 A AB 53 48 30
38 88 03 B D 55 A 7C 2E 05 FA EA 5 84 83 30
4 D 2 C 2
84 883 3030 0BD D2 55C A2 7C5 52E 055 5FA EAB B53 3848 8830 030B BDD
88 03 BD D 55 A 7C 2E 05 FA EA 5 84 83 30 D 2
88 303 0BD D 255 CA 27C 52E 05 5FA EA B5 384 883 030 BD D2 55C
3 2 C 2 5 3

8.
7.
6.
5.
4.
3.
2.
1.
83 030 0BD D2 55C A2 7C5 52E 055 FAE EAB B53 848 8830 030B BDDD25 55CAA27

Q1.
03 BD D2 55 A2 7C 2E 05 FA A 5 84 83 30 D 2 5C 2 C5
03 0BD D2 55 CA2 7C 52E 05 5FA EA B5 384 883 030 BD D2 55C A2 7C5 2E

Option C:
Option B:
Option C:
Option B:
Option C:
Option B:
Option C:
Option B:
Option C:
Option B:
Option C:
Option B:
Option C:
Option B:

Option D:
Option D:
Option D:
Option D:
Option D:
Option D:
Option D:

Option A:
Option A:
Option A:
Option A:
Option A:
Option A:
Option A:
Option A:
0B D 55 CA 7C 52 05 5F EA B5 38 88 03 BD D 55 A 7C 2E 05
DD 25 CA 27 52 E0 5F AE B 38 488 303 0B D 255 CA 27C 52 05 5FA
25 5CA 27 C52 E0 55F AE AB 538 488 303 0B DD 255 CA 27C 52 E05 5FA EA

7
3
2
1
5C 2 C5 E 55 A AB 53 48 30 0B DD 25 CA 27 5 E0 5F E B

49
36
14
A2 7C 2E 055 FA EA 53 84 83 30 D 25 5C 2 C5 2E0 55 AE AB 53

Pop
7C 52E 05 FA EA B5 84 883 030 BD D2 5C A2 7C5 2E 55 FA A 53 848

Push

Stack
52 05 5FA EA B5 384 88 03 BD D2 55C A2 7C 2E 05 FA EA B5 84 83

Array

called
Create

Queue
E0 5F E B 38 88 30 0B D 55 A 7C 52 05 5F EA B5 38 88 03
55 AE AB 53 48 30 30B DD 25 CA 27 5 E0 5F AE B 38 488 30 0B

4 or more
FA A 5 84 83 30 D 2 5C 2 C5 2E 55 A A 53 48 30 30 DD
Evaluation

root node
Time: 2 hour 30 minutes

Leaf node
EA B5 384 883 030 BD D2 55C A2 7C 2E 055 FA EA B53 848 83 30 BD 25

Linked−list
Breadth First
B5 384 883 03 BD D2 55C A2 7C 52E 055 FA EA B53 84 83 030 BD D2 5C

Threaded tree
38 88 03 0B D 55 A 7C 52E 05 FA EA B5 84 883 030 BD D2 55C A2
48 30 0B DD 25 CA 27 52 0 5F E B 38 88 03 B D 55 A 7C

Prim’s Algorithm
83 30 D 2 5C 2 C5 E 55 AE AB 53 48 30 0B DD 25 CA 27 52
03 BD D2 55 A2 7C 2E 05 FA A 5 84 83 30 D 2 5C 2 C5 E
0B D 55 CA 7C 52 05 5F EA B5 38 88 03 BD D 55 A 7C 2E 05

Dijkstra’s Algorithm
DD 25 CA 27 52 E0 5F AE B 38 488 303 0B D 255 CA 27C 52 05 5FA
25 5CA 27 C52 E0 55F AE AB 538 488 303 0B DD 255 CA 27C 52 E05 5FA EA
5C 2 C5 E 55 A AB 53 48 30 0B DD 25 CA 27 5 E0 5F E B

Flloyd Warshal Algorithm

A2 7C 2E 055 FA EA 53 84 83 30 D 25 5C 2 C5 2E0 55 AE AB 53

First node of left sub tree

7C 52E 05 FA EA B5 84 883 030 BD D2 5C A2 7C5 2E 55 FA A 53 848

First node of right sub tree

52 05 5FA EA B5 384 88 03 BD D2 55C A2 7C 2E 05 FA EA B5 84 83
E0 5F E B 38 88 30 0B D 55 A 7C 52 05 5F EA B5 38 88 03
55 AE AB 53 48 30 30B DD 25 CA 27 5 E0 5F AE B 38 488 30 0B
FA A 5 84 83 30 D 2 5C 2 C5 2E 55 A A 53 48 30 30 DD
EA B5 384 883 030 BD D2 55C A2 7C 2E 055 FA EA B53 848 83 30 BD 25
B5 384 883 03 BD D2 55C A2 7C 52E 055 FA EA B53 84 83 030 BD D2 5C
38 88 03 0B D 55 A 7C 52E 05 FA EA B5 84 883 030 BD D2 55C A2

Recursion is always better than iteration

48 30 0B DD 25 CA 27 52 0 5F E B 38 88 03 B D 55 A 7C
compulsory and carry equal marks

83 30 D 2 5C 2 C5 E 55 AE AB 53 48 30 0B DD 25 CA 27 52
Which of the following statements is true?
03 BD D2 55 A2 7C 2E 05 FA A 5 84 83 30 D 2 5C 2 C5 E
0B D 55 CA 7C 52 05 5F EA B5 38 88 03 BD D 55 A 7C 2E 05
DD 25 CA 27 52 E0 5F AE B 38 488 303 0B D 255 CA 27C 52 05 5FA
25 5CA 27 C52 E0 55F AE AB 538 488 303 0B DD 255 CA 27C 52 E05 5FA EA
TIME when the algorithm analyzes: (()(())(()))?
Process of inserting an element in stack is called

5C 2 C5 E 55 A AB 53 48 30 0B DD 25 CA 27 5 E0 5F E B

Recursion uses less memory compared to iteration

A2 7C 2E 055 FA EA 53 84 83 30 D 25 5C 2 C5 2E0 55 AE AB 53 Recursion uses more memory compared to iteration

Iteration is always better and simpler than recursion

7C 52E 05 FA EA B5 84 883 030 BD D2 5C A2 7C5 2E 55 FA A 53 848
University of Mumbai
Examinations Summer 2022

52 05 5FA EA B5 384 88 03 BD D2 55C A2 7C 2E 05 FA EA B5 84 83

E0 5F E B 38 88 30 0B D 55 A 7C 52 05 5F EA B5 38 88 03
55 AE AB 53 48 30 30B DD 25 CA 27 5 E0 5F AE B 38 488 30 0B

2E055FAEAB5384883030BDD255CA27C5
FA A 5 84 83 30 D 2 5C 2 C5 2E 55 A A 53 48 30 30 DD
EA B5 384 883 030 BD D2 55C A2 7C 2E 055 FA EA B53 848 83 30 BD 25
B5 384 883 03 BD D2 55C A2 7C 52E 055 FA EA B53 84 83 030 BD D2 5C
38 88 03 0B D 55 A 7C 52E 05 FA EA B5 84 883 030 BD D2 55C A2
48 30 0B DD 25 CA 27 52 0 5F E B 38 88 03 B D 55 A 7C
83 30 D 2 5C 2 C5 E 55 AE AB 53 48 30 0B DD 25 CA 27 52
03 BD D2 55 A2 7C 2E 05 FA A 5 84 83 30 D 2 5C 2 C5 E
0B D 55 CA 7C 52 05 5F EA B5 38 88 03 BD D 55 A 7C 2E 05
DD 25 CA 27 52 E0 5F AE B 38 488 303 0B D 255 CA 27C 52 05 5FA

Which data structure is required to evaluate a postfix expression

25 5CA 27 C52 E0 55F AE AB 538 488 303 0B DD 255 CA 27C 52 E05 5FA EA

________________ can be found used to find a minimum spanning tree.

5C 2 C5 E 55 A AB 53 48 30 0B DD 25 CA 27 5 E0 5F E B
A2 7C 2E 055 FA EA 53 84 83 30 D 25 5C 2 C5 2E0 55 AE AB 53
7C 52E 05 FA EA B5 84 883 030 BD D2 5C A2 7C5 2E 55 FA A 53 84
52 05 5FA EA B5 384 88 03 BD D2 55C A2 7C 2E 05 FA EA B5 84
E0 5F E B 38 88 30 0B D 55 A 7C 52 05 5F EA B5 38 88
The number of elements in the adjacency matrix of a graph having 7 vertices is

55 AE AB 53 48 30 30B DD 25 CA 27 5 E0 5F AE B 38 488 In a max-heap, element with the greatest key is always in the which node?
FA A 5 84 83 30 D 2 5C 2 C5 2E 55 A A 53 48 3
EA B5 384 883 030 BD D2 55C A2 7C 2E 055 FA EA B53 848 83
B5 384 883 03 BD D2 55C A2 7C 52E 055 FA EA B53 84 83 03
38 88 03 0B D 55 A 7C 52E 05 FA EA B5 84 883 030
48 30 0B DD 25 CA 27 52 0 5F E B 38 88 03
83 30 D 2 5C 2 C5 E 55 AE AB 53 48 30 0B
balanced. The maximum number of parentheses that appear on the stack AT ANY ONE

number of nodes and all the nodes at the last level appear as far left as possible, is
Consider the usual algorithm for determining whether a sequence of parentheses is
Choose the correct option for following questions. All the Questions are

A binary tree in which if all its levels except possibly the last, have the maximum
03 BD D2 55 A2 7C 2E 05 FA A 5 84 83 30
Max. Marks: 80
=====================================================================

0B D 55 CA 7C 52 05 5F EA B5 38 88 03 BD

1 | Page
DD 25 CA 27 52 E0 5F AE B 38 488 303 0B
25 5CA 27 C52 E0 55F AE AB 538 488 303 0B DD
5C 2 C5 E 55 A AB 53 48 30 0B DD
A2 7C 2E 055 FA EA 53 84 83 30 D 25
7C 52E 05 FA EA B5 84 883 030 BD D2
52 05 5FA EA B5 384 88 03 BD D2 55
E0 5F E B 38 88 30 0B D 55
55 AE AB 53 48 30 30B DD 25 C
F 8 5
 3 8 5 7
AE EAB B53 848 830 030B BDDD25 5CAA27 C52
8 8 3 5 C E
EAAB5 5384 4883 3030 0BDDD2 255C CA2 27C 52E 055
3 5 5 0
AB B53 848 8830 030B BDDD25 5CAA27 7C52 2E0 55F FAE
5 84 83 30 D 2 5C 2 C5 E 55 A AB
B5 384 883 03 BD D2 55C A2 7C 2E 055 FA EA 53
3 0 5 5 E B
53 848 8830 030B BDDD25 5CAA27 7C52 2E0 055F FAE AB 538 8488
84 83 30 D 2 5C 2 C5 E 55 A AB 53 48 30
38 88 03 B D 55 A 7C 2E 05 FA EA 5 84 83 30
4 D 2 C 2
84 883 3030 0BD D2 55C A2 7C5 52E 055 5FA EAB B53 3848 8830 030B BDD
88 03 BD D 55 A 7C 2E 05 FA EA 5 84 83 30 D 2
88 303 0BD D 255 CA 27C 52E 05 5FA EA B5 384 883 030 BD D2 55C
3 2 C 2 5 3
83 030 0BD D2 55C A2 7C5 52E 055 FAE EAB B53 848 8830 030B BDDD25 55CAA27 9.

10.
03 BD D2 55 A2 7C 2E 05 FA A 5 84 83 30 D 2 5C 2 C5

C
B
A

C
B
C
B

A
A

Q4.
Q3.
Q2.
03 0BD D2 55 CA2 7C 52E 05 5FA EA B5 384 883 030 BD D2 55C A2 7C5 2E

Option C:
Option B:
Option C:
Option B:
Option C:
Option B:

Option D:
Option D:
Option D:

Option A:
Option A:
0B D 55 CA 7C 52 05 5F EA B5 38 88 03 BD D 55 A 7C 2E 05
DD 25 CA 27 52 E0 5F AE B 38 488 303 0B D 255 CA 27C 52 05 5FA
25 5CA 27 C52 E0 55F AE AB 538 488 303 0B DD 255 CA 27C 52 E05 5FA EA

(20 Marks)
(20 Marks)
(20 Marks)
5C 2 C5 E 55 A AB 53 48 30 0B DD 25 CA 27 5 E0 5F E B
A2 7C 2E 055 FA EA 53 84 83 30 D 25 5C 2 C5 2E0 55 AE AB 53
7C 52E 05 FA EA B5 84 883 030 BD D2 5C A2 7C5 2E 55 FA A 53 848
52 05 5FA EA B5 384 88 03 BD D2 55C A2 7C 2E 05 FA EA B5 84 83
Depth

Width
Height

E0 5F E B 38 88 30 0B D 55 A 7C 52 05 5F EA B5 38 88 03
Length

55 AE AB 53 48 30 30B DD 25 CA 27 5 E0 5F AE B 38 488 30 0B
FA A 5 84 83 30 D 2 5C 2 C5 2E 55 A A 53 48 30 30 DD

Clustering
Rehashing
EA B5 384 883 030 BD D2 55C A2 7C 2E 055 FA EA B53 848 83 30 BD 25
B5 384 883 03 BD D2 55C A2 7C 52E 055 FA EA B53 84 83 030 BD D2 5C
38 88 03 0B D 55 A 7C 52E 05 FA EA B5 84 883 030 BD D2 55C A2

Linear Probing
48 30 0B DD 25 CA 27 52 0 5F E B 38 88 03 B D 55 A 7C
Full binary tree

83 30 D 2 5C 2 C5 E 55 AE AB 53 48 30 0B DD 25 CA 27 52
03 BD D2 55 A2 7C 2E 05 FA A 5 84 83 30 D 2 5C 2 C5 E

Quadratic Probing
0B D 55 CA 7C 52 05 5F EA B5 38 88 03 BD D 55 A 7C 2E 05
Binary Search Tree

DD 25 CA 27 52 E0 5F AE B 38 488 303 0B D 255 CA 27C 52 05 5FA

Complete binary tree

25 5CA 27 C52 E0 55F AE AB 538 488 303 0B DD 255 CA 27C 52 E05 5FA EA
5C 2 C5 E 55 A AB 53 48 30 0B DD 25 CA 27 5 E0 5F E B
A2 7C 2E 055 FA EA 53 84 83 30 D 25 5C 2 C5 2E0 55 AE AB 53
7C 52E 05 FA EA B5 84 883 030 BD D2 5C A2 7C5 2E 55 FA A 53 848
52 05 5FA EA B5 384 88 03 BD D2 55C A2 7C 2E 05 FA EA B5 84 83
E0 5F E B 38 88 30 0B D 55 A 7C 52 05 5F EA B5 38 88 03
55 AE AB 53 48 30 30B DD 25 CA 27 5 E0 5F AE B 38 488 30 0B

probing{18,89,21,58,68,11}
FA A 5 84 83 30 D 2 5C 2 C5 2E 55 A A 53 48 30 30 DD

60,70,75,51,52,65,68,77,78,79
EA B5 384 883 030 BD D2 55C A2 7C 2E 055 FA EA B53 848 83 30 BD 25
B5 384 883 03 BD D2 55C A2 7C 52E 055 FA EA B53 84 83 030 BD D2 5C
38 88 03 0B D 55 A 7C 52E 05 FA EA B5 84 883 030 BD D2 55C A2
48 30 0B DD 25 CA 27 52 0 5F E B 38 88 03 B D 55 A 7C
83 30 D 2 5C 2 C5 E 55 AE AB 53 48 30 0B DD 25 CA 27 52
03 BD D2 55 A2 7C 2E 05 FA A 5 84 83 30 D 2 5C 2 C5 E
0B D 55 CA 7C 52 05 5F EA B5 38 88 03 BD D 55 A 7C 2E 05
DD 25 CA 27 52 E0 5F AE B 38 488 303 0B D 255 CA 27C 52 05 5FA
25 5CA 27 C52 E0 55F AE AB 538 488 303 0B DD 255 CA 27C 52 E05 5FA EA

Solve any Two Questions out of Three

Solve any Two Questions out of Three
Solve any Two Questions out of Three

5C 2 C5 E 55 A AB 53 48 30 0B DD 25 CA 27 5 E0 5F E B
A2 7C 2E 055 FA EA 53 84 83 30 D 25 5C 2 C5 2E0 55 AE AB 53
7C 52E 05 FA EA B5 84 883 030 BD D2 5C A2 7C5 2E 55 FA A 53 848
52 05 5FA EA B5 384 88 03 BD D2 55C A2 7C 2E 05 FA EA B5 84 83

Create a B-tree of order 4 with the following keys:

Figure 1. Graph
E0 5F E B 38 88 30 0B D 55 A 7C 52 05 5F EA B5 38 88 03
Write an algorithm to implement circular linked list.

Explain Heap sort with the help of an example.

55 AE AB 53 48 30 30B DD 25 CA 27 5 E0 5F AE B 38 488 30 0B

2E055FAEAB5384883030BDD255CA27C5
FA A 5 84 83 30 D 2 5C 2 C5 2E 55 A A 53 48 30 30 DD
Explain BFS algorithm using an example of your own.

EA B5 384 883 030 BD D2 55C A2 7C 2E 055 FA EA B53 848 83 30 BD 25

Write an algorithm to convert infix to postfix expression.

B5 384 883 03 BD D2 55C A2 7C 52E 055 FA EA B53 84 83 030 BD D2 5C

Kruskal’s algorithm by showing all the intermediate steps.

of keys in the hash table with a size of 10 using linear

38 88 03 0B D 55 A 7C 52E 05 FA EA B5 84 883 030 BD D2 55C A2
48 30 0B DD 25 CA 27 52 0 5F E B 38 88 03 B D 55 A 7C
83 30 D 2 5C 2 C5 E 55 AE AB 53 48 30 0B DD 25 CA 27 52
03 BD D2 55 A2 7C 2E 05 FA A 5 84 83 30 D 2 5C 2 C5 E
0B D 55 CA 7C 52 05 5F EA B5 38 88 03 BD D 55 A 7C 2E 05
Which of the following is not a collision resolution technique?

DD 25 CA 27 52 E0 5F AE B 38 488 303 0B D 255 CA 27C 52 05 5FA

25 5CA 27 C52 E0 55F AE AB 538 488 303 0B DD 255 CA 27C 52 E05 5FA EA
5C 2 C5 E 55 A AB 53 48 30 0B DD 25 CA 27 5 E0 5F E B
A2 7C 2E 055 FA EA 53 84 83 30 D 25 5C 2 C5 2E0 55 AE AB 53
7C 52E 05 FA EA B5 84 883 030 BD D2 5C A2 7C5 2E 55 FA A 53 84
52 05 5FA EA B5 384 88 03 BD D2 55C A2 7C 2E 05 FA EA B5 84
Explain Doubly ended queue.Explain the variants of Doubly ended queue.

E0 5F E B 38 88 30 0B D 55 A 7C 52 05 5F EA B5 38 88
55 AE AB 53 48 30 30B DD 25 CA 27 5 E0 5F AE B 38 488

10 marks each
10 marks each
10 marks each

FA A 5 84 83 30 D 2 5C 2 C5 2E 55 A A 53 48 3
EA B5 384 883 030 BD D2 55C A2 7C 2E 055 FA EA B53 848 83

16,70,10,30,75,5,12,9 and traverse the tree in in-order, pre-order and post-order.

B5 384 883 03 BD D2 55C A2 7C 52E 055 FA EA B53 84 83 03
38 88 03 0B D 55 A 7C 52E 05 FA EA B5 84 883 030
The number of edges from the root to the node is called __________ of the tree.

48 30 0B DD 25 CA 27 52 0 5F E B 38 88 03
83 30 D 2 5C 2 C5 E 55 AE AB 53 48 30 0B

Explain different collision resolution techniques. Insert the following sequence

What are different tree traversal methods? Create a binary search tree for
Find the Minimum spanning tree for the graph shown if figure1 using Prim’s and

03 BD D2 55 A2 7C 2E 05 FA A 5 84 83 30
0B D 55 CA 7C 52 05 5F EA B5 38 88 03 BD

2 | Page
DD 25 CA 27 52 E0 5F AE B 38 488 303 0B
25 5CA 27 C52 E0 55F AE AB 538 488 303 0B DD
5C 2 C5 E 55 A AB 53 48 30 0B DD
A2 7C 2E 055 FA EA 53 84 83 30 D 25
7C 52E 05 FA EA B5 84 883 030 BD D2
52 05 5FA EA B5 384 88 03 BD D2 55
E0 5F E B 38 88 30 0B D 55
55 AE AB 53 48 30 30B DD 25 C
F 8 5
 19
75
A
67
40
Paper / Subject Code: 51422 / Data Structure & Analysis

03

77
AB
BC
B4

7E

51

19
3E

3A
40

B7
1T01233 - S.E.(Information Technology Engineering)(SEM-III)(Choice Base Credit Grading System ) (R-

C6

77
69

B4

E0

AA
0B

51
19) (C Scheme) / 51422 - Data Structure & Analysis

23

3E

7
C6
4
1F

AB
69

B4
QP CODE: 10038221 DATE: 23/11/2023

E0
B
97

23

3A
67
0
90

4
1F

69

BC
4

E0
71

EB

A
97

23

A
67
0
17

44
(3 Hours) [Marks: 80]

03
9

69

BC
75

71
1

E
7

3
AB

3E
9

7
0
17

F2
0

C6
44
N.B.: 1) Question No. 1 is compulsory.

69
75
3A

71
1

0B
7

3
2) Answer any three out of remaining questions.

AB

E
9
E0

17

2
90

93

44
1F
3) Assume suitable data if necessary.

C
75
A
67

36

EB

B
97
3

7
B
BC
4) Figures to the right indicate full marks.

40
E0

F2
90
A

93
51

4
A
7
40

71
1

B
B7
6

77

23
BC
B4

3E
09
E0

51

1F
19

69
3E

3A
67
0
Q1. (a) Explain data structures and Abstract Data Type. (5)

B7
4

97
7

23
69

C
B4

3E
E0

17
(b) What is expression tree? Give examples. (5)

90
A
B

1F
23

69
3E

5
A
7
0

71
(c) What is a Linked List? State the different types of Linked List. (5)

B7
6
44

97
1F

23
9

E0

7
6

90
(d) What are the different ways to represent Graph. (5)

AA
B
97

51

1F
23

7
0

71
90

7
93

6
44

97
1F

03

AB
C

17
71

36

EB

90
0B

E
97

5
3A
67
17

F2

71
90

B7
3

44
Q2. (a) Write an algorithm to implement queue using an array. (10)
9

C
75

E0
71

17
71

EB

AA
B
23
AB

09

75
67
0
17

44
1F

03
Q2. (b)Explain insertion sort with example by giving its algorithm and comment on its complexity.
9

AB
9

BC
75
3A

71

7E
97

23

(10)
AB

3E

3A
40
E0

17

C6
F
9

69

B4
5
3A
67

E0
71
1
B7

0B
77

23
BC

E
09

Q3. (a) Write an algorithm to implement stack using array. (10)

67
E0

AA

4
51

F
9

BC
B4
67
40

1
71

6
B7

7
03

23
BC
B4

3E
9

40
7

Q3. (b) What is Doubly Linked List? Write an algorithm to implement following operations on Doubly
90
A
7E

1F

69

B4
3E

75
3A
40

Linked List.
71
C6

23
B
69

B4

3E
9
E0

a) Insertion (all cases)

90
AA
0B

51

1F
23

69
3E

67

71

b) Traversal (Forward and Backward) (10)

7
44

97
1F

03

23
AB
69

BC

7
EB

0
7E
97

1F
23

19
5
3A
40
90

7
93

C6

Q4. (a) Define Minimum Spanning Tree. Construct a minimum spanning tree shown in figure 1 using
97
1F

77
AB
B4

0
36

Kruskal’s and Prim’s Algorithm and find out the cost with all intermediate steps.
90
0B

7E
97

(10)
3E

5
A
F2

71
90

B7
6
4

03
69

BC
B4
71

17
71

AA
7E
23

3E
09

75
40
17

C6
1F

03
19

AB
69

B4
75

0B

7E
97
77

23
AB

3E

3A
90

C6
44
51

1F

69

E0
71

EB
B7

B
97

23

67
40
17

90
AA

93
1F

BC
B4
5

71

36
B7

97
3

3E

40
E0

17

F2
90
AA

69

B4
5
67

1
71
B7

97
3

3E
E0

17

F2
0
AA

19

69
5
67

71
B7
3

77

23
BC

09
E0

AA

51

1F
19
67
40

Figure 1
B7

97
3

77
BC
4

E0
EB

90
AA

5 1
67
40

71
B7
03
BC
4

17
EB

AA
7E

75
40
93

03

AB
BC
4

38221 Page 1 of 2
36

EB

7E

3A
40
F2

93

6
BC
4

E0
71

36

EB

67
40
F2

93

BC

971F23693EB440BC67E03AAB75177190
B4
71

36
 71 EB 67 AB 90
F2 4 40 E0 75 97
36
93 BC 3 AA 17
71
1F
71 EB 23
67 B7 90 69
F2 440 E0 51 97 3E
36
93 BC 3 AA 77 1F B4
EB 19 23 40
67 B7 09 69
4 40 E0 5 71 3E BC
36
93 BC 3 AA 17
71 F2 B4 67
E0
EB 67 B7 90 36 40 3A
4 E0 5 97 93 BC

38221
each step.
40 3 17 1F EB 67 AB
BC AA 71 23 44 E0 75
B4 6 7E B7 90 69 0B 3A 17
40 03 5 97 3E C6 AB 71
17 1F B4 7E 90
BC AA 71 23 75 97
6 90 69 40 03 17 1F

c) Selection Sort
B7

e) Binary Search
7E 97 3E BC 23 AA 71
51

b) Expression Tree
03 77 1F B4 67 69 B7 90
BC AA 19 23 E0 4 5 17
97
1F
3E
67 0 0B

a) Breadth First Search

B7 69 3A B4
E0 5 1
97
1
3E C6 A 71
9
23
6 40
3A 77 F2 B4 7E B7
51
09 9 3E BC
AB 19 36 40 03 71 67
09 93 BC AA 77 F2 B4
75 1 4 E0

Q6. Write Short note on any four:

40,30,20,25,21,50,60,70,65,22,18,15

17 71
F2
EB 6 7E B 9 0
36
93 0 BC 3A
71 3 44 0 75 97 E
1 7 B 6 7
AB

d) Double Ended Queue (De-Queue)

90 69 0B 3A 1F 75
97 3E 71 23 44 E0
1F C6 AB 9 6 9 0 B 3 A 17
23 B4
40
7E
03 7 51
09
71 3 EB C AB 71
69 B A 7 F 67 90
3E C6 71 23 44 E0 75 97
AB
7
90 6 9 0 B 3 A 17
7
1F
B4 7E
5 9 7 3 C A 1 23
40 03 1 7 1 F
EB 6 7 B 90 69

Page 2 of 2
BC AA 71 23 44 E0 75 97 3E
67 90 69 0B 3A 17 1F
B7
5 9 C A 71
B4

************
E0
1 7 3E
B 6 9
23 40
3A 77 1F
23 44 7 E0
B7 09
69
3E
AB 19 6 0 3 51 71
0 9 B A 7 7 F B4

971F23693EB440BC67E03AAB75177190
75
17
97 3 E C 67 A 1 90
23 40
1F B7 69
71 23 B4
40 E 03 51 971 3 E
BC
90 69 BC AA 77 F2 B4 67
97
1F
3E 67 B7 1 90 3 69 4 0B
B4 3
23 4 E0 5 97 C6
Paper / Subject Code: 51422 / Data Structure & Analysis

69 0B 3A 17 1F EB
11. Using linear probing, insert keys 54, 26, 93, 17, 77, 60 and 31 into the table.

3E C6 7 19 23 4 4
7E
B4 7E
AB
7 09 69 0 B
03
A
40 03 51 71 3E C6
7 F2 B 7
Q5. (b) Write the algorithm for deletion of a node (all cases) in a Binary Search Tree.

BC AA 71 44 E0
67 B7 90 36
93 0 BC 3A
E0 5 97 E AB
3A 17
71
1F
23 B 44
67
E0 75
AB
75
90 6 93 0BC 3AA
97 EB
17 1F 67 B7
71 23 44 E0 51
90 69 0B 3A
(10)

77
(10)

(20)
(10)

97 3E
Q4. (b) Define AVL tree. Construct an AVL tree from the following data and mention the rotations in

Q5. (a) What is collision? List down the methods to resolve the collision. Consider a hash table of size

C6 AB 19
1F
23 B 4 7 E 7
40 03 51
69
3E B C A A
77
19
 61 D D 53 83 6 A 2 B4 AD
7 6 D 9
17 7D7 D6 534 4836 66D A5 529 B4A AD 05A
D D 5 8 6 A 2 B 0
7D 7D 65 348 366 DA 52 9B 4A D0 5A2 257
7D 65 348 36 DA 52 9B 4A D0 5A 57 58D
7D 65 348 36 6DA 52 9B 4A D0 5A 257 58D 61
3 6 5 2
D6 653 483 366 DA 529 9B4 4AD D05 A2 575 58D 617 7D7
4 6 D 5 B A A 5 8 6 D D
65 5348 836 6D A52 29B 4A D0 05A 257 758 D61 17D 7D 65
76927
34 36 6D A5 9B 4A D0 5A 25 58 D6 7D 7D 65 34
34 836 6D A5 29B 4A D0 5A 25 758 D6 17D 7D 65 34 836
7 8

4.
3.
2.
1.
48 8366 6DA A52 29B 4A D05 5A2 257 58D D61 17D 7D 653 348 366 6DA
36 D 5 9B 4A D0 A 57 58 6 7D 7D 65 48 36 DA 52
20-Nov-2019

36 6D A5 29B 4A D0 5A 257 58 D6 17D 7D 65 348 36 6DA 52 9B

A 2 D 1 3 6

76927
66 6DA 52 9B4 4AD D05 5A2 2575 58D 61 7D7 7D6 653 483 366 DA 529 9B4 4AD
DA 52 9B A 0 A2 57 8D 61 7D D 53 48 66 DA 52 B AD 05

(f)

(a)
(a)
(a)
(e)
(c)
(a)

(b)
(b)
(b)
(g)
(d)
(b)
DA 52 9B 4A D0 5A2 57 58D 61 7D 7D 653 48 366 DA 52 9B 4AD 05 A2
52 9B 4AD D05 5A2 57 58D 61 7D 7D 653 483 366 DA 52 9B4 4AD 05 A2 575
9B 4A 0 A 57 58 61 7D 7D 65 48 66 DA 52 9B A 0 A2 57 8D
4A D0 5A 257 58 D6 7D 7D 65 348 36 D 52 9B 4A D0 5A 57 58D 61
D0 5A 25 58 D6 17D 7D 65 348 36 6D A5 9B 4A D0 5A 257 58 61 7D
5A 25 758 D6 17D 7D 65 34 36 6D A5 29B 4A D0 5A 257 58 D6 7D 7D
25 758 D6 17 7D 65 34 836 6D A5 29B 4A D0 5A 25 58 D6 17D 7D 65
75 D 17 D7 6 34 83 6D A5 29 4 D 5A 25 75 D6 17 7 65 34
8D 61 D D6 53 83 66 A 29 B4 AD 05 2 75 8D 17 D7 D6 34 83

elements:
61 7D 7D 53 483 66 DA 52 B4 AD 05 A2 575 8D 61 D7 D6 53 83 66D
7D 7D 65 48 66 DA 52 9B A 0 A2 57 8D 61 7D D 53 48 66 A

given below
(3)Traversal
7D 65 348 36 DA 52 9B 4A D0 5A 57 58D 61 7D 7D 653 48 366 DA 52
65 348 36 6D 52 9B 4A D0 5A 257 58 61 7D 7D 65 48 366 DA 52 9B
34 36 6D A5 9B 4A D0 5A 25 58 D6 7D 7D 65 34 36 D 5 9B 4A
83 6D A 29 4 D 5A 25 75 D 17 7 6 34 83 6D A5 29 4A D
66 A 52 B4 AD 05 2 75 8D 61 D7 D6 53 83 66 A 29 B4 D 05
DA 52 9B A 0 A2 57 8D 61 7D D 53 48 66 DA 52 B AD 05 A2

Inorder: DBEAFCG
52 9B 4AD D05 5A2 57 58D 61 7D 7D 653 483 366 DA 52 9B4 4AD 05 A2 575

Preorder: ABDECFG
(2)Deletion(All cases)
(1)Insertion(All cases)
9B 4A 0 A 57 58 61 7D 7D 65 48 66 DA 52 9B A 0 A2 57 8D
4A D0 5A 257 58 D6 7D 7D 65 348 36 D 52 9B 4A D0 5A 57 58D 61
N.B.: (1) Question No.1 is compulsory.

D0 5A 25 58 D6 17D 7D 65 348 36 6D A5 9B 4A D0 5A 257 58 61 7D

Write a note on recursion.

A+(B*(C-D)/E)
5A 25 758 D6 17D 7D 65 34 36 6D A5 29B 4A D0 5A 257 58 D6 7D 7D
Explain Doubly Linked List.
25 758 D6 17 7D 65 34 836 6D A5 29B 4A D0 5A 25 58 D6 17D 7D 65
(3) Assume Suitable data if necessary.
(3 Hours)

75 D 17 D7 6 34 83 6D A5 29 4 D 5A 25 75 D6 17 7 65 34
8D 61 D D6 53 83 66 A 29 B4 AD 05 2 75 8D 17 D7 D6 34 83
61 7D 7D 53 483 66 DA 52 B4 AD 05 A2 575 8D 61 D7 D6 53 83 66D
7D 7D 65 48 66 DA 52 9B A 0 A2 57 8D 61 7D D 53 48 66 A
(4) Figures to the right indicate full marks.

7D 65 348 36 DA 52 9B 4A D0 5A 57 58D 61 7D 7D 653 48 366 DA 52

65 348 36 6D 52 9B 4A D0 5A 257 58 61 7D 7D 65 48 366 DA 52 9B
34 36 6D A5 9B 4A D0 5A 25 58 D6 7D 7D 65 34 36 D 5 9B 4A
83 6D A 29 4 D 5A 25 75 D 17 7 6 34 83 6D A5 29 4A D

Page 1 of 2
66 A 52 B4 AD 05 2 75 8D 61 D7 D6 53 83 66 A 29 B4 D 05
(2) Attempt any three out of remaining questions.

DA 52 9B A 0 A2 57 8D 61 7D D 53 48 66 DA 52 B AD 05 A2

following operations on Singly linked List.

52 9B 4AD D05 5A2 57 58D 61 7D 7D 653 483 366 DA 52 9B4 4AD 05 A2 575
9B 4A 0 A 57 58 61 7D 7D 65 48 66 DA 52 9B A 0 A2 57 8D Explain linear and nonlinear data structures.
4A D0 5A 257 58 D6 7D 7D 65 348 36 D 52 9B 4A D0 5A 57 58D 61
D0 5A 25 58 D6 17D 7D 65 348 36 6D A5 9B 4A D0 5A 257 58 61 7D
5A 25 758 D6 17D 7D 65 34 36 6D A5 29B 4A D0 5A 257 58 D6 7D 7D
Explain different types of queues in data structures.

25 758 D6 17 7D 65 34 836 6D A5 29B 4A D0 5A 25 58 D6 17D 7D 65

A25758D617D7D65348366DA529B4AD05
Write postfix form of the following infix expression.

75 D 17 D7 6 34 83 6D A5 29 4 D 5A 25 75 D6 17 7 65 34
How does binary search different from linear search?

Define graph and list any three applications of graph.

8D 61 D D6 53 83 66 A 29 B4 AD 05 2 75 8D 17 D7 D6 34 83

Write an algorithm for implementing stack using array.

61 7D 7D 53 483 66 DA 52 B4 AD 05 A2 575 8D 61 D7 D6 53 83 66D

Write a function to traverse a tree in Postorder sequence.

7D 7D 65 48 66 DA 52 9B A 0 A2 57 8D 61 7D D 53 48 66 A

45, 39, 56, 12, 34, 78, 32, 10, 89, 54, 67, 81
7D 65 348 36 DA 52 9B 4A D0 5A 57 58D 61 7D 7D 653 48 366 DA 52
65 348 36 6D 52 9B 4A D0 5A 257 58 61 7D 7D 65 48 366 DA 52 9B
34 36 6D A5 9B 4A D0 5A 25 58 D6 7D 7D 65 34 36 D 5 9B 4A

What is Singly Linked List? Write an algorithm to implement

83 6D A 29 4 D 5A 25 75 D 17 7 6 34 83 6D A5 29 4A D
66 A 52 B4 AD 05 2 75 8D 61 D7 D6 53 83 66 A 29 B4 D 05
DA 52 9B A 0 A2 57 8D 61 7D D 53 48 66 DA 52 B AD 05 A2
Paper / Subject Code: 51403 / Data Structures and Analysis

Write an algorithm for quick sort and comment on its complexity.

Write an algorithm for merge sort and comment on its complexity.
52 9B 4AD D05 5A2 57 58D 61 7D 7D 653 483 366 DA 52 9B4 4AD 05 A2 575
9B 4A 0 A 57 58 61 7D 7D 65 48 66 DA 52 9B A 0 A2 57 8D

Construct the binary tree for Inorder and Preorder traversal sequence
4A D0 5A 257 58 D6 7D 7D 65 348 36 D 52 9B 4A D0 5A 57 58D 61
Explain Binary search tree. Construct Binary search tree for following

D0 5A 25 58 D6 17D 7D 65 348 36 6D A5 9B 4A D0 5A 257 58 61 7D

5A 25 758 D6 17D 7D 65 34 36 6D A5 29B 4A D0 5A 257 58 D6 7D 7
25 758 D6 17 7D 65 34 836 6D A5 29B 4A D0 5A 25 58 D6 17D 7D
75 D 17 D7 6 34 83 6D A5 29 4 D 5A 25 75 D6 17 7
8D 61 D D6 53 83 66 A 29 B4 AD 05 2 75 8D 17 D7 D6
61 7D 7D 53 483 66 DA 52 B4 AD 05 A2 575 8D 61 D7 D6
[Total Marks: 80]

7D 7D 65 48 66 DA 52 9B A 0 A2 57 8D 61 7D D 53

10
10
10
10
10
10
3
2
3
3
3
3
3

7D 65 348 36 DA 52 9B 4A D0 5A 57 58D 61 7D 7D 653

65 348 36 6D 52 9B 4A D0 5A 257 58 61 7D 7D 65 48
34 36 6D A5 9B 4A D0 5A 25 58 D6 7D 7D 65 34
83 6D A 29 4 D 5A 25 75 D 17 7 6 34 83
66 A 52 B4 AD 05 2 75 8D 61 D7 D6 53 83
DA 52 9B A 0 A2 57 8D 61 7D D 53 48 66
52 9B 4AD D05 5A2 57 58D 61 7D 7D 653 483 366
1T01223 - S.E.(Information Technology Engineering)(Choice Base) / 51403 - Data Structures and Analysis

9B 4A 0 A 57 58 61 7D 7D 65 48 66 D
4A D0 5A 257 58 D6 7D 7D 65 348 36 D
D0 5A 25 58 D6 17D 7D 65 348 36 6D A
5A 25 758 D6 17D 7D 65 34 36 6D A5
25 758 D6 17 7D 65 34 836 6D A5
7 1 D 8 6 A 2
 61 D D 53 83 6 A 2 B4 AD
7 6 D 9
17 7D7 D6 534 4836 66D A5 529 B4A AD 05A
D D 5 8 6 A 2 B 0
7D 7D 65 348 366 DA 52 9B 4A D0 5A2 257
7D 65 348 36 DA 52 9B 4A D0 5A 57 58D
7D 65 348 36 6DA 52 9B 4A D0 5A 257 58D 61
3 6 5 2
D6 653 483 366 DA 529 9B4 4AD D05 A2 575 58D 617 7D7
4 6 D 5 B A A 5 8 6 D D
65 5348 836 6D A52 29B 4A D0 05A 257 758 D61 17D 7D 65
34 36 6D A5 9B 4A D0 5A 25 58 D6 7D 7D 65 34
34 836 6D A5 29B 4A D0 5A 25 758 D6 17D 7D 65 34 836
7 8

6.
5.
48 8366 6DA A52 29B 4A D05 5A2 257 58D D61 17D 7D 653 348 366 6DA
36 D 5 9B 4A D0 A 57 58 6 7D 7D 65 48 36 DA 52
36 6D A5 29B 4A D0 5A 257 58 D6 17D 7D 65 348 36 6DA 52 9B
A 2 D 1 3 6

76927
66 6DA 52 9B4 4AD D05 5A2 2575 58D 61 7D7 7D6 653 483 366 DA 529 9B4 4AD
DA 52 9B A 0 A2 57 8D 61 7D D 53 48 66 DA 52 B AD 05
(a)

(b)
DA 52 9B 4A D0 5A2 57 58D 61 7D 7D 653 48 366 DA 52 9B 4AD 05 A2
52 9B 4AD D05 5A2 57 58D 61 7D 7D 653 483 366 DA 52 9B4 4AD 05 A2 575
9B 4A 0 A 57 58 61 7D 7D 65 48 66 DA 52 9B A 0 A2 57 8D
4A D0 5A 257 58 D6 7D 7D 65 348 36 D 52 9B 4A D0 5A 57 58D 61
D0 5A 25 58 D6 17D 7D 65 348 36 6D A5 9B 4A D0 5A 257 58 61 7D
5A 25 758 D6 17D 7D 65 34 36 6D A5 29B 4A D0 5A 257 58 D6 7D 7D
25 758 D6 17 7D 65 34 836 6D A5 29B 4A D0 5A 25 58 D6 17D 7D 65
75 D 17 D7 6 34 83 6D A5 29 4 D 5A 25 75 D6 17 7 65 34
8D 61 D D6 53 83 66 A 29 B4 AD 05 2 75 8D 17 D7 D6 34 83
61 7D 7D 53 483 66 DA 52 B4 AD 05 A2 575 8D 61 D7 D6 53 83 66D
7D 7D 65 48 66 DA 52 9B A 0 A2 57 8D 61 7D D 53 48 66 A
7D 65 348 36 DA 52 9B 4A D0 5A 57 58D 61 7D 7D 653 48 366 DA 52

c) Insertion Sort
d) DFS and BFS
65 348 36 6D 52 9B 4A D0 5A 257 58 61 7D 7D 65 48 366 DA 52 9B
34 36 6D A5 9B 4A D0 5A 25 58 D6 7D 7D 65 34 36 D 5 9B 4A

e) Expression Tree.
83 6D A 29 4 D 5A 25 75 D 17 7 6 34 83 6D A5 29 4A D
66 A 52 B4 AD 05 2 75 8D 61 D7 D6 53 83 66 A 29 B4 D 05
DA 52 9B A 0 A2 57 8D 61 7D D 53 48 66 DA 52 B AD 05 A2

a) Asymptotic notations
52 9B 4AD D05 5A2 57 58D 61 7D 7D 653 483 366 DA 52 9B4 4AD 05 A2 575

Write short notes on (Any 4)

9B 4A 0 A 57 58 61 7D 7D 65 48 66 DA 52 9B A 0 A2 57 8D
4A D0 5A 257 58 D6 7D 7D 65 348 36 D 52 9B 4A D0 5A 57 58D 61
D0 5A 25 58 D6 17D 7D 65 348 36 6D A5 9B 4A D0 5A 257 58 61 7D
5A 25 758 D6 17D 7D 65 34 36 6D A5 29B 4A D0 5A 257 58 D6 7D 7D
25 758 D6 17 7D 65 34 836 6D A5 29B 4A D0 5A 25 58 D6 17D 7D 65
75 D 17 D7 6 34 83 6D A5 29 4 D 5A 25 75 D6 17 7 65 34
8D 61 D D6 53 83 66 A 29 B4 AD 05 2 75 8D 17 D7 D6 34 83
Linear probing with an example.

61 7D 7D 53 483 66 DA 52 B4 AD 05 A2 575 8D 61 D7 D6 53 83 66D

b) Double Ended Queue(De-Queue)

7D 7D 65 48 66 DA 52 9B A 0 A2 57 8D 61 7D D 53 48 66 A
7D 65 348 36 DA 52 9B 4A D0 5A 57 58D 61 7D 7D 653 48 366 DA 52
65 348 36 6D 52 9B 4A D0 5A 257 58 61 7D 7D 65 48 366 DA 52 9B
34 36 6D A5 9B 4A D0 5A 25 58 D6 7D 7D 65 34 36 D 5 9B 4A
83 6D A 29 4 D 5A 25 75 D 17 7 6 34 83 6D A5 29 4A D

Page 2 of 2
66 A 52 B4 AD 05 2 75 8D 61 D7 D6 53 83 66 A 29 B4 D 05
DA 52 9B A 0 A2 57 8D 61 7D D 53 48 66 DA 52 B AD 05 A2
52 9B 4AD D05 5A2 57 58D 61 7D 7D 653 483 366 DA 52 9B4 4AD 05 A2 575
9B 4A 0 A 57 58 61 7D 7D 65 48 66 DA 52 9B A 0 A2 57 8D

-----------------------------
4A D0 5A 257 58 D6 7D 7D 65 348 36 D 52 9B 4A D0 5A 57 58D 61
D0 5A 25 58 D6 17D 7D 65 348 36 6D A5 9B 4A D0 5A 257 58 61 7D
5A 25 758 D6 17D 7D 65 34 36 6D A5 29B 4A D0 5A 257 58 D6 7D 7D
25 758 D6 17 7D 65 34 836 6D A5 29B 4A D0 5A 25 58 D6 17D 7D 65

A25758D617D7D65348366DA529B4AD05
75 D 17 D7 6 34 83 6D A5 29 4 D 5A 25 75 D6 17 7 65 34
8D 61 D D6 53 83 66 A 29 B4 AD 05 2 75 8D 17 D7 D6 34 83
61 7D 7D 53 483 66 DA 52 B4 AD 05 A2 575 8D 61 D7 D6 53 83 66D
7D 7D 65 48 66 DA 52 9B A 0 A2 57 8D 61 7D D 53 48 66 A
7D 65 348 36 DA 52 9B 4A D0 5A 57 58D 61 7D 7D 653 48 366 DA 52
65 348 36 6D 52 9B 4A D0 5A 257 58 61 7D 7D 65 48 366 DA 52 9B
34 36 6D A5 9B 4A D0 5A 25 58 D6 7D 7D 65 34 36 D 5 9B 4A
83 6D A 29 4 D 5A 25 75 D 17 7 6 34 83 6D A5 29 4A D
66 A 52 B4 AD 05 2 75 8D 61 D7 D6 53 83 66 A 29 B4 D 05
DA 52 9B A 0 A2 57 8D 61 7D D 53 48 66 DA 52 B AD 05 A2
prim’s algorithm and find out the cost with all intermediate steps.
Paper / Subject Code: 51403 / Data Structures and Analysis

52 9B 4AD D05 5A2 57 58D 61 7D 7D 653 483 366 DA 52 9B4 4AD 05 A2 575
9B 4A 0 A 57 58 61 7D 7D 65 48 66 DA 52 9B A 0 A2 57 8D
What is collision? What are the methods to resolve collision? Explain

4A D0 5A 257 58 D6 7D 7D 65 348 36 D 52 9B 4A D0 5A 57 58D 61

What is Minimum Spanning Tree? Draw the MST using kruskal’s and

D0 5A 25 58 D6 17D 7D 65 348 36 6D A5 9B 4A D0 5A 257 58 61 7D

5A 25 758 D6 17D 7D 65 34 36 6D A5 29B 4A D0 5A 257 58 D6 7D 7
25 758 D6 17 7D 65 34 836 6D A5 29B 4A D0 5A 25 58 D6 17D 7D
75 D 17 D7 6 34 83 6D A5 29 4 D 5A 25 75 D6 17 7
8D 61 D D6 53 83 66 A 29 B4 AD 05 2 75 8D 17 D7 D6
61 7D 7D 53 483 66 DA 52 B4 AD 05 A2 575 8D 61 D7 D6
7D 7D 65 48 66 DA 52 9B A 0 A2 57 8D 61 7D D 53
10
10

20

7D 65 348 36 DA 52 9B 4A D0 5A 57 58D 61 7D 7D 653

65 348 36 6D 52 9B 4A D0 5A 257 58 61 7D 7D 65 48
34 36 6D A5 9B 4A D0 5A 25 58 D6 7D 7D 65 34
83 6D A 29 4 D 5A 25 75 D 17 7 6 34 83
66 A 52 B4 AD 05 2 75 8D 61 D7 D6 53 83
DA 52 9B A 0 A2 57 8D 61 7D D 53 48 66
52 9B 4AD D05 5A2 57 58D 61 7D 7D 653 483 366
9B 4A 0 A 57 58 61 7D 7D 65 48 66 D
4A D0 5A 257 58 D6 7D 7D 65 348 36 D
D0 5A 25 58 D6 17D 7D 65 348 36 6D A
5A 25 758 D6 17D 7D 65 34 36 6D A5
25 758 D6 17 7D 65 34 836 6D A5
7 1 D 8 6 A 2