Professional Documents
Culture Documents
IAT2 Algorithms
IAT2 Algorithms
Bloom’s
Q.No Question CO
Taxonomy
An NP-hard problem can be solved in
1. deterministic polynomial time, how?(
CO5 K1
8(a) C04 K3
OR
10a) CO3 K3
OR
Write the algorithm for quick sort. Provide a complete
10b) analysis of quick sort for the given set of numbers CO3 K3
12,33,23,43,44,55,64,77 and 76.