8

23
ic-
Total No. of Questions—8] [Total No. of Printed Pages—3

t
7 sta
Seat

6:0
[5559]-183

01 91
No.

9:3
5/2 0
90
1/0 13
S.E. (Computer Engineering) (I Sem.) EXAMINATION, 2019
8 1 P0
DATA STRUCTURES AND ALGORITHMS
.23 G

(2015 PATTERN)
CE

8
Time : Two Hours Maximum Marks : 50

23
ic-
16

N.B. :— (i) Attempt Q. No. 1 or Q. No. 2, Q. No. 3 or Q. No. 4,

tat
8.2

7s
Q. No. 5 or Q. No. 6, Q. No. 7 or Q. No. 8.
.24

6:0
91
49

(ii) Draw neat diagrams wherever necessary.

9:3
30
90
(iii) Figures to the right indicate full marks.
01
01

(iv) Assume suitable data, if necessary.

5/2
GP
1/0
CE
81

8
1. (a) Write pseudo C/C++ code to perform simple transpose of

23
.23

ic-
16

sparse matrix. [4]

tat
8.2

7s
(b) State the characteristics of an algorithm. [2]
.24

6:0
91
49

(c) What is complexity analysis of an algorithm ? Explain the notations

9:3
30
90

used in the complexity analysis. [6]

01
01
5/2
.23 G
P
1/0

Or
16 E
81

2. (a) What is sparse matrix ? Explain its representation with an

C

example. [4]
8.2

P.T.O.
.24
49
 8
23
ic-
(b) Define : [2]

t
sta
(i) ADT

7
6:0
01 91
(ii) Data structure.

9:3
5/2 0
90
(c) Solve the recurrence relation : [6]

1/0 13
8 1 P0
ar – 10ar – 1 + 9ar – 2 = 0
.23 G

with initial conditions a0 = 3 and a1 = 11.

CE

8
23
ic-
16

3. (a) Explain polynomial representation using linked list with an

tat
8.2

7s
example. [3]
.24

6:0
91
49

(b) Define : [3]

9:3
30
90
(i) Recursion
01
01

(ii) Stack
5/2
GP
1/0

(iii) Linked List.

CE
81

8
(c) Explain process of conversion of an infix expression to postfix

23
.23

ic-
16

expression using stack : [6]

tat
8.2

7s
A * (B – C)/E ^ F + G.
.24

6:0
91
49

9:3
30
90

Or
01
01

4. (a) Explain use of backtracking in 4-Queen’s problem. [4]

5/2
.23 G
P
1/0

(b) Explain the concept of Generalized linked list. [2]

16 E
81

(c) Write pseudo C/C++ code to represent circular linked list as

C

an ADT. [6]
8.2

[5559]-183 2
.24
49
 8
23
ic-
5. (a) Write pseudo C/C++ code to implement a simple queue using

t
sta
linked list. [6]

7
6:0
01 91
(b) Explain Dequeue with the insert and delete operations

9:3
5/2 0
performed on it. [7]

90
1/0 13
8 1 P0
Or
.23 G
CE

6. (a) Write pseudo C/C++ code to implement a circular queue

8
23
using arrays. [6]

ic-
16

tat
(b) What is Priority queue ? Describe the operations on priority
8.2

7s
.24

queue and explain its applications. [7]

6:0
91
49

9:3
30
90
7. (a) Write pseudo C/C++ code for radix sort. [6]
01
01

(b) Write an algorithm for searching an element using binary

5/2
GP
1/0

search. Discuss the time complexity of algorithm in best case

CE
81

and worst case. [7]

8
23
.23

ic-
16

tat
8.2

Or 7s
.24

6:0

8. (a) Explain insertion sort algorithm and sort the given list using
91
49

9:3

insertion sort : [6]

30
90

7, 4, 10, 6, 3, 12, 1, 8, 2, 15, 9, 5.

01
01
5/2

(b) Explain merge sort algorithm using divide and conquer

.23 G
P
1/0

strategy with an example. State its time complexity and space

16 E
81
C

complexity. [7]
8.2

[5559]-183 3 P.T.O.
.24
49