UW Logo

CS 466/666, Fall 2004

Advanced Algorithms



Home People Policies Resources Schedule Assignments Project

Course announcements will appear on this page. You are responsible for reading it regularly. This may require reloading the file on occasion to ensure you are not reading an older, cached version of the file.

Spring 04 course webpage

Announcements:

Dec. 7 The marks for the first three assignments and the midterm are posted on Naomi's door. Please check yours to make sure they have been recorded correctly. If they have not, please see Peter.

Dec. 3

Class on Monday is cancelled.

Projects are due at my office hours on Monday (1-2) or earlier (under my door if I'm not there). They should NOT be put in the handin box.

Dec. 2 The TAs will hold the following office hours next week:

Alex: Wednesday, 2-3

Peter: Tuesday, 2-3

Dec. 1: Naomi Nishimura will hold the following office hours next week:

Monday, December 6 1:00-2:00

Wednesday, December 8 10:00-11:00

Thursday, December 9 1:00-2:00

Nov. 26: The last question on A3 can be solved for bonus marks, up to a total of 8 marks as part of the assignment portion of the final mark.

Bonus marks can only help you. Adjustments will be made for marks before bonus marks are added, so how many people get bonus marks will have no effect on the pre-bonus average.

Nov. 16: As announced in class, since it is doubtful that lectures will proceed quickly enough for you to be able to complete the last question on A4 in time to hand it in, please view it merely as a practice question to use for preparation for the final exam.

Nov. 10: Please read the message posted in the newsgroup about the possibility of remarking Question 2(b) on the second assignment.

Oct. 31: Here is a link to the message posted on the newsgroup about the use of office hours.

Oct. 31: All three of us will hold extra office hours before the midterm:

Naomi: Tuesday, 10 - 11 AM

Alex: Monday, 3 - 4 PM

Peter: Tuesday 3 - 4 PM

These are IN ADDITION to any regular office hours.

Oct. 22: Here are answers to questions frequently heard at office hours today:

An upper bound is proved by finding an algorithm and determining its worst-case running time. This is supposed to be the easy part!

For Question 5, do not use order notation. You upper and lower bounds should be identical. Thus, n/2 and n/2 are matching bounds, but n/2 and n/2 - 1 are not. Hint: there might be more than one case to consider in both upper and lower bounds.

Oct. 21: I have delivered to your mailboxes comments on the project proposals along with the proposals themselves, that is, if you are a CS graduate student and have a mailbox that I can find. I will bring the remaining proposals to class on Friday.

If you are an undergraduate, please remember that you must obtain permission from me to take this option. This can be in writing or orally, but must take plce before the next milestone. --Naomi

Oct. 18: Naomi Nishimura will hold an extra office hour on Tuesday, Oct. 26, at 8:30-9:30 AM.

Peter Olsar will hold his office hours on Wednesdays from 3-4 PM.