FA

E
57
BF

DC

BC
Paper / Subject Code: 51124 / Data Structures & Algorithm

8A
D0
37

FA

FA
57
DC
46

BC
7B

8A
D0
B8

FA

FA
63

57
DC
44

7B
84

A
D0
DC

8
B

57
F

C
6
4
61

7B
4
4

D
Duration: 3hrs [Max Marks:80]

D0
8
C

FA
CF

4B

3
D

DC
46

05
1
3A

B
4
6

8
C

37

CD
CF

B
CE

BF
46
N.B. : (1) Question No 1 is Compulsory.

4
61
A

C4

D
AB

37
3

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

B
CE

D
AC

46
4
AF

7B
(3) All questions carry equal marks.

C4
B

B8
E3

CF
78

FA

3
1D
(4) Assume suitable data, if required, and state it clearly.

46
4
C
5

3A

7B
4
A
D0

AB

8
DC
F
78

4B

63
CE

C
DC

F
5

61
3A

84
C4
A
D0

AB
1 Attempt any FOUR [20]
A

F
8

4B
CE

1D
57

C
BF

DC

AF

3A
List different data structures along with one application?

C4
a

6
7

CF
78

FA
63

CE

D
BF

DC

44
5
b Find adjacency matrix A and adjacency list for the following directed graph.

61
84

3A
A
0

B
7

DC
FA

CD

CF
78
4B

A
63

CE
F
05

61
B
84

3A
C4

8A

AB
7

FA

CF
4B

63
D

CE
57
DC

F
61

B
84

3A
C4

8A
0

AB
7

CD
CF

4B

3
D

CE
57
BF
46

F
61
3A

C4

AD

8A
D0

AB
8

7
CF

4B

63
CE

57
BF

DC

AF
61
3A

84
C4
AB

D0
7

FA
CF

78
4B

3
CE

C
6
AF

05
61
3A

7B
4

c Compare between Bubble sort and insertion sort with an example.

4

AD
AB

8
C

CD
CF
8

3
CE

D
57

BF
46
44
AF

61
3A

AD
d Convert following expression to postfix
D0

AB

B8
DC

7
CF
8

63
CE

(f-g)*((a+b)*(c-d))/e
57
DC

BF
44
AF

61
3A

84
D0

AB

DC

37
FA

CF
78

4B
CE

e Explain types of queues with examples?

DC

46
AF
05

61
B

C4
AB

B8
37

3
FA

CD

F
8

Write a program in ‘C’ language for quick sort algorithm?

CE

2 a [10]
1D
57

AC
46

44
AF
B

AD

D0

AB

F6
B8

37

DC
E3
8

b Explain the properties of Binary Search Tree. Create a binary search tree using the [10]
57

AC
BF

DC
6
44

AF

BC

61
84

D0

following data elements:

DC

37

E3
FA

CF
8
4B

FA
57
C
6

45,28,34,63,87,76,31,11,50,17
C
7B
84

3A
C4

AD

8A
D0

3 a Explain possible operations on doubly linked list and write algorithm to display [10]
4B

FA
63
1D

CE
57
BF

list?
84
4

AD

A
D0
F6

AB
DC

37

78
4B
AC

BF

DC
6

AF
05

Explain stack overflow and underflow conditions with suitable example?

61

b [10]
84
C4

37
E3

FA

CD
CF

78
4B
1D

4 a Write an algorithm to check the well-formedness of parenthesis? [10]

05
3A

7B
84
4

AD
F6

DC

CD
4B

63
CE

AC

b Explain Singly linked list? State advantages and applications of Linked List? [10]
BF
61

84
4

AD
AB

DC

37
E3

CF

4B

BF
6
AF

BC

61

5 a Explain how element 29 can be searched in the given array using the Binary search [10]
3A

84
C4

37
CF
78

4B

algorithm. Write algorithm for the same.

CE

1D

46
AF

3A

4
B

F6

5, 9, 11, 15, 25, 29, 30, 35, 40.

B8
DC
78

FA

CE

AC

44
5

61
8A

b Write a function in C for DFS traversal of graph. Explain DFS graph traversal with [10]
D0

DC
E3

CF
FA
7

suitable example?
DC

BC
05

61
3A
8A
FA

CF
A

CE
7
DC

AF
05

3A
B
FA

78

FA

CE
DC

5
7B

8A
D0

B
FA

FA
63

39214 Page 1 of 2
7
DC

05
7B
84

8A
FA

CD
4B

63

7
05
7B
84

AD

CD
B

61DC44B84637BFADCD0578AFABCE3ACF
BF
46
44
 4B FA 78 E3 DC
84 DC AF AC 44
63 D0 AB F6 B8
44 7B 5 CE 1D 46
B FA 78 3A 37
84 DC AF C4 B
63
7B D A CF 4B
84
FA
05 BC 61 6 DC
FA 7 E3 DC 37
6
DC 8A AC 4 B
D0
46 FA 4B 57
3 D B
FA 8

c
a
F6

d
b
7B 05 84 DC AF
FA 7 CE 1D 6 37 AB

39214
DC 8A 3A C4 BF
D0
FA 4B 57 CE
D0 B
CF
61 84 AD 8 3A
BF 5 78 CE DC 63 CD AF
AB CF
AD 3A 7B
AF 4 05 CE 61
D
CD A CF 4B
84
FA 78 3A C4
05 BC 61 6 DC AF
7 E3 DC CF 4B
Attempt ALL

8A 37 D0 AB 84
CD FA AC 4 4B BF 57 CE 61
D 63
05 B F6 84 AD 8AF 3A C4 7
7 8A
CE 1D 6 37 C D0 AB CF 4B BF
A
3A C4 BF 61 84 DC
FA CF 4B 57
8
CE D 63
7
B 61 84 AD AF 3A C4 D0
5
CE DC 63 C D0 AB CF 4B BF
A 78
3A 4 7B 61 84 AF DC
CF 4B FA 57
83A
CE D AB 63
7 D0
61 84
6 DC AF
CF
C4
4B BFA 78 CE 5
DC 37 AB 8
44 BF
D0 61 46 DC A 3A
57 CE
3 D C 3 7 D FA CF
B8
46
AD 8A A 4 B 0 57 B CE 61
CD FA CF 4B FA 8 DC
37 05 BC 61 84 D A 3 A
BF 78 E3 DC 63 CD F CF 44
A 7 AB
6 B8
List practical applications of stack and queues?

AD AC 44 BF 0 5 C 1 46
D

Page 2 of 2
CD FA B A 78
B F 8 E3 C 4
37
05 C 61 4 6 DC AF
******************** AC 4B
BF
78 E3 DC 3 7 D 05
AB F 61 84
Differentiate between static arrays and dynamic arrays.
What is hashing? Explain hash collision with example?

AF AC 44 BF
AB B8 78 CE D C
63
F6 AD A 3A 4 7B

61DC44B84637BFADCD0578AFABCE3ACF
CE 1D 46 FA 4B
3A 3 7B
CD
0 B
CF
6 8
FA
C4
57 CE 1 D 4 6 DC
CF 4B
84
FA 8A 3A C4 3 7B
61 DC F C 4
DC 63
7 AB F B 8
FA
44 BF
D0
57 CE 61D 46 DC
3
Write down the expression that it represented by following binary tree.
Paper / Subject Code: 51124 / Data Structures & Algorithm

B8 AD 8A 3A C4 7B D0
46 C F C 4 B F A
57
37 D0 AB F 61 8 DC
BF 57 CE DC 46
AD 8A 3A 37 D0
CD F CF 4 4 B FA 57
AB
6 B8 8A
05 CE 1D 46 D C FA
78 3A C4 37 D0
AF 4B BF 57
AB CF
8 A 8A
[20]

61 46 DC
CE
3A D C4 3 7B D0 FA
57 BC
CF 4B FA 8 E
61 84 D A FA
DC 63 CD
44 7B 05 BC