We will basically follow the syllabus sketched on page xx of the text book.

Week 1:

Preparation for the Jar Stress Testing Homework: Chapter 2, exercise 8.
1.2 Five Representative Problems
SCG 

Week 2:
Basics of Algorithm Analysis
Homework 2: Jar stress testing with algorithm exchange

Week 3
Chapter 3: Graphs

Homework 3:
Topological sorting implementation

Week 4:
Chapter 4:
Greedy Algorithms

following the text book chapters with some exceptions
to be announced in class.

================
The grade will be based on a 
open-book midterm (20%),
open-book final (30%),
homework solutions (30%) and class participation. 

You should actively participate in class
with questions and answers. Please also
reply on the mailing list when you know 
an answer.