Total No. of Questions : 8] SEAT No.

8
23
PA-1234 [Total No. of Pages : 2

ic-
[5925]-256

tat
S.E. (Computer /AI&DS)

2s
FUNDAMENTALS OF DATA STRUCTURES

7:0
02 91
(2019 Pattern) (Semester - III) (210242)

3:3
0
31
Time : 2½ Hours] [Max. Marks : 70
6/0 13
Instructions to the candidates:
0
1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
2/2
.23 GP

2) Figures to the right indicate full marks.

3) Neat diagrams must be drawn wherever necessary.
E

4) Make suitable assumption whenever necessary.

80

8
C

23
ic-
Q1) a) Write pseudo ‘Python’ algorithm (recursive) for binary search. Apply
16

tat
your algorithm on the following numbers stored in array from A[0] to
8.2

2s
A[10] 9, 17, 23,38,45,50,57,76,90,100 to search numbers 10 & 100.[9]
.24

7:0
91
b) Explain the quick sort algorithm. Show the contents of array after every
49

3:3
itertion of your algorithm start from following status of array.-
30
31

27, 76, 17, 9, 57, 90, 45, 100, 79. [9]

01
02

OR
2/2
GP

Q2) a) Explain in brief the different searching techniques. What is the time
6/0
CE

complexity of each of them? [9]

80

8
23
b) Write an algorithm of selection sort and sort the following numbers using
.23

selection sort and show the contents of an array after every pass:-
ic-
16

tat
8.2

81, 5, 27, –6, 61, 93, 4, 8, 104, 15 [9]

2s
.24

7:0
91
49

3:3

Q3) a) What is linked list? Write a pseudo C++ code to sort the elements. [9]
30
31

b) What is doubly linked list? Explain the process of deletion of an element

01

from doubly linked list with example. [9]

02
2/2

OR
GP
6/0

Q4) a) Explain Generalized Linked List with example. [9]

CE
80

b) Write Pseudo C++ code for addition of two polynomials using singly
.23

linked list. [9]

16
8.2
.24

P.T.O.
49

[5925]-256 1
Q5) a) Write an algorithm for postfix evaluation with suitable example. [8]

8
23
b) What is concept of recursion? Explain the use of stack in recursion with

ic-
example. [9]

tat
OR

2s
7:0
Q6) a) What is need to convert the infix expression into postfix; convert the

02 91
3:3
following expression into postfix expression (a+b) * d + e/(f + a*d) + c.

0
[8]

31
6/0 13
b) What is backtracking algorithm design strategy? How stack is useful in
0
2/2
backtracking [9]
.23 GP
E
80

8
C

Q7) a) Write pseudo C++ code to represent dequeue and perform the following

23
ic-
operations on dequeue: [8]
16

tat
i) Create
8.2

2s
.24

ii) Insert
7:0
91
49

3:3
iii) Delete
30
31

iv) Display
01
02

b) What is circular queue? Explain the advantages of circular queue area

2/2
GP

linear queue. [9]

6/0
CE

OR
80

8
23
.23

Q8) a) Define queue as an ADT. Write pseudo C++ code to represent queue.[8]
ic-
16

tat
b) Explain Array implementation of priority queue with all basic operations.
8.2

2s

[9]
.24

7:0
91
49

3:3
30
31
01


02
2/2
GP
6/0
CE
80
.23
16
8.2
.24
49

[5925]-256 2