Total No. of Questions : 5] SEAT No.

:
P1288 [Total No. of Pages : 2
[6055]-101

7
5:4
S.Y.B.Sc. (Computer Science)

4:2
CS - 231 : DATA STRUCTURES AND ALGORITHMS - I

6/2 1
31
(2019 Pattern) (Semester - III) (23121)

6/0 72
02
Time : 2 Hours] [Max. Marks : 35
8
.19 01
Instructions to the candidates:
1) All questions are compulsory.
AN
61
2) Figures to the right indicates full marks.
3) Neat diagrams must be drawn whenever necessary.
CA
.80

Q1) Attempt any EIGHT of the following. [8×1=8]

13

7
6.2

a) Define Data Object.

5:4
10

4:2
b) What are the advantages of ADT?
21
c) Write any two applications of Queue. 31
02
87

d) What is top of the stack?

6/2
01

e) State True or False. “Queue Follows Last in First out (LIFO) Order”.
6/0
AN
61

f) Write the time complexity of merge sort.

.19
CA

g) What is stack underflow?

.80

h) Define space complexity.

13

7
6.2

i) What is circular queue?

5:4
10

4:2

j) Which data structure is used in recursion?

21
31
02
87

Q2) Attempt any four of the following. [4×2=8]

6/2
01

a) What are different asymptotic notations?

6/0
AN
61

b) List the operations performed on dequeue.

.19

c) Write the postfix expression of the following(A+B) * (C-D).

CA
.80

d) Write node structure of singly linked list.

13

e) Give any two applications of stack.

6.2
10

P.T.O.
Q3) Attempt any TWO of the following: [2×4=8]

7
a) Write a ‘C’ function for deleting element from singly linked list.

5:4
b) Sort the following elements using insertion sorting method.

4:2
6/2 1
31
25, 15, 45, 85, 75, 55, 35, 65.

6/0 72
02
c) Write a ‘C’ function to reverse singly linked list.
8
.19 01
AN

Q4) Attempt any two of the following: [2×4=8]

61

a) Explain with example - Generalized linked list.

CA
.80

b) Write ‘C’ function for implementing Linear search algorithm.

13

7
c) Evaluate the following postfix expression AB*C-(Let A = 5, B=6, C = 4).
6.2

5:4
10

4:2
21
Q5) Attempt any one of the following: 31 [1×3=3]
02
87

a) Write a short note on priority queue.

6/2
01

b) Define the following terms.

6/0
AN

i) Time complexity.
61
.19

ii) Doubly Ended Queue.

CA
.80
13

   7
6.2

5:4
10

4:2
21
31
02
87
6/2
01
6/0
AN
61
.19
CA
.80
13
6.2
10

[6055]-101 2