​

​

 CO1

Explain the basic principles of algorithm design & performance analysis, and Apply the divide and conquer approach to solve real life problems.

​

CO2

Explain the concepts of disjoint sets and apply Backtracking Method to solve various problems.

​

CO3

Apply the Greedy Programming approach to solve different types of optimization problems.

​

CO4

Apply the Dynamic Programming approach to solve different types of optimization problems.       

​

CO5

Apply Branch and Bound Method to solve computational problems and explain the concept of NP-hard and NP completeness.

​