Welcome to CPSC 420!!
Please bookmark this page and look here -- on a regular basis -- for course announcements, including scheduling changes and assignment clarifications.
[February 14] Please note that office hours, and TA consultation sessions, will not be held over the reading break. They will resume, as usual, during the week of February 23.
[February 14] Assignment 5 has now been posted...due on February 26 (after the reading break).
[February 03] Reminder: Midterm I will be held on Wednesday February 04, from 5:30 - 7:00 pm, in DMPT 301. You are free to bring one (standard-sized) sheet (two sides) of handwritten notes to consult during the exam. (Notes must be handed in together with your exam paper.) In anticipation of the exam, there will be a question/answer session on Tuesday February 03, from 5:30 - 7:00 pm, in DMPT 301.
[January 13] Please note that the url for EricksonsNotes given in the Course Information Handout had (it has been corrected) a small typo. It should read http://www.cs.uiuc.edu/~jeffe/teaching/algorithms/
Instructor and Teaching Assistants
The course instructor is David Kirkpatrick. Tentative office hours (ICICS/CS X839): Tuesday 16:00-17:00, Wednesday 09:00-10:00 and Friday 08:30-09:30, or by appointment. In addition, there will be a Group Office Hour in ICICS/CS 146, on Wednesdays from 15:30-17:00.
Office hours for the course teaching assistants, Alireza Zakeri-Hosseinabadi and Ehsan Kermani, will be held in the Demco Learning Centre (Table 3). These have been tentatively scheduled as follows: Monday 13:30-15:30 (Ehsan) and Tuesday 11:30-13:30 (Alireza).
Lectures will be held in DMP Room 301, on Tuesday and Thursday, 9:30 to 10:50am.
Homework Assignments and Examinations
A total of eight Homework assignments are planned, with due dates as indicated to the left.
There will also be THREE TERM EXAMINATIONS (scheduled for Wednesdays, February 04, March 04, and March 25, from 17:30-19:00, DMPT 301), but NO FINAL EXAMINATION.
Course Information and Lecture Outline
You can download
It includes information on course objectives, prerequisites, lecture and
examination and assignment policies, plagiarism and collaboration policy,
and grading scheme,
as well as a tentative lecture outline.