Introduction to Algorithms and Data Structures, Spring 2005, Episode 12

Lecture and discussion of the E2004 exam set, April 29

Subject: Shortest paths in DAGs. Dijkstra's algorithm. Last semestes exam set.

Text: CLRS 24.2-24.3.

Prerequisites : Directed and undirected graphs. Paths in graphs. IADS course material.

Comments : To best approximate the exam experience, it makes sense not to look at the exam set prior to the discussion. Of course, we cannot prohibit you from doing so if you think it better serves your ends. It does make sense to study other older exam sets.

Time : Friday, April 29, 9:00–12:00 (3×45min), Room 2A12

Tutorial : 13:00–16:00 (3×45min), Room 3A14