CMPUT204, Fall 2007, Section A2/EA2

Main page

This is the course web page for CMPUT204, Fall 2007, Section A2/EA2. The official webpage for both sections can be found Here.
Please use the links below and in the menu bar to the left to find the information you need about this course. If you do not see a Menu on the left, then your browser does not support frames. In that case, click here for the menu.


Contact Information

Generally, the best way to contact me is by e-mail. I try to answer e-mails within 1-2 working days. Often it is within the same day but if you send me an e-mail on Friday or Saturday, don't expect to get a quick response.

Course Information Sheet and References

Here is the course information sheet in Postscript format and in PDF format.
(Download a free Postscript viewer.)

Text Book
The course text book is:
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein.
Introduction to Algorithms (Second Edition). McGraw Hill. 2001.

Additional References ``Algorithm Design'' by J. Kleinberg and E. Tardos. Addision Wesley, 2005.

Grading Scheme

Important dates

Date Event
Wed, Sep 5
First lecture (Assignment 1 is posted)
Wed, Sep 26 Assignment 1 due (Assignment 2 is posted)
Mon, Oct 8
Thanksgiving (no lecture)
Wed, Oct 10 Assignment 2 due
Wed, Oct 17 Term test 1 (Assignment 3 is posted)
Wed, Oct 31
Assignment 3 due (Assignment 4 posted)
Fri, Nov 12 Remembrance day (no lecture)
Wed, Nov 14 Assignment 4 due
Wed, Nov 21 Term test 2 (Assignment 5 posted)
Wed, Dec 5
Assignment 5 due, Last lecture

Course outline

Topics to be covered and relevant readings from the text:

Basics (1,2,3)
- Getting started
- Analyzing algorithms
- Growth of functions

Recurrences (4.1-4.3)
- Methods
- Master Theorem

Sorting Algorithms (6, 7, 8.1)
- Heaps and Heapsort
- Priority Queues
- Quicksort and analysis
- Lower bound on sorting

Design Techniques (16.1-16.2, 15.1-15.4)
- Greedy method
- Divide-and-Conquer
- Dynamic Programming

Graphs (22, 23, 24.2-24.3, 25)
- Basics
- Traversals (DFS/BFS)
- Minimum spanning tree
- Shortest paths

Additional Topics (time permitting)

Course newsgroup

General Policies