Professional Documents
Culture Documents
MAD Blooms Taxonomy Question Paper Format
MAD Blooms Taxonomy Question Paper Format
CO BTL
1a Define Asymptotic Notation and Give the commonly used asymptotic CO1 K1 4
. notation to calculate running time complexity of algorithm.
CO1 K4 4
b. List the types of analysis to perform on a particular algorithm.
CO2 K2 4
c. Outline the use of Min Max Heap.
(OR)
(OR)
Analyze the insert,delete and merge operations in leftist heap with
5. CO2 K4 10
suitable example
6. Elaborate how double rotation fix the problem found in single rotation 10
of AVL tree with an example. CO3 K6
(OR)
(OR)
11
Discuss in detail about knapsack using backtracking CO5 K6 10
.
Bloom’s Taxonomy Level (BTL)