EX

D
6Y

DD

26

1D
Paper / Subject Code: 51124 / Data Structures & Algorithm

EE
12

X1
Y1

6Y
EX

DD

EE

D
26

12

Y1
EE

Y1

DE
X1

EX

26
DD
Duration: 3hrs Marks: 80

26
E

1D

EE

1
E

EX
Y1

DE

Y
X

DD
26
E
26

E
N.B. : (1) Question No 1 is Compulsory.

1D

DE
X1
E
X1

6Y
Y

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

EE

1D
26

EE
EE

2
X1
Y1

DE
X1
(3) All questions carry equal marks.

6Y

DD
DE

EE
6
EE

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

2
1D

1
DE
X1

6Y
EX
E

6Y
6Y

DD

EE

2
D

E
2
1 Attempt any FOUR [20]

X1
12

Y1

DE
1
1

DE

X
6Y

6
EX

EE
a What are various operations possible on data structures? [5]

26
E

12
D
1D

EE
12

Y1

DE
X1
EE

EX
b Convert the following expression into postfix. Show all steps [5]

Y
X

DD

26
EE
DD

1D
26

EE
EE
a+b*c/d-e

1
Y1

DE
1

6Y
EX

D
Y1

DE

D
c Differentiate between Linked List and Array. [5]

26
E

2
1D
26

EE
1D

Y1
X1
EE

X1

DD
X1

d Which terminologies are used in Tree? List them. [5]

6Y

DD
Y

26
EE
D

EE
26
EE

12
D

Y1
X1
e Write an algorithm for linear search. [5]

Y1

DE
Y1

DE
X1

X
DE

26
EE
26
E

1D
26
E

1D

X1
EE
1D

DE
X1
E

X1

6Y
2 a Explain analysis of algorithms with time and space complexity. [10]
E

6Y

EE
DD
6Y

EE
D

1D
EE

12
b Write a program in ‘C’ to check well-formedness of parentheses in algebraic 2
1D

DE
[10]
12

Y1

DE
X1

Y
EX
DE
Y

26
EX

1D
expression.
26
E

1D
6

EE
1D

X1
E
2

X1

6Y
E

E
1

6Y

DD
DE

6Y
EX

EE
D

EE

12
12
D
2
1D

Y1

DE
E

EX
Y1

DE
1

3 a Explain a Singly linked list? State advantages and applications of Linked List? EX [10]
DE

X
6Y

26

1D
26

EE
EE

1D

EE
1D

X1
12

X1

6Y

DD
E

b Explain the preorder and postorder traversal methods. Consider the following in- [10]
6Y

DD
6Y
EX

EE
DD

EE

12
2

Y1
order and preorder traversal tree. Construct Post-order traversal tree and draw
12

Y1

DE
1
E

EX
1

DE

EX
DE

6Y

26
EX

26

binary tree.
1D

EE
1D

X1
EE
12
1D

X1
E

6Y

D
DE

Y
EX

EE
DD
6Y

In-order D B F E A G C L J H
EE

D
26

12
1D

Y1

DE
E
2

Y1

DE
1

EX
DE
X1

X
6Y

26

1D

Preorder A B D E F C G H J L
26
E

1D

EE
EE

1D

X1
E
12

X1

6Y
DE

6Y

DD
DE

6Y
EX

EE
EE

12
12
D
2
1D

DE
EE

EX
Y1

DE
X1

Y
EX
6Y

26
DD

1D

4 a Sort the given list of numbers using quick sort. Show step by step procedure. [10]
26

EE
EE

1D

EE

X1
12

X1

6Y

DD
1

14, 33, 27, 57, 100, 12

DD
6Y
EX

EE
DD

EE

12
2

Y1

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

Y1

E
X1

EX
1

E
X1

D
6Y

26
DD

26

with suitable example?

1D

EE
EE

X1
2

X1
1

E
X1

6Y

DD
E

6Y

EE
DD

EE
DD

EE

12

5 a Using algorithms, explain operations on Queue. [10]

Y1

DE
1

DE
X1

EX
1

6Y
6Y

26

b Write a C program to implement a queue using arrays. Write a function for [10]
DD

1D
EE

EE
2

X1
1
X1

6Y
1

Enqueue, Dequeue and Display.

6Y

D
6Y

EE
DD

EE

12
D
2
2

Y1

DE
X1

EX
1

E
X1

6Y

DD

26
EE

6 a What are Expression Trees? Draw the tree structure for the following expression: [10]
1D

EE
EE

X1
1

E
X1

6Y

(2a + 5b)3 (x - 7y)4

6Y

DD

EE
EE

12
2

Y1

b Hash the following data in a table of size 10 using linear probing and quadratic [10]
1

E
X1

EX
E

6Y

DD

26
DD

probing. Also find the number of collisions.

EE
2

X1
1
X1
Y1

6Y

63, 82, 94, 77, 53, 87, 23, 55, 10, 44

EE
DD

EE
26

Y1

DE
X1
1

E
X1

6Y

DD

__________________
6
EE

1D
2
12

X1
1

6Y
6Y
EX

DD

EE

12
12
EE

EX

55689 Page 1 of 1
6Y
EX

DD
DD

EE
12
EE

1
Y1

6Y
EX

DD
DD

12
E

1
Y1

DE

X126Y1DDEEEX126Y1DDEEEX126Y1DDEEEX126Y1DDEEE
6Y
EX