|
CO
|
COGNITIVE ABILITIES
|
COURSE OUTCOMES
|
|---|---|---|
|
CO1
|
REMEMBERING
|
Recall and define the basic properties of graphs; identify
and compute order, size, degree, and completeness of given
graphs.
|
|
CO2
|
UNDERSTANDING
|
Explain and construct incidence and adjacency matrices;
interpret walks, paths, and cycles to understand the
structure of graphs.
|
|
CO3
|
APPLYING
|
Apply Breadth First Search (BFS), Backtracking, and
Dijkstra’s Algorithm to determine the shortest paths
between vertices in connected and weighted graphs.
|
|
CO4
|
ANALYSING
|
Analyze connectivity of graphs using adjacency matrices and
the fusion algorithm; decompose graphs to identify
components and relationships among vertices.
|
|
CO5
|
EVALUATING
|
Evaluate Euler circuits using Fleury’s algorithm; assess the
correctness and optimality of minimal spanning trees
obtained through Prim’s and Kruskal’s algorithms.
|
|
CO6
|
CREATING
|
Design and implement algorithms to model and solve real-
world problems using graph representations; construct
efficient graph-based solutions for network and
optimization problems.
|
