6D 8C 95 49 46

3 24 A1 50 45 D3
9 AA 6 C8 3 1F 24
46 6D C 96
D3 8 CA
69
5
B4
9 46 D8
24 1 50 45 D3 CA
9 AA 6 C8 31F 24 1A
6D C 96
8 69
5
B4
9 46 D8 A6
CA 50 45 9

1
24 1 D3 CA 55
9 AA 6C8 31F 24 1A 06
6D C

2 a
e
c
a
8 69 96 C8
B4 D

26763
5 46 A6
CA 50 9 45 D3 8C 9 B4
1 AA 6C8 3 1F 24 A1 55
06
94
53
D8 69 B4 C 96
D
AA C8 1F
CA 5 50 9 45
46
D3 8C 69 B4 C4
1 AA 6 3 1F 24 A1 55
06
94
53
6D
32
69
C8
C 96 A C8 1F 49
5
B4
9 46 D 8C
A6
9 B4 C4 6D
50 45 D3 55 94 6D
1A 6 C8 3 1F 24 A1 06 53 32
8C
Duration: 3hrs

A6 C 96 AA C8 1F 49 A1
B4 D

Match the following

95 9 46 AA m
Attempt any FOUR
50 45 D3 6D 69 8C 69 B4 C4
6 3 94 8C 55 6D
C8 1F A1 0 6 5 31 24 A 55 32
B4 C4 96
D8
AA C8 FC 4 96 1 AA 06
C8
94 6D 69 B4 4 6
C 5 9 6

What is a postfix expression?

D8 B4
53
1F 32 A 1A 50 4 5 D32 C 95
50 94
49 6C 31 4 A1
8 F A 6 53
un
C4 6D
N.B. : (1) Question No 1 is Compulsory.

A6 B4 C4 96 A C8 1F
6D 8C 95 6 6 B
9 D8 9 4 C4
(3) All questions carry equal marks.

32 A1 50 45 D3 C A 5 5 9 4 6D
49
6D AA 6C 31
FC 2 4 1 0 6 5 3 32
69 8B 96 AA C8 1F 49
8C 55 4 94 4 6D D 8 69 B4 C4 6D
ot
0 9 6

Page 1 of 2
A1
6 5 3 3 CA 55 4 D 8C

List some applications of queue data structure.

AA C8 1F 24
96 1 A 06 5 3 3 2 A1
69 B4 C4 D A 6
C8
B
1F
C 49
6 AA
55 94 6D 8 C 9 5 4 4 D 6
es

d Calculate the time complexity of the following code:

06 53 32 50 94 6D 8C
A1 5 3

b What are the advantages of Linked List over an array?

C8 1F
C4 4 96 AA 6 C8 31 24 A1A
B4

46D32496D8CA1AA695506C8B494531FC
D8 69 FC 96
94 6D B4 4 D
(4) Assume suitable data, if required and state it clearly.

A6
3 CA 55 94 6 D 8
(2) Attempt any three questions out of the remaining five.

53 24 06 53 CA 95
1F 9 1A 32 50
.in
C4 6D C 8 1 F 49 1 A
6D 8C
A6
95 B 49 C 46 6D A6
32 A 5 4 D 8C 95
49 1A 06 53 3 2 A 50
6D A6 C8 1F 4 9 1A 6C
8C 95 B4 C4 6D A6 8B
50 94 6D 8C 95
A1
AA 6C 5 31 32 A1 50
69 8 F C 49
6D A A
6C
4

Explain types of Trees and application of Tree Data structure with an examples.
B4 8B
55 94 6D 8 6 9
C 5 49
[Max Marks: 80]

06 53 32 A1 50 45
C8 1F
C4 4 96 AA 6 C8
B4 D8

[10]
[20]

94 6D 69 B4
Paper / Subject Code: 32228 / Department Optional Course-I: Data Structures and Algorithm

53 3 CA 55
0
94
1F 24
96 1 AA 6 C8
53
1F
C4 D8 C
6D 69 B4
32 CA 55 94
49 1A 06 53
6 A C8 1F
 8B

C
6

45
50
AA

1F
Paper / Subject Code: 32228 / Department Optional Course-I: Data Structures and Algorithm

49
6C
95

53
A1

8B
A6

50

94

1F
8C

6C
95
1A

B4

53
A6
6D

50
A

94
C8
8C

95
A
49

B4
6
1

A6
D

50
32

CA

C8
6

5
6D

1A
49
b Apply the concept of link list to express the following polynomials P1 and P2 [10]

9
8

6
6
D

0
2
C4

A
into linked list form and add them to form new polynomial P3. Write proper

C8
55
3

96

C
D

A
1F

69
8
steps with sketches.

06
24
6

A1
6D
C4
53

AA

55
3

8C
6D

49
94

1F

69
A1
6D
32
B4

4
3

AA
C
5

C
D

9
4
C8

1F

8
4
9

1
6D
2
4

CA
3
06

A
3
B

FC
5

1A
49
4
C8
55

D8
9

46
31

32
B4

CA
3 a Explain circular queue and doubly ended Queue with examples. 69 [10]

96
5
50

6D
AA

94
C8

D8
4
95

1
b Consider the following in order and preorder traversal of a binary tree. Is it [10]

32
4

C4
53
6
A1

96
6

6D
AA

4
C8

1F
possible to obtain the POSTORDER Traversal of the same tree? If yes, construct

24
9
8C

B4

4
9

53
06
1

3
a binary tree.

6
6
6D

6D

49
A

4
C8

F
55

49
8C

31
D B E A F C G
A
49

In-order

32
C4
69

6
A1

5
6D

50
32

6D
AA

94
8

1F
A B D E C F G
C

Pre-order

C
5
6D

49

B4

C4
9

53
D8

06
1

6
32
C4

94
C8

1F
55
96

C
6D

A
1F

B4
69

53
D8

06
.in
4

1
32
C4

CA
53

AA

94
8
5
96

6C
95
6D
94

1F

B4
4 a Explain types of operations performed on Binary Search Tree. [10]
8
4

A1

A6
D

50
32
B4

C4
53

C8
96

95
D

1A
b List the different searching techniques. Explain with example binary search [10]
94
C8

1F

06
4
es
6

A6
D
2
B4

CA
53
06

55
D3
FC

96

algorithm.

1A
94
C8
55

69
D8
24
6
31
B4

C4

A
9

06

AA
5 a Construct the Huffman Tree and determine the code for each character given in [10]
3

96
A6

8C
6D
94
C8

F
55

ot
4

A1
31

the following table with occurring frequency. Jjustify how data compression is
1A

6D
32
B4

4
9

06

FC
A6

8C
CA

6D

achieved by Huffman encoding for string message. Explain the process write
4
C8
55

24
9

31
1A

6D
B4

C4
69
D8

06

proper steps with sketches.

3
45
un
CA

6D

49
AA

C8

1F
55
96

Character A B C D E F
32
B4

C4
9

3
D8

6
24

A1

A6

5
0

6D
94
8

1F
55
D3

96

Frequency 5 9 12 13 16 45
8C

6C
A

C4
69

53
24
46

A1

8B
D

0
m AA

94

1F

b Write a short note on (any one):

5

[10]
D3

96

8C

6C
5

B4
69

53
24
46

A1
D

50

a. Bubble Sort algorithm

AA

94
C8
D3
C

96

8C

95
1F

B4
6
24
46

A1

b. Quick Sort algorithm

A6
D

0
3

C8
55
D3
C

96
45

8C

1A
1F

69

06
24

c. Merge Sort algorithm

49

46

A
3

AA

55
D3
C

96
45

C
1F

6 a What is the use of hashing? What is mean by collision? Show hash table entries [10]
69
D8
24
9

46

A1
B4

AA
D3
C

96
45

8C

for the given dataset: 12, 45, 67, 88, 27, 78, 20, 62, 36, 55. Use modulo division
C8

1F

24
9

46

A1
6D
B4

3
6

D3
C

method for hash table size 10.

45
50

8C
49
C8

1F
9

46
95

6D
32
B4

3
6

b Write a short note on (Any one) [10]

C
45
50

6D

49
C8

1F
9
5

32

a. Tree Traversal Algorithm

B4

C4
69

3
6

45
50

6D
AA

C8

1F
9
5

b. Graph Traversal Algorithm

B4

C4
69

3
6
A1

45
50
AA

C8

1F
9
8C

B4
69

53
6
1

50
CA

AA

94
C8

====================End of Paper========================
5

B4
69
8

6
1
6D

50
CA

AA

C8
5
9

69
8

26763 Page 2 of 2
24

1
6D

50
CA

AA
3

95
6D

8
24

A6
6D

CA
D3

1A
9

46D32496D8CA1AA695506C8B494531FC
D8
24
46