FDS Insem 2019 Pattern
FDS Insem 2019 Pattern
:
PA-21 [Total No. of Pages : 2
[5931]-31
3
5:3
S.E. (Electronics & Computer/Artificial Intellegence & Data Science)
:3
FUNDAMENTALS OF DATA STRUCTURES
10
/01 71
(2019 Pattern) (Semester - I) (210242)
23
8
/20
.38 13
Time : 1 Hour] [Max. Marks : 30
0
Instructions to the candidates:
17
7.1 GP
1) Answer Q.1 or Q.2, Q.3 or Q.4.
2) Neat diagrams must be drawn wherever necessary.
CE
84
3
3.1
5:3
10
:3
Q1) a) Define the following terms with suitable example. [4]
10
i) Data Structure 1/2 1
3
7
02
8 1 38
iii) Algorithm
GP
iv) Flowchart
CE
8
7.1
:33
3.1
5
10
c) Write an algorithm to compute the sum of the digits of the given number.
0:3
[6]
7
02
38
OR
01
7/0
Q2) a) Give complete classification of data structures with one example of each.
7.1 GP
81
[4]
.3
CE
84
b) Explain divide & conquer Strategy and Greedy strategy with suitable
example. [5]
6
3.1
3
b) Explain row major & column major representation of arrays in computer
5:3
memory. [5]
:3
10
/01 71
c) Write an algorithm to perform polynomial addition state the time
23
8
complexity of the algorithm. [6]
/20
.38 13
0 OR
17
7.1 GP
3
[5]
3.1
5:3
10
:3
c) Write an algorithm to perform sparse matrix addition & state its time
10
complexity. 1/2 1 [6]
3
7
02
8 1 38
4.3 01
7/0
GP
CE
8
7.1
6
:33
3.1
5
10
0:3
31
1/2 1
7
02
38
01
7/0
7.1 GP
.3 81
CE
84
6
3.1
10
[5931]-31 2