2
3
B0
27
44
BE
6
Paper / Subject Code: 51124 / Data Structures & Algorithm
A2
3B
25
D0
67
B0
27
44
BE
01
6
A2
3B
25
D0
99
67
27
44
E
7E
B
B
90
B
5
D0
96
67
02
43
E9
BE
9A
0B
54
Duration: 3hrs [Max Marks:80]
67
9 0
46
67
02
D
9
44
BE
9A
E
67
01
B
7
5
0
A2
96
99
46
67
2
ED
B0
N.B.: (1) Question No 1 is Compulsory.
7E
7
01
27
B
6
69
D0
2
(2) Attempt any three questions out of the remaining five.
96
99
3B
67
7A
74
BE
A
7E
01
44
(3) All questions carry equal marks.
26
2
96
9
B
6
25
67
A
(4) Assume suitable data, if required, and state it clearly.
9
4
3
E
9A
E
7
B0
01
27
4
B
6
67
4
A2
9
3B
46
5
67
D0
A9
E9
2
67
B0
01
27
44
BE
7
1 Attempt any FOUR [20]
69
A2
96
99
B
5
0
67
4
02
D
9A
7E
67
7
4
a Explain ADT. List linear and nonlinear data structures with examples. BE
01
2
4
A2
96
B
46
5
0
99
67
2
D
3
b Write an algorithm to check for balanced parenthesis in an expression using stack.
9A
7E
7
B0
7
4
E
7E
26
B2
4
B
90
96
6
25
0
96
7A
7
74
D
c Write a short note on Big O notation with examples.
43
9
9A
16
B0
E
9A
6
B2
4
B
7
90
A2
46
25
0
d What are the different collision avoidance techniques? Explain
6
46
67
3
9
67
0
27
44
E
A
7E
67
01
B
B
A2
69
B
e Consider the following graph: Write adjacency matrix and adjacency list.
25
D0
A2
96
43
9
74
16
B0
27
BE
A
7E
27
54
26
90
69
3B
D0
6
3B
67
02
7A
A9
E9
4
44
BE
7
01
B
44
7
B2
69
25
D0
2
96
9
25
67
A
9
4
B0
43
BE
9A
7E
67
B0
01
2 7
54
D0
A2
99
3B
46
67
D0
A9
02
BE
7E
67
01
27
44
BE
0B
69
2
96
99
B
25
67
7A
67
4
ED
9A
7E
7
B0
01
4
01
6
B2
4
7B
A2
96
99
46
5
D0
99
9A
7E
16
67
0
27
44
BE
7E
0B
90
96
B
46
25
96
7A
67
ED
43
E9
9A
67
B0
9A
01
B2
54
7B
67
A2
46
0
99
46
02
D
43
9
67
27
E
9A
7E
67
01
0B
4
B
A2
B
25
96
99
46
ED
43
6
B0
27
A
7E
67
54
B
90
69
3B
D0
2
96
67
02
7A
E9
74
44
BE
A
01
B
26
67
B2
69
25
D0
9
67
A
9
74
2 a Write a C program to implement a queue using Arrays. Write a function for [10]
B0
3
BE
9A
7E
01
27
44
26
D0
96
9
3B
46
67
Enqueue, Dequeue, and display.
A
E9
BE
A
67
01
27
4
7
69
54
96
99
b Construct binary search tree. Consider the following list of numbers: 18, 25,16, [10]
3B
67
7A
74
02
9A
7E
01
4
26
0B
B2
54
36, 08, 29, 45, 12, 32, 19
96
99
46
A
02
ED
9A
7E
67
27
44
0B
96
3B
6
5
7A
74
02
D
9A
3 a What is hashing? What properties should a hash function demonstrate? [10]
4
BE
6
B
B2
54
A2
46
D0
7
02
b Write a C program to implement a stack using a linked list. [10]
16
67
27
44
BE
0B
90
A2
B
5
7
02
D
43
E9
16
27
BE
54
90
3B
D0
7
02
E9
16
44
BE
B
67
25
D0
99
7
A9
16
B0
BE
7E
27463 Page 1 of 2
90
69
D0
6
7
A9
E9
74
16
BE
7
0
69
96
99
67
74
9A
7E
7469A967E990167BED0B025443B27A26
01
74 E9 ED 44 67
69 90 0B 3B2 46
A9 16 02 7A 9A
67 7 BE 54 2 96
74
69
E9
90 D 43B 67
46
7E
99
A9 16 0B 27 9A 01
6 7E 7BE
02
54 A 26 9 67 67
99 D0 43B 74 E9 BE
9A 0 16 B 27 69
A
90 D0
B0
A
6 a
5 a
02 16 4 a
96
7 7BE 5 26 96 7B 25
27463
E9 D 44 7E 44
90 0B 3B2 74
69 99 ED 3B
16 02 7A A 01 0B 27
7E 7 BE 54 2 96 67 02
54 A2
99 D0 43B 67
46
7E
99
BE
43 67
016 B 27 9A 01
D0
B0 B2 46
9A
7 BE
02
5 A 26 9 67 6 7B 25 7A 96
44 44 26
D0 3 74 E9 ED 3B
7E 74
01 B B2 69 90 99
on its complexity
A 1 2 0B 69
67 02 7A
2 96 67 0 2 7 A A 9
01
67
BE 54 67 7E B E 5 4 2 6 6 7
D0 43
B 46 9 9 D 4 3 7 4 E 9
BE
B0 27 9A 01 0 B 69 90 D0
25 A2 96 67 B0
25
27 A 1 67 B0
44 6 74 7E9 B ED 44
A2
67
96
7E BE 25
44
3B 6 9 3 4 9 D
linear search and binary search.
27 9A 01 0B B2 69 90 0 3B
A2 96 67 02 7A A9 16 B0 27
67 7E BE 54 2 6 7 B 25 A2
46 99 43 67 7E
9 E D 4 4 67
9A 01
D0 B 46 9 0 3 B 46
96 67 B0
25
27 9A 01
67 B 02 2 7A 9A
A2 96 5
7E BE 4 43 6 7 7 B E 44 2 6
96
7E
99 D0 4 E9 D 3B 7
B B2 69 0 46 99
************
01 90
b Write short notes on BFS and DFS algorithms.
7A B0 27 9A 01
Page 2 of 2
67 02 A9 16 A
BE 54 2 6 7 B 25 9 67
43 67 7E
9 E D 4 4 26 67 BE
D0
B0 B 27
46
9A 9 01 0 3 B 74
69
E9
90 D
25 A2 96 67 B0
25
27
A2 A 96 167
4
7469A967E990167BED0B025443B27A26
44 67 7E BE 6 7
3B 46 99 43 7 4 E9
BE
27 9A 01
D0
B B 2 69 9 0
D0
b Write a short note on the implementation of the Huffman tree.
A2 96 67 0 7 A 1 B0
67 7E BE 25
4
A2
67
96
7E
67
B 2
46 99 D0 43
B2 46 99 E D0
9A 01
Write an algorithm to convert infix expression to postfix using stack.
96 67 B0 7 9A 01 B0
25 A2 96 67
Paper / Subject Code: 51124 / Data Structures & Algorithm
7E BE 44 67 7E BE 25
99 3 4 44
01
D0
B B2 69 99 D0 3
67 02 7A A9 01
67 B 0
BE 54 26 67 25
Explain insertion sort using an example. Write an algorithm for it and comment
43 7 E 9
BE
D 44
D0
B0 B 27
46
9A 9 01 0B 3B
25 A2 96 67 02 27
44 6 7 B 5 44
[10]
[10]
[10]
[10]
b What are Expression Trees? Draw the tree structure for the following expression: [10]
What is the advantage of a binary search over linear search? Distinguish between [10]
3B 74 E9 ED
27 6 9A 9 01 0 B
3B
A2 96 67 02 27
54 A2
67
46
7E
99
BE
43 6
9A 01
D0
B0 B 27
96 67
B 2 5 A2
7E E 44 6
