KCA253:DATA STRUCTURES & ANALYSIS OF ALGORITHMS LAB
Course Outcomes:
|
Course Outcome (CO)
|
At the end of course , the student will be able to
|
Bloom’s Level
|
| CO1 |
Write and execute programs to implement various searching and sorting
algorithms. |
K 3
|
| CO2 |
Write and execute programs to implement various operations on two-dimensional
arrays. |
K 3
|
| CO3 |
Implement various operations of Stacks and Queues using both arrays and linked
lists data structures. |
K 3
|
| CO4 |
Implement graph algorithm to solve the problem of minimum spanning tree |
K 3
|
Mapping Matrix of CO's and PO's
| CO |
PO1 |
PO2 |
PO3 |
PO4 |
PO5 |
PO6 |
PO7 |
PO8 |
PO9 |
PO10 |
PO11 |
PO12 |
|
CO1
|
3 |
2 |
|
|
2 |
1 |
1 |
|
|
|
|
|
|
CO2
|
|
3 |
2 |
1 |
2 |
1 |
|
|
|
|
|
|
|
CO3
|
1 |
1 |
3 |
|
1 |
|
1 |
|
|
|
|
|
|
CO4
|
|
2 |
2 |
3 |
2 |
|
1 |
|
|
|
|
|
|
CO5
|
1 |
|
2 |
1 |
1 |
1 |
|
|
|
|
|
|
