Total No.

of Questions : 4]

8
SEAT No. :

23
PC400 [Total No. of Pages : 2

ic-
[6359]-520
S.E. (Computer Engineering/ AI & DS/Computer Science)

tat
7s
FUNDAMENTALS OF DATA STRUCTURES
(Insem) (2019 Pattern) (Semester - III) (210242)

6:0
02 91
0:3
Time : 1 Hour] [Max. Marks : 30

0
41
8/1 13
Instructions to candidates:
1) Attempt question Q1 or Q2, Q3 or Q4.
0
2) Draw neat & labelled diagrams if necessary.
0/2
.23 GP

3) Assume suitable data, if necessary.

4) Figures to the right side indicates full marks.
E
80

8
C

23
Q1) a) Discuss any six classes of time complexity with sample code. [6]

ic-
b) Differentiate between: [5]
16

tat
i) Static and Dynamic Data structures
8.2

7s
ii) Persistent and Ephemeral Data Structures
.24

6:0
c) Explain step count method with the help of suitable example. [4]
91
49

0:3
30
41

OR
Q2) a) Analyse time complexity of following codes. Show step count for each
01
02

statement: [6]
0/2
GP

i) function is Prime(n){
8/1

for (i=2;i<n;++i){
CE
80

8
if (n%i= = = 0){

23
.23

return false;
} ic-
16

tat
}
8.2

7s

return true;
.24

6:0
91

}
49

0:3

ii) Function f()

30
41

{
01

ans=0
02

for (i=n;i>=1;i/=2){
0/2
GP

for (j=1; j <=m; j*=2){

8/1

ans+= (i*j)
CE
80

}
.23

print(ans)
16

}
8.2

}
.24

P.T.O.
49

[6359]-520 1
 b) How asymptotic notations plays important role in defining complexity

8
23
class? Explain Big-Oh, Big-theta and Big-Omega notation with graphs

ic-
denoting growth rate. [5]

tat
c) What is algorithmic strategy? Explain divide & conquer and greedy

7s
strategy with example. [4]

6:0
02 91
0:3
Q3) a) How can we find transpose of sparse matrix in linear time? Give

0
41
pseudocode for his method. [6]
8/1 13
0
0/2
b) Given an array,arr [1.......10] [1......15] with base value 100 and the size
.23 GP

of each element is 1 Byte in memory. Find the address of arr[8] [6] with
E

the help of row-major technique and column major technique. [5]

80

8
C

23
ic-
c) Compare and contrast row major and column major technique with the
16

tat
help of any matrix. [4]
8.2

7s
.24

OR
6:0
91
49

0:3
Q4) a) Write an algorithm to calculate sum of numbers stored in array and illustrate
30
41

all characteristics of algorithm for the same. [6]

01
02
0/2
GP

b) Give a pseudocode for polynomial addition. [5]

8/1
CE
80

8
c) What is an ADT? Write ADT operations for array. [4]

23
.23

ic-
16

tat
8.2

7s


.24

6:0
91
49

0:3
30
41
01
02
0/2
GP
8/1
CE
80
.23
16
8.2
.24
49

[6359]-520 2