Course Outcomes
3IT4-05.1 |
Apply stack and its operations on various applications. |
3IT4-05.2 |
Apply the concept of linked list and queues on different applications. |
3IT4-05.3 |
Analyze the computational efficiency of the principal algorithms for sorting, searching, and hashing. |
3IT4-05.4 |
Understand the concept of binary trees and its operations. |
3IT4-05.5 |
Implement algorithms for real-time engineering applications like shortest path and MST using Graph concept. |
Mapping of COs and POs
COs |
PO1 |
PO2 |
PO3 |
PO4 |
PO5 |
PO6 |
PO7 |
PO8 |
PO9 |
PO10 |
PO11 |
PO12 |
PSO1 |
PSO2 |
PSO3 |
CO1 |
2 |
2 |
2 |
2 |
1 |
2 |
- |
- |
- |
1 |
1 |
1 |
3 |
- |
- |
CO2 |
2 |
1 |
2 |
2 |
2 |
3 |
- |
- |
- |
1 |
1 |
1 |
3 |
- |
- |
CO3 |
2 |
2 |
2 |
1 |
2 |
2 |
- |
- |
3 |
1 |
1 |
1 |
3 |
- |
- |
CO4 |
3 |
3 |
2 |
1 |
2 |
2 |
- |
- |
3 |
1 |
1 |
- |
3 |
- |
- |
CO5 |
3 |
3 |
2 |
1 |
2 |
2 |
- |
- |
3 |
1 |
1 |
1 |
3 |
- |
- |
Avg |
3 |
3 |
1 |
2 |
2 |
3 |
- |
- |
3 |
1 |
1 |
1 |
3 |
- |
- |