KCA205: DATA STRUCTURES & ANALYSIS OF ALGORITHMS
Course Outcomes:
|
Course Outcome (CO)
|
At the end of course , the student will be able to
|
Bloom’s Level
|
| CO 1 |
Explain the concept of data structure, abstract data types, algorithms, analysis
of algorithms and basic data organization schemes such as arrays and linked
lists. |
K 2
|
| CO 2 |
Describe the applications of stacks and queues and implement various operations
on them using arrays and linked lists. |
K 3
|
| CO 3 |
Describe the properties of graphs and trees and implement various operations
such as searching and traversal on them. |
K 3
|
| CO 4 |
Compare incremental and divide-and-conquer approaches of designing algorithms
for problems such as sorting and searching. |
K 4
|
| CO 5 |
Apply and analyze various design approaches such as Divide-and-Conquer, greedy
and dynamic for problem solving . |
K 4
|
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 |
|
|
|
|
|
|
