Course Outcomes
|
5IT4-23.1 |
Compute the running time and performance using Asymptotic Analysis. |
| 5IT4-23.2 | Discuss various sorting, searching and Graph Traversal algorithms and implement it. |
| 5IT4-23.3 | Explain the divide-and-conquer paradigm and its application to various problems. |
| 5IT4-23.4 | Create programs for finding spanning tree, shortest path using different design techniques |
| 5IT4-23.5 | Describe various design techniques and their comparison with respect to complex engineering problems. |
Mapping of COs and POs
| COs | PO1 | PO2 | PO3 | PO4 | PO5 | PO6 | PO7 | PO8 | PO9 | PO10 | PO11 | PO12 | PSO1 | PSO2 | PSO3 |
| CO1 |
- |
1 | - | - | 3 | - | - | - | - | 2 | 3 | 3 | 3 | 1 | - |
| CO2 | 2 | 1 | 1 | - | 2 | - | 2 | - | - | 2 | 3 | 2 | 3 | 1 | - |
| CO3 | 2 | 1 | 1 | - | 3 | - | - | - | - | 2 | 3 | 3 | 2 | 1 | - |
| CO4 | 2 | 1 | - | - | 2 | - | 2 | - | - | 2 | 3 | 2 | 2 | 1 | - |
| CO5 | 1 | 2 | 1 | - | 3 | - | - | - | - | 2 | 3 | 2 | 2 | 1 | 1 |
| Avg | 2 | 1 | 1 | - | 3 | - | 2 | - | - | 2 | 3 | 2 | 2 | 1 | 1 |
