|
| Course Content |
Time Allocated |
| L |
T |
P |
A |
Introduction
- Brief history, Representation of graphs, Connectivity, Traversibility, Planarity
|
3 |
|
|
|
Trees
- Spanning trees, Tree searching, Binary trees, Arborescences
|
4 |
1 |
|
|
Graph Colouring and Matching
- Partitioning and covering, Colouring of vertices and edges, Maximum matching problem
|
5 |
1 |
|
|
Graph Algorithms
- Single-source shortest paths, All-pairs shortest paths, Maximal flows, Minimum cost flows, Minimum spanning trees
|
8 |
3 |
|
|
Applications
- Selected applications from various fields in Engineering
|
4 |
1 |
|
|
| Total = 24 + 6 = 30 |
24 |
6 |
|
|
| |
| Assessment |
Percentage Mark |
| Continuous Assessment |
|
40 |
| Assignment |
40 |
|
| Course work |
|
|
| Written Examinations |
|
60 |
| Mid-Semester |
|
|
| End of Semester |
60 |
|
|
Notation Used :
L - Lectures
T - Tutorials
P - Practical works
A - Assignments |