|
CO
|
COGNITIVE ABILITIES
|
COURSE OUTCOMES
|
|---|---|---|
|
CO1
|
REMEMBERING
|
Recall and define the fundamental concepts of graph theory
such as order, size, degree, completeness, and
connectedness of graphs.
|
|
CO2
|
UNDERSTANDING
|
Explain the construction and interpretation of adjacency
and incidence matrices, and identify walks, paths, and
cycles in given graphs.
|
|
CO3
|
APPLYING
|
Apply algorithms such as Breadth First Search (BFS),
Backtracking, and Dijkstra’s algorithm to find shortest paths
in connected and weighted graphs.
|
|
CO4
|
ANALYSING
|
Analyze graph connectivity using adjacency matrices and
fusion algorithms; differentiate between connected and
disconnected graphs based on algorithmic results.
|
|
CO5
|
EVALUATING
|
Evaluate the correctness and efficiency of graph algorithms
such as Prim’s, Kruskal’s, and Fleury’s, and determine
minimal spanning trees or Euler tours.
|
|
CO6
|
CREATING
|
Design and implement new graph-based models or
algorithms to solve real-world network and optimization
problems, demonstrating innovation and critical thinking.
|
