Scribd
Upload
16 views2 pages

16.04.25 An - Daa-Set A

The document outlines a Continuous Assessment Test for the course 'Design and Analysis of Algorithms' for the academic year 2024-25. It includes various questions related to algorithm analysis, such as solving recurrence relations, asymptotic analysis, and specific algorithms like Strassen’s matrix multiplication and the Knapsack problem. The test is structured into two parts, with a total of 50 marks and a duration of 1 hour and 30 minutes.

Uploaded by

brenugadevi89
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
16 views2 pages

16.04.25 An - Daa-Set A

The document outlines a Continuous Assessment Test for the course 'Design and Analysis of Algorithms' for the academic year 2024-25. It includes various questions related to algorithm analysis, such as solving recurrence relations, asymptotic analysis, and specific algorithms like Strassen’s matrix multiplication and the Knapsack problem. The test is structured into two parts, with a total of 50 marks and a duration of 1 hour and 30 minutes.

Uploaded by

brenugadevi89
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

PART B 2 x 15 = 30 Marks

Department of _______________________ (i) Solve T(n)=T(n-1)+n n>1 by backward


10 CO1 BT1
substitution method.
11
(Common to All branches) (a) (ii) Elaborate Asymptotic analysis of an
CONTINUOUS ASSESSMENT TEST – I 5 CO1 BT2
algorithm.
Academic Year: 2024-25 - EVEN Semester
(or)

Register No. : SET : A 11 Explain the Strassen’s matrix multiplication


15 CO1 BT2
(b) method with example.
Date & Session : 16.04.2025 & AN Year/Semester : II/IV
Explain Knapsack problem using greedy
Subject code / :
Name of the 21CSE07-Design and Analysis of Algorithms
technique with capacity
Subject 12
: : 15 BT3
Marks 50 Marks Duration 1:30 Mins
(a) CO2

Part A 10 x 2 = 20 Marks
Q. BT
Question Marks CO (or)
No Level
1 What is an algorithm?
2 CO1 BT1
2 CO1
List the properties of order of growth. 2 BT2
3 How to find the best and worst case of an CO1 12 CO2 BT3
algorithm? 2 BT2 15
(b)
4 Write the applications of convex hull? CO1
2 BT1 Apply PRIM’S algorithm to find the minimum
5 CO1 cost spanning tree for the above given problem.
What is substitution method and its types? 2 BT1
6 2 CO2 CO
Define Prim’s Algorithm. BT2 Level
Course Outcomes Marks
Analyze the asymptotic performance (time and space complexity)
7 2
What is greedy method? CO2 BT2 CO1 of algorithms. 25
8 Difference between prim’s and kruskal’s 2 CO2
algorithm. BT1 CO2 Understand and compare different algorithmic design techniques 25
BLOOM’S TAXONOMY LEVELS
9 2 CO2 BT1 – Remember, BT4 – Analyze,
What is Knapsack Problem? BT2 BT2 – Understand, BT5– Evaluate,
10 BT3 – Apply, BT6- Create
Define Minimum spanning tree with example. 2 CO2 BT1
Course Coordinator HOD

You might also like