|
CO
|
COGNITIVE ABILITIES
|
COURSE OUTCOMES
|
|---|---|---|
|
CO1
|
REMEMBERING
|
Recall and define the basic concepts of rings, commutative
rings, rings with unity, and finite rings; construct their
operation tables and verify ring axioms.
|
|
CO2
|
UNDERSTANDING
|
Explain and interpret the structures of ideals, integral
domains, quotient rings, finite and extension fields, and
distinguish between maximal and prime ideals.
|
|
CO3
|
APPLYING
|
Apply the Euclidean algorithm to find the GCD of two
polynomials; test irreducibility and perform factorization;
determine rational zeros over various fields.
|
|
CO4
|
ANALYSING
|
Analyze graph connectivity using adjacency matrices and
fusion algorithms; determine shortest paths, minimum
spanning trees, and Euler tours using Kruskal’s, Prim’s,
Dijkstra’s, Breadth-First, Backtracking, and Fleury’s
algorithms.
|
|
CO5
|
EVALUATING
|
Evaluate and test the properties of metric spaces,
compactness, and connectedness; assess uniform
convergence of sequences and series using appropriate
theorems and convergence tests.
|
|
CO6
|
CREATING
|
Develop and construct new quotient rings, operation tables,
and examples of finite fields and extension fields; design
algorithms and proofs involving uniform convergence and
power series.
|
