B D 3B 82 D 5 CD 83 C5 C5

BC CD6 63B 82 6DE E55 5CD 83 C5C C58 85A

8 6 C C 5 5
CD D63 3B8 26D DE5 55C D8 83C 5C5 585 A5 5A
63 B8 26D E5 5C D8 3C5 5C5 85 A55 5AA A01
63 B8 26D E5 5C D8 3C5 C5 85 A55 AA 01 2B
2 3 A
3B B82 6DE E55 5CD D83 C5C C58 85A 55A AA 012 2BB BCD
8 6 D 5 C 8 C 5 5 5 0
B8 26 E 5C D8 3C 5C 85 A5 5A A0 12B BBC CD6 63B
2 6 DE 55 D 3 5C 58 A 5A A 12 B D 3 82
82 D 55 CD 83 C5 58 5A 55 A 012 BB CD 63 B8 6D
6 E C 8 C C 5 5 A 0 B C 6 B 2 E
6D DE5 55C D8 3C5 5C5 585A A55 5AA A01 12B BC D6 3B8 826 6DE 55C
E5 5C D8 3C5 C5 85 55 AA 01 2B BC D6 3B 26 DE 55C D

69390
E5 5C D8 3C5 C5 85 A55 AA 01 2B BC D6 3B 826 DE 55C D 83C
D 3 A B D 3 8 D 8
55 5CD 83C C5C C58 85A 55A AA 012 2BB CD 63 B82 26D E5 55C D83 3C5 5C5
C 8 5 5 5 5 5 A 0 1 B C 6 B 6 E 5 C D
5C D8 3C C 85 A5 A 0 2B BC D6 3B 826 DE 55 D 83C C5C C58 85A
D8 3C 5C 585 A5 5A A0 12B BC D6 3B 82 DE 55 CD 83 5C 58 5A 55A
3C 5C 585 A5 5A A0 12B BC D 3B 82 6D 55 CD 83 C5 58 5A 55 A
5C 58 A5 5A A0 12 B D 63B 82 6D E5 CD 83 C5 C5 5A 55 AA 01

(ii) Pop
58 5A 5A A0 12 BB CD 63 82 6D E5 5C 83 C5 C5 85A 55 AA 01 2B

(i) Push
operations:
5A 55 A 12 BB CD 63 B8 6D E5 5C D8 C C5 85 5 A 01 2B BC

operations:

(iii) Peek
using stack

for each case

55 AA 01 BB CD 63 B8 26D E5 5C D8 3C 5C 85 A5 5A A0 2B BC D6
AA 01 2B C 6 B 26 E 5C D 3C 5C 58 A5 5A A0 12 B D 3B
01 2B BC D6 3B8 826 DE 55C D8 83C 5C 585 5A5 5A A0 12B BBC CD 63B 82
2B BC D6 3B 26 DE 55 D 3C 5C 58 A 5A A0 12 B D 63 82 6D

function for DFS

BC D6 3B 82 DE 55 CD 83 5C 58 5A 55A A 12 BB CD 63 B8 6D E5
D6 3B 826 6DE 55 CD 83 C5C 58 5A 55A A 012 BB CD 63 B82 26D E5 5C

(i) Insert a node .

(ii) Delete a node
3B 82 DE 55 CD 83 C5C 58 5A 55A A 012 BB CD 63 B8 6D E5 5C D8

(iv) Display the list

82 6D 55 CD 83 C5 58 5A 55 A 012 BB CD 63 B8 26D E5 5C D8 3C

(c) Expression Tree

6D E5 C 8 C5 C5 5A 55 AA 01 B C 6 B8 26 E 5C D 3C 5C
E5 5C D8 3C5 C5 85 55 AA 01 2B BC D6 3B 26 DE 55C D 83C 5C 58
5C D8 3C C 85 A5 A 0 2B BC D6 3B 826 DE 55 D 83C 5C 58 5A

(d) Topological Sorting

Q.6. Write Short notes on (any two)
D8 3C 5C 585 A5 5A A0 12B BC D6 3B 82 DE 55 CD 83 5C 58 5A 55A
3C 5C 585 A5 5A A0 12B BC D 3B 82 6D 55 CD 83 C5 58 5A 55 A
N.B: (1) Question No.1 is compulsory

5C 58 A5 5A A0 12 B D 63B 82 6D E5 CD 83 C5 C5 5A 55 AA 01

(iii) Display the stack contents

58 5A 5A A0 12 BB CD 63 82 6D E5 5C 83 C5 C5 85A 55 AA 01 2B
5A 55 A 12 BB CD 63 B8 6D E5 5C D8 C C5 85 5 A 01 2B BC
55 AA 01 BB CD 63 B8 26D E5 5C D8 3C 5C 85 A5 5A A0 2B BC D6

(b) Explain Threaded Binary tree in detail

AA 01 2B C 6 B 26 E 5C D 3C 5C 58 A5 5A A0 12 B D 3B

(b) Collision Handling techniques

(b) Explain Priority Queue with example.
(3 Figures to the right indicate full marks

01 2B BC D6 3B8 826 DE 55C D8 83C 5C 585 5A5 5A A0 12B BBC CD 63B 82

2B BC D6 3B 26 DE 55 D 3C 5C 58 A 5A A0 12 B D 63 82 6D
BC D6 3B 82 DE 55 CD 83 5C 58 5A 55A A 12 BB CD 63 B8 6D E5
D6 3B 826 6DE 55 CD 83 C5C 58 5A 55A A 012 BB CD 63 B82 26D E5 5C
3B 82 DE 55 CD 83 C5C 58 5A 55A A 012 BB CD 63 B8 6D E5 5C D8
82 6D 55 CD 83 C5 58 5A 55 A 012 BB CD 63 B8 26D E5 5C D8 3C
Q.1 (a) Explain Linear and Non-Linear data structures.

6D E5 C 8 C5 C5 5A 55 AA 01 B C 6 B8 26 E 5C D 3C 5C
(c) Write a program in ‘C’ to implement Quick sort.

E5 5C D8 3C5 C5 85 55 AA 01 2B BC D6 3B 26 DE 55C D 83C 5C 58

Q.3 (a) Explain Huffman Encoding with suitable example
Time: 3 Hours

5C D8 3C C 85 A5 A 0 2B BC D6 3B 826 DE 55 D 83C 5C 58 5A

*******************
D8 3C 5C 585 A5 5A A0 12B BC D6 3B 82 DE 55 CD 83 5C 58 5A 55A
3C 5C 585 A5 5A A0 12B BC D 3B 82 6D 55 CD 83 C5 58 5A 55 A
5C 58 A5 5A A0 12 B D 63B 82 6D E5 CD 83 C5 C5 5A 55 AA 01
Q.4 (a) Write a program in ‘C’ to implement Queue using array.
58 5A 5A A0 12 BB CD 63 82 6D E5 5C 83 C5 C5 85A 55 AA 01 2B

(a) Application of Linked-List –Polynomial addition

5A 55 A 12 BB CD 63 B8 6D E5 5C D8 C C5 85 5 A 01 2B BC
55 AA 01 BB CD 63 B8 26D E5 5C D8 3C 5C 85 A5 5A A0 2B BC D6

85A55AA012BBCD63B826DE55CD83C5C5
AA 01 2B C 6 B 26 E 5C D 3C 5C 58 A5 5A A0 12 B D 3B
(2) Attempt any three questions of the remaining five questions

01 2B BC D6 3B8 826 DE 55C D8 83C 5C 585 5A5 5A A0 12B BBC CD 63B 82

2B BC D6 3B 26 DE 55 D 3C 5C 58 A 5A A0 12 B D 63 82 6D
Paper / Subject Code: 50905 / Data Structures

BC D6 3B 82 DE 55 CD 83 5C 58 5A 55A A 12 BB CD 63 B8 6D E5
D6 3B 826 6DE 55 CD 83 C5C 58 5A 55A A 012 BB CD 63 B82 26D E5 5C
3B 82 DE 55 CD 83 C5C 58 5A 55A A 012 BB CD 63 B8 6D E5 5C D8
82 6D 55 CD 83 C5 58 5A 55 A 012 BB CD 63 B8 26D E5 5C D8 3C
6D E5 C 8 C5 C5 5A 55 AA 01 B C 6 B8 26 E 5C D 3C 5C
E5 5C D8 3C5 C5 85 55 AA 01 2B BC D6 3B 26 DE 55C D 83C 5C 58
(b) Write a program in ‘C’ to check for balanced parenthesis in an expression
Q.2 (a) Write a program to implement Circular Linked List. Provide the following
(4) Make suitable assumptions wherever necessary with proper justifications

5C D8 3C C 85 A5 A 0 2B BC D6 3B 826 DE 55 D 83C 5C 58 5A
D8 3C 5C 585 A5 5A A0 12B BC D6 3B 82 DE 55 CD 83 5C 58 5A 55A
3C 5C 585 A5 5A A0 12B BC D 3B 82 6D 55 CD 83 C5 58 5A 55 A
5C 58 A5 5A A0 12 B D 63B 82 6D E5 CD 83 C5 C5 5A 55 AA 01
58 5A 5A A0 12 BB CD 63 82 6D E5 5C 83 C5 C5 85A 55 AA 01

(b) Explain Depth First search (DFS) Traversal with an example. Write the recursive
(b) Explain different cases for deletion of a node in binary search tree. Write function

5A 55 A 12 BB CD 63 B8 6D E5 5C D8 C C5 85 5 A 01 2
55 AA 01 BB CD 63 B8 26D E5 5C D8 3C 5C 85 A5 5A A0 2B
Q.5 (a) Write a program in ‘C’ to implement Stack using Linked-List .Perform the following

AA 01 2B C 6 B 26 E 5C D 3C 5C 58 A5 5A A0 12 B
(5)
Marks: 80

(5)

(10)
(10)
(10)
(10)
(10)

(20)
(10)
(10)
(10)
(10)

01 2B BC D6 3B8 826 DE 55C D8 83C 5C 585 5A5 5A A0 12B BBC

2B BC D6 3B 26 DE 55 D 3C 5C 58 A 5A A0 12 B
BC D6 3B 82 DE 55 CD 83 5C 58 5A 55A A 12 BB CD
D6 3B 826 6DE 55 CD 83 C5C 58 5A 55A A 012 BB CD
3B 82 DE 55 CD 83 C5C 58 5A 55A A 012 BB CD 6
82 6D 55 CD 83 C5 58 5A 55 A 012 BB CD 63
6D E5 C 8 C5 C5 5A 55 AA 01 B C 6 B
E5 5C D8 3C5 C5 85 55 AA 01 2B BC D6 3B
5C D8 3C C 85 A5 A 0 2B BC D6 3B 8
D8 3C 5C 585 A5 5A A0 12B BC D6 3B 82
3C 5C 585 A5 5A A0 12B BC D 3B 82 6
5C 58 A5 5A A0 12 B D 63B 82 6D
58 5A 5A A0 12 BB CD 63 82 6D
5 5 B B