Professional Documents
Culture Documents
_FDS_MockInSem2023-24 - Copy of student copy
_FDS_MockInSem2023-24 - Copy of student copy
Instructions:
Answer Q1 or Q2, Q3 or Q4
Figures to the right side indicates full marks
Assume suitable data if necessary
2M-Definition
5 Define Algorithm & its Characteristics 4 1 2M-
Characteristics
Describe Best Case,Worst Case & Average case time
6 6 1 3M-Each Case
complexity with suitable examples.
3M-Explaination
7 Explain Static and Dynamic data structure with suitable example
5 1 2M-Example
What is Data Structure & list out Linear & Non-Linear 2M-Definition
10 4 1 2M-List
data structures
Write an algorithm to perform sparse matrix addition & 6M-sparse
11 6 2 matrix addition
state its time complexity.
Describe Sparse Matrix using an array data structure 2M-Explaination
12 5 2 3M-Example
with suitable example.
Write a C++ program for Reverse function using an 4M-Reverse
13 4 2 Function
array data structures
Suppose an array a[5]={10,11,5,32,55} is given,if 6 2 6M-Delete
element 11 wants to delete from given array,so write a function
14 code to remove requested element from array
Write a C++ program for copy element from one array 4 2 4M-Program
17 to another