Scribd
Upload
53 views2 pages

Be Artificial Intelligence and Data Science Semester 3 2022 October Fundamentals of Data Structure Fods Pattern 2019

The document is about fundamentals of data structures. It contains 4 questions related to data structures and algorithms. It discusses key concepts like data structures, abstract data types, algorithms, flowcharts, time complexity analysis, and different strategies for solving problems like divide and conquer and greedy strategies. It also contains questions on specific data structures like arrays, matrices and their storage and operations like addition through pseudo code algorithms.

Uploaded by

parth.ambe.aids.2022
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
53 views2 pages

Be Artificial Intelligence and Data Science Semester 3 2022 October Fundamentals of Data Structure Fods Pattern 2019

The document is about fundamentals of data structures. It contains 4 questions related to data structures and algorithms. It discusses key concepts like data structures, abstract data types, algorithms, flowcharts, time complexity analysis, and different strategies for solving problems like divide and conquer and greedy strategies. It also contains questions on specific data structures like arrays, matrices and their storage and operations like addition through pseudo code algorithms.

Uploaded by

parth.ambe.aids.2022
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Total No. of Questions : 4] SEAT No.

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

ic-
[5931]-31

tat
S.E. (Electronics & Computer/Artificial Intellegence & Data Science)

5s
FUNDAMENTALS OF DATA STRUCTURES

3:0
02 91
(2019 Pattern) (Semester - I) (210242)

0:4
0
31
Time : 1 Hour] 7/0 13 [Max. Marks : 30
0
1/2
Instructions to the candidates:
.23 GP

1) Answer Q.1 or Q.2, Q.3 or Q.4.


2) Neat diagrams must be drawn wherever necessary.
E
81

8
3) Figures to the right indicate full marks.
C

23
4) Assume suitable data if necessary.

ic-
16

tat
8.2

5s
Q1) a) Define the following terms with suitable example. [4]
.24

3:0
91
49

0:4
i) Data Structure
30
31

ii) Abstract Data Type


01
02
1/2

iii) Algorithm
GP
7/0

iv) Flowchart
CE
81

8
23
.23

b) What is frequency count? Why is frequency count important in the


analysis of algorithm. [5] ic-
16

tat
8.2

5s

c) Write an algorithm to compute the sum of the digits of the given number.
.24

3:0

Justify that your algorithm satisfies all the characteristics of an algorithm.


91
49

0:4

[6]
30
31

OR
01
02
1/2
GP

Q2) a) Give complete classification of data structures with one example of each.
7/0

[4]
CE
81

b) Explain divide & conquer Strategy and Greedy strategy with suitable
.23

example. [5]
16
8.2

c) Draw flowchart to check whether a given number is a perfect square of


.24

an integer. What is the time complexity of your algorithm. [6]


P.T.O.
49
Q3) a) What are advantages & disadvantages of sequential organization of data

8
23
structure? [4]

ic-
tat
b) Explain row major & column major representation of arrays in computer

5s
memory. [5]

3:0
02 91
0:4
c) Write an algorithm to perform polynomial addition state the time

0
complexity of the algorithm. [6]

31
7/0 13
0
OR
1/2
.23 GP

Q4) a) Write a short note on storage representation of an array. [4]


E
81

8
C

23
ic-
b) Write pseudo code to reverse the in numbers in one dimensional array.
16

tat
[5]
8.2

5s
.24

3:0
c) Write an algorithm to perform sparse matrix addition & state its time
91
49

complexity. [6]
0:4
30
31
01
02
1/2


GP
7/0
CE
81

8
23
.23

ic-
16

tat
8.2

5s
.24

3:0
91
49

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

[5931]-31
49

You might also like