Goals of the Lecture of August 30 2005

1. The students will feel comfortable with the concepts of asymptotic
time and space complexity.

2. The students will understand why issues of time and space complexity
are important in programming.

3. The students will remember the precise definitions of the asymptotic
function classes, "big O", "Omega", and "Theta".

4. The students will be able to analyze simple algorithms and correctly
determine their asymptotic time and space complexities.

5. The students will be learn (but not prove) that there are programs that
are extremely hard to analyze, and that there are others which are impossible
to analyze.  The students will also learn (but not prove) that there are
problems which cannot be solved by any algorithm.