BCS301: DATA STRUCTURE
Course Outcomes:
| CO |
At the end of course , the student will be able to
understand:
|
Bloom’s Level
|
|
CO1
|
Describe how arrays, linked lists, stacks, queues, trees, and graphs are
represented in memory, used by the
algorithms and their common applications. |
K1, K2
|
|
CO2
|
Discuss the computational efficiency of the sorting and searching algorithms.
|
K2
|
|
CO3
|
Implementation of Trees and Graphs and perform various operations on these data
structure. |
K3
|
|
CO4
|
Understanding the concept of recursion, application of recursion and its
implementation and removal of
recursion. |
K4
|
|
CO5
|
Identify the alternative implementations of data structures with respect to its
performance to solve a real
world problem. |
K5, K6
|
Mapping Matrix of CO's and PO's
| 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 |
- |
