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
Total No. of Questions : 8] SEAT No. :

8
23
P1527 [Total No. of Pages : 2

ic-
[6002]-156

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

0s
FUNDAMENTALS OF DATA STRUCTURE

8:4
(2019 Pattern) (Semester - III) (210242)

02 91
0:2
Time : 2½ Hours] [Max. Marks : 70

0
31
4/0 13
Instructions to the candidates:
1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
0
2) Figures to the right indicate full marks.
6/2
.23 GP

3) Neat diagrams must be drawn whenever necessary.

4) Make suitable assumption whenever necessary.
E
81

8
C

23
Q1) a) Write a pseudo code for binary search apply you algorithm on the

ic-
following no.s stored in an array to search no:23 & 100. [9]
16

tat
9,17,23,40,45,52,58,80,85,95,100
8.2

0s
.24

b) Explain the selection sort with algorithm sort the following no.s using
8:4
91
selection sort & show the content of array after every pass. [9]
49

0:2
27, 76, 17, 9, 45, 58, 90, 79, 100.
30
31
01
02
6/2

OR
GP

Q2) a) Explain quick sort algorithm with suitable example. What is time
4/0
CE

complexity of quick sort algorithm. [9]

81

8
23
.23

ic-
b) Write a short note on sentinel search & Index sequential search with
16

tat
suitable example. [9]
8.2

0s
.24

8:4
91

Q3) a) Write a pseudo code to insert new node in to singly link list. [9]
49

0:2
30
31

b) Explain the representation of polynomial using GLL. [9]

01
02
6/2

OR
GP
4/0

Q4) a) What is doubly linkedlist. Explain the process of deletion of element

CE

from doubly linked list with example. [9]

81
.23

b) What is dynamic data structure. Explain with circular linked list with it’s
16

basic operation. [9]

8.2
.24

Q5) a) Write a pseudo code for basic operation of stack. [8]

P.T.O.
49

[6002]-156 1
 8
23
b) What are the variants of recursion. Explain with example. [9]

ic-
tat
OR

0s
Q6) a) Write algorithm for posfix expression evalution. Explain with suitable

8:4
example. [8]

02 91
0:2
b) Explain the linked implementation of stack with suitable example. [9]

0
31
4/0 13
Q7) a) Write pseudo code to implement circular queue using array. Explain it’s
0
6/2
.23 GP

basic operation. [9]

E

b) Explain array implementation of priority queue with all basic operation.

81

8
C

23
[8]

ic-
16

tat
OR
8.2

0s
Q8) a) Explain linked implementation of queue with suitable example. [9]
.24

8:4
91
49

b) Write pseudo code for insertion operation of input restricted & output
0:2
restricted double ended queue. [8]
30
31
01
02
6/2
GP
4/0

… … …
CE
81

8
23
.23

ic-
16

tat
8.2

0s
.24

8:4
91
49

0:2
30
31
01
02
6/2
GP
4/0
CE
81
.23
16
8.2
.24
49

[6002]-156 2
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
Total No. of Questions : 8] SEAT No. :

8
23
PB3634 [Total No. of Pages : 2
[6261]-41

ic-
tat
S.E. (Computer Engineering) (Artificial Intelligence & Data Science)

6s
FUNDAMENTALS OF DATA STRUCTURES

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

02 91
4:2
0
Time : 2½ Hours] [Max. Marks : 70

41
7/0 13
Instructions to the candidates:
0
1) Attempt question Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.
5/2
.23 GP

2) Figures to the right indicate full marks.

3) Assume suitable data if necessary.
E
81

4) Neat diagrams must be drawn wherever necessary.

8
C

23
ic-
Q1) a) Sort given array by using bubble sort method: 64, 34, 25, 12, 22, 11, 90.
16

tat
Show step by step execution for all the passes highlighting “swap” and
8.2

6s
“No Swap” situations. How many passes are required to sort an array of
.24

3:0
N elements using bubble sort? [9]
91
49

b) Write an algorithm to search an element in array A using binary search

4:2
30

technique. Show stepwise search of Key 10 in 1, 2, 3, 4, 5, 6, 7, 8, 9, 10,

41

11. Is there any pre-processing of data required before starting binary

01
02

search or what is its precursor requirement? [9]

5/2
GP

OR
7/0

Q2) a) Enlist different searching methods. Write short note on [9]

CE

i) Fibonacci Search
81

8
23
ii) Index Sequential Search
.23

b) ic-
Sort given array by using selection sort method 50, 23, 03, 18, 9, 01, 70,
16

tat
21, 20, 6, 40, 04. Show step by step execution of all passes. What is the
8.2

6s

best and worst case time complexity of selection sort? [9]

.24

3:0
91
49

Q3) a) Write pseudo code for following function using Doubly Linked List of
4:2
30

integer numbers [9]

41

i) Insert given value as last value in the list. Draw diagram of operation.
01
02

ii) Delete first node from the list. Draw diagram of operation.
5/2
GP

iii) Delete last node from the list. Draw diagram of operation.
7/0

b) Write and explain node structure of [9]

CE
81

i) Generalized linked list.

ii) Circularly Singly Linked List.
.23

Draw and explain insertion of value in Circularly Singly Linked List with
16

example.
8.2

OR
.24
49

P.T.O.
Q4) a) Write pseudocode to perform merging of two sorted singly linked lists

8
of integers into third list. Write complexity of it. [9]

23
ic-
b) Write and explain node structure of Generalized linked list for representing

tat
multiple variable polynomial. Represent given polynomial graphically using

6s
Generalized Linked List: 5x7 + 7xy6 + 11xz. [9]

3:0
02 91
4:2
0
Q5) a) Write rules to convert given infix expression to postfix expression using

41
7/0 13
stack. Convert expression (A* B – (C + D * E) ˆ (F * G / H)) stepwise
0
using above rules.
5/2
.23 GP

Where ˆ is - exponential operator. [8]

E

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

81

8
C

23
ic-
OR
16

tat
Q6) a) What is infix, prefix and postfix expression? Give example of each.
8.2

6s
Explain evaluation of postfix expression with suitable example expression
.24

3:0
and assume values for variables used to solve it. [8]
91
49

4:2
b) Write pseudo-C/C++ code to implement stack using array with overflow
30
41

and underflow conditions. [9]

01
02
5/2
GP

Q7) a) What are advantages of Circular Queue over Linear Queue using static
7/0

memory allocation? Write pseudocode to add and remove element from

CE
81

8
Circular Queue along with Queue Full and Empty condition. [8]

23
.23

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

tat
List. Explain Add, Remove, Queue Full and Queue Empty operations.
8.2

6s

[9]
.24

3:0

OR
91
49

4:2

Q8) a) What is Doubly Ended Queue? Draw Diagram with labelling four basic
30
41

operations at appropriate places. Which two data structures are combined

01

in it and how? [6]

02
5/2

b) Draw and explain Priority Queue? State any real life application. [6]
GP
7/0

c) Write pseudocode for Linear Queue Implementation using array. [5]

CE
81
.23

eeee
16
8.2
.24

[6261]-41 2
49