|
|
Course Outcomes |
|
ECUP323.1 |
Implement the abstract data type and reusability of a particular data structure. |
|
ECUP323.2 |
Implement linear data structures such as stacks, queues using array and linked list. |
|
ECUP323.3 |
Understand and implements non-linear data structures such as trees, graphs. |
|
ECUP323.4 |
Implement various kinds of searching, sorting and traversal techniques and know when to choose which technique. |
|
ECUP323.5 |
Decide a suitable data structure and algorithm to solve a real world problem. |
COs-POs/PSOs Mapping
|
COs |
PO1 |
PO2 |
PO3 |
PO4 |
PO5 |
PO6 |
PO7 |
PO8 |
PO9 |
PO10 |
PO11 |
PSO1 |
PSO2 |
| ECUP323.1 | 3 | 3 | - | 2 | 3 | - | - | - | - | - | 3 | - | 2 |
| ECUP323.1 | 3 | 3 | - | 2 | 3 | - | - | - | - | - | 3 | - | 2 |
| ECUP323.1 | 3 | 3 | - | 2 | 3 | - | - | - | - | - | 3 | - | 2 |
| ECUP323.1 | 3 | 3 | - | 2 | 3 | - | - | - | - | 3 | - | 2 | |
| ECUP323.1 | 3 | 3 | - | 2 | 3 | - | - | - | - | - | 3 | - | 2 |
| ECUP323 | 3 | 3 | - | 2 | 3 | - | - | - | - | - | 3 | - | 2 |
