Back

Basic Details:

  • Course Code: EM 503
  • Credits: 2
  • Pre-requisites: None
  • Compulsory/Optional: Optional

Couse Content:

Brief history, Representation of graphs, Connectivity, Traversability, Planarity

Spanning trees, Tree searching, Binary trees, Arborescences

Partitioning and covering, Colouring of vertices and edges, Maximum matching problem

Single-source shortest paths, All-pairs shortest paths, Maximal flows, Minimum cost flows, Minimum spanning trees

Selected applications from various fields in Engineering.

Time Allocation (Hours):

Lectures
0
Tutorials
0

Assessment:

In - course:

Continuous Assessment
40%

End-semester:

End of Semester Examination
60%