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