NEW: For a prettier blog interface, see the Wordpress version!
Announcements
REMINDER: We will have classes on 2004.06.30 . We'll go over loop invariants again.
Hall of Fame
Current B+ / A Standing
| de Vera, Jerome | A |
| dela Cruz, Peter Ben | A |
| Gan, Garett | A |
| Hernandez, Donna | A |
| Ong, Jan Margaret | A |
Notes
Chapter 1: Introduction
Correctness
- How can we tell if one algorithm will be faster than another?
Correctness (PDF) - Correctness (SXI) - Correctness (PPT) - Correctness (Handouts, PDF)
Efficiency
Efficiency and algorithm analysis (PDF) - Efficiency and algorithm analysis (SXI) - Efficiency and algorithm analysis (PPT) - Efficiency and algorithm analysis (Handouts, PDF)
- Algorithm analysis REVIEW (PDF) - Algorithm analysis REVIEW (SXI)
- Quiz given on 2004.06.21
Introduction
Introduction (PDF) - Introduction (SXI) - Introduction (PPT) - Introduction (Handouts, PDF)
- What will we take up?
- Design and implementation goals
- Pseudocode
All slides
- How can we tell if an algorithm will work?
All slides (PDF) - All slides (SXI) - All slides (PPT) - All slides (Handouts, PDF)
- For Eric's class
2004.06.14: The first day of classes
Welcome (PDF) - Welcome (SXI) - Welcome (PPT)
- Important class notices
- Overview of the course
Syllabus (PDF) - Syllabus (SXW) - Syllabus (DOC)
I'd love to hear about any questions, comments, suggestions or links that you might have. Your comments will not be posted on this website immediately, but will be e-mailed to me first. You can use this form to get in touch with me, or e-mail me at sacha@sachachua.com .
