Informatics Olympiad Program 2017-18

I was a co-instructor of this course from July 2017 to October 2017.

Lecture Hours

Monday (9.30 PM - 10.30 PM)

References

• Bona - A Walk Through Combinatorics
• Brualdi - Introductory Combinatorics
• Kleinberg, Tardos - Algorithm Design
• Even - Graph Algorithms

Teaching Assistant

Swarnabja Bhaumik

Syllabus

• Graph Theory: Basics, Eulerian/Hamiltonian paths/cycles, connectedness, trees, spanning trees - spanning tree algorithms - DFS & BFS, traversals - Dijkstra's algorithm, minimal spanning trees - Kruskal's algorithm & Prim's algorithm, bipartite graphs.

Italics => completed

Bold => coming soon