CSC263 - Fall 2008

CSC263 - Data Structures & Analysis - Fall 2008

Course Information Sheet
Course Bulletin board
Textbook: Goodrich and Tamassia, Algorithm Design, Wiley (required).
We will also use the following text which is available free on-line to U of T students through the library website:
Cormen, Leiserson, Rivest and Stein, Introduction to Algorithms, second edition, McGraw-Hill.
For information on our sister course CSC265 (Enriched Data Structures) please consult Blackboard.

Date	Announcement(s)
2/10/08	Assignment 2 (due Oct 14th) is out!
2/10/08	Please submit late assignments (by 10:15am Oct 3rd) at my office (slide it under the door if I'm not there).
30/9/08	Simplification for Question 3 on Assignment 1: You may assume keys are distinct.
30/9/08	Extra office hours this week Wednesday (Oct 1st) 12:00-1:30pm.
23/9/08	This week's office hours will be held Wednesday (Sept 24th) 2-4pm.
18/9/08	Clarification for Question 1 on Assignment 1: The value you want to minimize is the expected value of the following sum: the time job A finishes + the time job B finishes. (Some have interpreted the question as saying you want to minimize the time when both jobs have completed which is not what was intended).
17/9/08	Tutorial division: Last names beginning with A-C: BA3116 Last names beginning with D-N: BA3012 Last names beginning with O-Z: MP137
16/9/08	For those considering switching to CSC265 and wanting to get a taste of CSC265, here is a link to their first assignment.
15/9/08	Assignment 1 (due Oct 2nd) is now available.
9/9/08	Tutorial this Thursday (11/9/08) to be held in MP 137. Class will be split into three tutorials starting next week.