Course Outcomes
|
5IT4-05.1 |
Describe asymptotic analysis concepts and use them to evaluate the time-complexity of different algorithms. |
| 5IT4-05.2 | Analyze the divide and conquer, greedy method and dynamic programming techniques to solve various complex engineering problems. |
| 5IT4-05.3 | Discuss and use Branch and Bound, and pattern-matching algorithms. |
| 5IT4-05.4 | Discuss randomized algorithms for min-cut and 2-SAT problems. |
| 5IT4-05.5 | Describe the classes P, NP, and NP Complete and prove that a certain problem is NP-Complete. |
Mapping of COs and POs
| COs | PO1 | PO2 | PO3 | PO4 | PO5 | PO6 | PO7 | PO8 | PO9 | PO10 | PO11 | PO12 | PSO1 | PSO2 | PSO3 |
| CO1 |
3 |
1 | 1 | 2 | - | - | - | - | - | - | - | - | 3 | - | - |
| CO2 | 3 | 3 | 1 | 2 | 3 | - | - | - | - | - | - | - | 3 | - | - |
| CO3 | 2 | 3 | 1 | 1 | 3 | - | - | - | - | - | - | - | 3 | - | - |
| CO4 | 1 | 2 | - | - | - | - | - | - | - | - | - | - | 3 | - | - |
| CO5 | 2 | 3 | - | 2 | - | - | - | - | - | - | - | - | 3 | - | - |
| Avg | 3 | 3 | 1 | 2 | 3 | - | - | - | - | - | - | - | 3 | - | - |
