C2 BE EF A7 0F

E2 92 5A 7 D6 70
C5 8B 43 1C
FE EA F2 2E
1C
2E
BE F5 77 0 F7 2C
92 A D6 0 5B
2C 8B 43 1C
5B FE EA F2 2E E9
E9 F5 7 0 F7 2C 28

1
2C 28 A 43
7D 0 1C 5B BF
BF 6F EF

2 a
e
c
a

b
d
5B EA 20 2E E9 5A
EF

13184
E9 7 F7 2C 28 43
2 8B
5A
43
7D 0 1C 5B BF EA
FE 6F E9 EF
77
EA 20 2E 5A
E9 F 7 F7 2C 28 43 D6
2 8B
5A
43
7D 0 1C 5B BF EA F2
FE 6F E9 EF
77 0F
EA 20 2E 5A 70
F 5A 77 F7 2C 28 43 D6 1
43 D6 0 1C
C2
E2 5B BF
EF EA F2
F2 E9 0F
FE EA 0 2E 2 5A 77
D 7 0 C5

steps with sketches.

Attempt any FOUR
Match the following
F5 77 F7 2C 8B 4 3E 6 1 C BE
A4 D6 01 5B FE A7
F2
0F 2 E2 92 m
3E F2 C2 E9 F5 C 8B
A7 0F E2 28 A4 7D 70 5 FE
7D 70 C5 3 6F 1C BE

b Explain linear and non-linear

BF E 2
6F 1C BE EF 2 0 E 9 2
F5
20 2E 92 5A
A7
7 F7 2 8B A4
2 D 0 C5 F 3E
N.B. : (1) Question No 1 is Compulsory.

F7 C 8B 4 3 6 1 C B E E
(3) All questions carry equal marks.

F2 F5 A7
un
01 5B FE EA 2E
C2 E9 F5 0 F7 2C
92
8B A 4
7D
Duration: 3hrs

E2 77 3 6F
28 A4 D6 01 5B FE EA 20
C5 BF 3E F2 C 2 E9 F 7
BE EF A7 0F E2 28 5A4 7 D
F7
01
92 5A 7D 70 C5 3 6F

Page 1 of 2
BF
ot
C2
8B 43 6 F 1C BE EF EA 20
F E2
FE EA 20 2E 92 5A 77 701 C5
4
Calculate the time complexity of the following code:
F5 77 F7 2C 8B D6 BE
A4 01 5B 3E F2 C2
9 List the practical applications of link list data structure.
FE
es
D6 A E
(4) Assume suitable data, if required and state it clearly.

3E F2 C2 E9 F5 7 0F 2C
7

What is Stack data structure and what are its applications.

(2) Attempt any three questions out of the remaining five.

A7 0F E 2C 28 A4 7 D6 01 5B

F701C2E2C5BE928BFEF5A43EA77D6F20
linear data structures with examples.

7D 70
1C 5 BF 3 E F 20
C2 E9
6F BE EF E2
2E
A7
7 F 7
28
20 92 5A
.in
F7 2C 8B 4 D 6 0 1
C5
B
BF
01 5B FE 3E F2 C 2E E9
C2
E2
E9 F5 A7
7D
0F
70 2 C5
28
BF
28 A4 1 B
C5 BF 3E 6F2 C2 E9 EF

into linked list form and add them to form new polynomial P3. Write proper
BE EF 0F E 28 5A

Apply the concept of link list to express the following polynomials P1 and P2
A7 2C
92 5A 7D 70 B

Explain types of Trees and application of Tree Data structure with an examples.
8B 43 1C 5B FE
FE EA
6F
20 2E E 92 F5
[Max Marks:80]

F5 77 F7 2C 8B A4
A4 D6 01 5B FE 3E
A
[10]
[10]
[20]

3E F2 C2 E9 F5
A7 0F E2 28
Paper / Subject Code: 32228 / Department Optional Course-I: Data Structures and Algorithm

A4
7D 70 C5 BF 3E
6F 1C BE EF A7
20 2E 92 5A 7D
F7 2C 8B 43 6
01
C2
5B FE E A7
E9 F5 7D
E2 28 A4
 9

A
5A
BF

6
BE

7D
3E
Paper / Subject Code: 32228 / Department Optional Course-I: Data Structures and Algorithm

EF
28
C5

A7
A4
E9

BF

7D
E2

3E
F5
5B

28
C2

FE

A7
A4
2C

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

01

E
F5
B
E

28

3
F7

C2

C5

FE

4
E9
b Consider the following in order and preorder traversal of a tree. Is it possible to [10]

5A
20

01

E2

8B
B

EF
6F
obtain the POSTORDER Traversal of the same tree? If yes, construct a binary

C2

C5

92

A4
F
7D

BF
20

E
tree.

01

F5
5B
2E
A7

28
6F

FE
0F

2C

E9
D
3E

8B
7

F2

5B
E
7
A4

C2
EA

92
D6

2C
F5

20

BE
1
77
3

70

2E
FE

28
F
4 a Explain any five operations performed on Binary Search Tree. [10]

C5
EA
A

D6

0F

1C

E9
8B

F5

E2
7
3

F2
b Give different searching techniques. Explain with example binary search [10]

70

5B
E
92

7
A4

C2
A
F

0F
BE

2C
D
8B

3E
5
algorithm.

01
F

F2

2E
C5

FE
2

A7
4

F7
9

5A

1C
BE

7D
E2

8B

20

E2
EF

70
C2

92

A7
A4

6F
C

C2
BF
5 a Explain the application of Huffman coding with an example. [10]

0F
E
1

7D
E2

3E
F5
70

01
28

F2
2

C5

FE

A7
4
b Write a short note on (any one): [10]
0F

F7
C

E9

5A

D6
1

8B

3E
F2

20
0

5B
E

EF

77
7

a. Bubble Sort algorithm

2

92

A4

6F
D6

.in
0F

1C

2C

EA
BF
BE

7D
F5
77

F2

2E

b. Quick Sort algorithm

28

43
7

C5
EA

FE

A7
D6

0F

E9

5A
1

E2

8B
c. Merge Sort algorithm

3E
77
43

F2

5B

EF
F7

2
es
EA
5A

92

A4
6

2C
D

BF
0

BE
01
EF

F5
77
43

2E

28
6F

F7

5
EA
5A

FE
BF

6 a What is the use of hashing? What is mean by collision? Show hash table entries [10]
1C

2C

E9
7D

8B
EF
28

43

F2

70

5B
E
A7

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

5A

92
BF

0F

2C
D
3E

BE
5B

01
EF
28

F2

2E
method for hash table size 10.
A7
4

F7
2C

E9

C5
5A
BF

D6

1C
E

20
un
5B
2E

E2
EF

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

28

77
3

70
A4

F
1C

2C

C2
E9

EA
BF

0F
7D
F5

a. Tree Traversal Algorithm

70

5B
2E

01
28

F2
FE

A7
4
0F

F7
1C

2C

E9

5A

D6

b. Graph Traversal Algorithm

8B

3E

20
m
0

5B
2E

EF

77
F7

A4

6F
1C

___________________
2C

E9

EA
BF
0

7D
F5
F2

5B
2E

28

43
F7

FE

A7
D6

1C

2C

E9

5A
0

8B

3E
7

F2

5B
2E

EF
A7

F7

92

A4
D6

1C

2C

BF
20

BE

F5
77

2E

28
6F

F7

C5
EA

FE
1C

E9
7D

20

E2

8B
43

5B
7

6F

F7

C2
EA
5A

92
C
7D

20

BE
01

2
EF

43

2E
7

6F

F7

C5
EA
A

1C
7D
F5

E2
43

F2

70
FE

C2
EA
A

D6

0F
8B

F5

01
77
43

F2
FE
92

F7
EA
5A

D6
BE

8B

20
EF

77
43
92

6F
EA
5A
BF
BE

7D
F
28

43
C5

FE

A7

13184 Page 2 of 2
E9

5A
E2

8B

3E
5B

F
C2

FE
2

A4
2C

E9

8B

F5
5B
2E

FE
2

F701C2E2C5BE928BFEF5A43EA77D6F20
1C

2C

E9