|
|
Course Outcomes |
|
ECUL304.1 |
Analyze algorithms and execution time complexities, and apply asymptotic notations to determine time and space complexities of simple non-recursive algorithms. |
|
ECUL304.2 |
Apply array storage, expression evaluation using stacks, and recursion, mastering data structure manipulation and algorithmic problem-solving. |
|
ECUL304.3 |
Implement and compare linear linked lists, stacks, queues, and dequeues, and utilize linked lists for polynomial representation and manipulation. |
|
ECUL304.4 |
Demonstrate operations on trees and discuss various types of Trees. |
|
ECUL304.5 |
Analyze and implement graph algorithms for traversal, finding connected components, spanning trees, and shortest paths, alongside sorting and searching algorithms. |
COs-POs/PSOs Mapping
|
COs |
PO1 |
PO2 |
PO3 |
PO4 |
PO5 |
PO6 |
PO7 |
PO8 |
PO9 |
PO10 |
PO11 |
PSO1 |
PSO2
|
| ECUL304.1 | 3 | 3 | 2 | - | - | - | - | - | - | - | 3 | - | - |
| ECUL304.2 | 3 | 3 | 2 | - | - | - | - | - | - | - | 3 | - | - |
| ECUL304.3 | 3 | 3 | 2 | - | - | - | - | - | - | - | 3 | - | - |
| ECUL304.4 | 3 | 3 | 2 | - | - | - | - | - | - | - | 3 | - | - |
| ECUL304.5 | 3 | 3 | 2 | - | - | - | - | - | - | - | 3 | - | - |
| ECUL304 | 3 | 3 | 2 | - | - | - | - | - | - | - | 3 | - | - |
