CMPUT 204     Algorithms I     Winter 2009

• The first of two courses on algorithm design and analysis, with emphasis on fundamentals of searching, sorting, and graph algorithms. Examples include divide and conquer, dynamic programming, greedy methods, backtracking, and local search methods, together with analysis techniques to estimate program efficiency.


• Prerequisites: CMPUT 115 or 175, CMPUT 272; MATH 113, 114, or 117.


• Time: MWF 10:00-10:50am
• Place: CSC B10


• Professor: Lorna Stewart, stewart@cs.ualberta.ca, 304 Athabasca Hall, Office Hours: MW 11:00-12:00


• Textbook: Cormen, Leiserson, Rivest, and Stein. Introduction to Algorithms, Second edition, 2001.
  Chapters to be covered: 1, 2, 3, 4, 6, 7, 8, 15, 16, 22, 23, 24, 25 (possibly others if time permits)


• Grading:
  5 Assignments: 30%
  2 Midterms: 30%
  Final exam: 40%


• Moodle Course Site