Please let us know if you have any trouble downloading, displaying, or printing anything on the course web site!
The project was assigned on April 20 and is due on April 30. Submit your code by email.
Homework 5, assigned April 14, and due April 28, consists of the following problems from the textbook: 6.13, 10.5, 10.11, 12.3, and 12.9 (include pseudocode here). Remember to prove correctness and your worst-case bounds (running time or size).
The final exam has been scheduled for Wednesday, May 6, 2-4. The exam room is likely to be SB 201 or SB 204. Changes, if any, will be announced by email.
The final version of the syllabus is available in PDF here.
Homework 1, assigned Jan. 27, and due Feb. 10, consists of the following problems from the textbook: 1.4, 1.8, 2.1, 2.5, and 2.12.
The academic honesty handout and the pledge you are asked to sign and return are here.
The second homework was assigned Feb. 10. It is due on Feb. 27. You can download it in PDF version 1.1. (some corrections).
Homework 3, assigned Feb. 24, and due March 12, consists of the following problems from the textbook: 4.15, 4.16, 5.11, 5.13 a) and b), and 6.7. For all problems, remember to argue the correctness of your algorithm and compute the running time (worst-case, unless the problem statement explicitly allows expected running time).
Homework 4, assigned March 26, and due April 9, consists of the following problems from the textbook: 7.5, 8.4, 8.7, 9.8, and 9.16. For problems 8.4, 8.7, and 9.16 remember to argue the correctness of your algorithm and compute the running time (worst-case, unless the problem statement explicitly allows expected running time).
The class on Thursday April 23 will be held by PhD student Kan Qiao, who will present a geometric data structure and its use in a greedy algorithm from his own research.