Course Outcomes
3CS4-05.1 |
Design applications using stacks and various types of queues |
3CS4-05.2 |
Analyze and apply operations of linked lists and demonstrate their applications |
3CS4-05.3 |
Evaluate the computational efficiency of the principal algorithms for sorting, searching, and hashing. |
3CS4-05.4 |
Demonstrate operations on trees and discuss various types of Trees. |
3CS4-05.5 |
Identify, model, solve and develop algorithms for real-life problems like shortest path and MST using graph theory. |
Mapping of COs and POs
COs |
PO1 |
PO2 |
PO3 |
PO4 |
PO5 |
PO6 |
PO7 |
PO8 |
PO9 |
PO10 |
PO11 |
PO12 |
PSO1 |
PSO2 |
PSO3 |
CO1 |
- |
2 |
2 |
1 |
3 |
- |
- |
- |
- |
2 |
- |
- |
3 |
2 |
- |
CO2 |
- |
2 |
2 |
1 |
3 |
- |
- |
- |
- |
- |
- |
- |
3 |
2 |
- |
CO3 |
2 |
2 |
2 |
2 |
3 |
- |
3 |
2 |
2 |
2 |
2 |
2 |
3 |
3 |
- |
CO4 |
2 |
2 |
2 |
3 |
3 |
- |
3 |
2 |
2 |
2 |
2 |
2 |
3 |
3 |
- |
CO5 |
2 |
2 |
2 |
2 |
3 |
- |
3 |
2 |
2 |
2 |
2 |
2 |
3 |
3 |
- |
Avg |
2 |
2 |
2 |
1.8 |
3 |
- |
3 |
2 |
2 |
2 |
2 |
2 |
3 |
2.6 |
- |