Roll No 313301

JAYWANTCOLLEGEOFENGINEERINGPOLYTECHNICK.M.GAD
UNIT TEST -I
Subject: DSU Date: 2 7 / 0 9 /2024
Course Code: CO-3K Marks: 30.
Semester: III Time: 1:30 hour.
Note:1) All Questions are Compulsory.
2)Figures to right indicate full marks.
Q.1 Attempt any five of following Level CO Marks
a) Define Algorithms and state its properties CO1
BT1 2
b) Define Sorting and State its Technique. CO2
BT1 2
c) What is difference between Linear Search and Binary Search? CO2
BT3 2
d) Enlist the types of Data Structure and Define it. CO1
BT1 2
e) Draw Node with proper diagram and Give its Example. CO1
BT1 2
f) What are needs of Data Structure. CO3
BT2 2
g) State the operations on data structure. CO1
BT1 2
Q.2 Attempt any five of the following.
a) Explain Stack Data Structure with example CO1
BT2 4
b) Explain sorting techniques with example CO2
BT2 4
c) Perform Binary search operation on {1,2,3,4,5,6,7} & find 6. CO2
BT3 4
d) What is time complexity and space complexity of algorithms? CO1
BT2 4
e) Explain searching and its types. CO2
BT2 4
f) Explain Data structure and state its types. CO1
BT2 4
g) Describe working of Radix sort. CO2
BT2 4

Roll No 313301

JAYWANTCOLLEGEOFENGINEERINGPOLYTECHNICK.M.GAD
UNIT TEST -I
Subject: DSU Date: 2 7 / 0 9 /2024
Course Code: CO-3K Marks: 30.
Semester: III Time: 1:30 hour.
Note:1) All Questions are Compulsory.
2)Figures to right indicate full marks.
Q.1 Attempt any five of following Level CO Marks
a) Define Algorithms and state its properties CO1
BT1 2
b) Define Sorting and State its Technique. BT1 CO2 2
c) What is difference between Linear Search and Binary Search? CO2
BT3 2
d) Enlist the types of Data Structure and Define it. CO1
BT1 2
e) Draw Node with proper diagram and Give its Example. CO1
BT1 2
f) What are needs of Data Structure. CO3
BT2 2
g) State the operations on data structure. CO1
BT1 2
Q.2 Attempt any five of the following.
a) Explain Stack Data Structure with example CO1
BT2 4
b) Explain sorting techniques with example CO2
BT2 4
c) Perform Binary search operation on {1,2,3,4,5,6,7} & find 6. CO2
BT3 4
d) What is time complexity and space complexity of algorithms? CO1
BT2 4
e) Explain searching and its types. CO2
BT2 4
f) Explain Data structure and state its types. CO1
BT2 4
g) Describe working of Radix sort. CO2
BT2 4