Course Outcomes
|
5IT4-23.1 |
Interpret the functioning of sorting algorithms such as Quick Sort and Merge Sort, and compare their performance for varying input sizes. |
| 5IT4-23.2 | Apply graph algorithms such as Topological Sort, Warshall’s, BFS, and DFS to determine connectivity and reachability in graphs. |
| 5IT4-23.3 | Implement optimization algorithms including 0/1 Knapsack using Dynamic Programming and Greedy strategies. |
| 5IT4-23.4 | Examine shortest path and spanning tree algorithms such as Dijkstra’s, Kruskal’s, Prim’s, and Floyd’s with respect to efficiency. |
| 5IT4-23.5 | Evaluate the performance and correctness of backtracking solutions for constraint satisfaction problems such as the N-Queens problem. |
Mapping of COs and POs
| COs | PO1 | PO2 | PO3 | PO4 | PO5 | PO6 | PO7 | PO8 | PO9 | PO10 | PO11 | PSO1 | PSO2 | PSO3 |
| CO1 |
3 |
2 | - | 2 | 3 | - | - | - | - | - | 2 | 3 | 2 | - |
| CO2 | 3 | 3 | 2 | 2 | 3 | - | - | - | - | - | 2 | 3 | 2 | - |
| CO3 | 3 | 3 | 2 | 3 | 3 | - | - | - | - | - | 2 | 3 | 3 | - |
| CO4 | 3 | 3 | 2 | 3 | 3 | - | - | - | - | - | 2 | 3 | 3 | - |
| CO5 | 3 | 3 | 2 | 3 | 3 | - | - | - | - | - | 2 | 3 | 2 | 1 |
| Avg | 3 | 3 | 2 | 3 | 3 | - | - | - | - | - | 2 | 3 | 3 | 1 |
