Total No. of Questions : 8] SEAT No.

8
23
P-9671 [Total No. of Pages : 2

ic-
[6179]-241

tat
6s
S.E. (Computer Engineering A.I & D.S.)

8:4
02 91
FUNDAMENTALS OF DATA STRUCTURES

9:3
0
(2019 Pattern) (Semester - III) (210242)

30
9/1 13
0
Time : 2½ Hours] [Max. Marks : 70
2/2
.23 GP

Instructions to the candidates:

1) Answer to the questions (Q.No.1 or Q.No.2, Q.No.3 or Q.No.4, Q.No.5 or Q.No.6,
E
82

8
Q.No.7 or Q.No.8).
C

23
ic-
2) Assume suitable data, if necessary.
16

tat
3) Draw neat labelled diagram wherever necessary.
8.2

6s
4) Figures to the right indicate full marks.
.24

8:4
91
49

9:3
Q1) a) Sort the following numbers step by step using insertion sort : [9]
30
30

55, 85, 45, 11, 34, 5, 89, 99, 67

01
02

Comment on time complexity of Insertion sort

2/2
GP

b) Explain in brief any three searching techniques. What is the time complexity
9/1

of these techniques? [9]

CE
82

8
OR

23
.23

Q2) a) Explain Fibonacci Search algorithm with suitable example. What is it’s
ic-
16

time complexity? [9]

tat
8.2

6s

b) Given numbers 29, 57, 47, 39, 36, 20, 55, 28, 31, 39. Sort stepwise using
.24

8:4

radix sort. When it is appropriate to use radix sort? Write time Complexity.
91

[9]
49

9:3
30
30

Q3) a) Write pseudo code for following function using Singly Linked List
01
02

of students (roll_number and name stored in every node) [9]

2/2
GP

i) Search given roll no and delete that record. Draw diagram of

9/1

operation.
CE
82

ii) Add given number after specified number in the list. Draw
.23

diagram of operation.
16

b) Write and explain use of Generalized linked list for representation

8.2

of multivariable polynomial with suitable example. Explain node

.24

structure. [9]
49

P.T.O.
 OR

8
23
Q4) a) Write pseudocode to perform addition of two polynomials using doubly

ic-
linked lists into third list. Write time complexity of it. [9]

tat
b) Write and explain node structure of Circular Singly Linked List and Doubly

6s
Linked list. Write pseudocode for concatenation of two doubly linked

8:4
02 91
lists. [9]

9:3
0
30
Q5) a)
9/1 13
Write rules to convert given infix expression to postflx expression using
0
stack. Convert expression (P * Q – (L + M * N) ^ (X * Y / Z) stepwise
2/2
.23 GP

using above rules.

E

Where ^ is - exponential operator. [8]

82

8
C

23
b) Explain with example three different types of recursion. [9]

ic-
16

tat
OR
8.2

6s
Q6) a) Explain procedure to convert infix expression to prefix expression and
.24

8:4
postfix evaluation with suitable example. [8]
91
49

9:3
b) Write pseudo-C/C++ code to implement stack using Singly linked list
30
30

with overflow and underfiow conditions. [9]

01
02
2/2
GP
9/1

Q7) a) Draw and explain Circular queue using array. Write pseudocode for Add,
CE
82

8
Remove operations. [8]

23
.23

b) What is Doubly Ended Queue? Draw Dragram with labelling four basic
ic-
16

tat
operations at appropriate places. Which two data structures are combined
8.2

6s

in it and how? [9]

.24

8:4
91

OR
49

9:3
30
30

Q8) a) Write short note on : [8]

01
02

i) Comparison of Circular Queue with Linear queue

2/2
GP

ii) Priority Queue

9/1
CE
82

b) Draw and explain implementation of Linear Queue using Singly Linked

.23

List. Explain Add, Remove, Queue Full and Queue Empty operations.[9]
16
8.2


.24
49

[6179]-241 2