| CO |
At the end of course , the student will be able to understand:
|
Bloom’s Level
|
|
CO1
|
Design new algorithms, prove them correct, and analyze their asymptotic and absolute runtime and memory demands. |
K4, K6
|
|
CO2
|
Find an algorithm to solve the problem (create) and prove that the algorithm solves the problem correctly (validate). |
K5, K6
|
|
CO3
|
Understand the mathematical criterion for deciding whether an algorithm is efficient, and know many practically important problems that do not admit any efficient algorithms. |
K2, K5
|
|
CO4
|
Apply classical sorting, searching, optimization and graph algorithms. |
K2, K4
|
|
CO5
|
Understand basic techniques for designing algorithms, including the techniques of recursion, divide-and-conquer, and greedy. |
K2, K3
|
