CSC263 - Fall 2008

CSC263 - Fall 2008

CSC263 - Data Structures & Analysis - Fall 2008

	Instructor:	Iannis Tourlakis
	Office hours:	T 14-16 (SF 2304D, 416-946-7977).
	Lectures:	TR 10, MP 137
	Tutorials:	R11
	Tutors:	Robert Danek
		Natan Dubitski
		Gertruda Grolinger
		Vladimir Yanovsky

Useful information

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.

Recommended readings

(Weeks 12 & 13) Chapter 1.5 in Algorithm Design or Chapters 17 in Introduction to Algorithms.
(Weeks 10 & 11) Chapters 6.1-6.3 and 7.3 in Algorithm Design and Chapters 22.1-3 and 23 in Introduction to Algorithms.
(Week 9) Chapter 4.2 in Algorithm Design and Chapters 21.1-3 in Introduction to Algorithms.
(Weeks 7 & 8) Chapter 2.4 in Algorithm Design.
(Weeks 5 & 6) Chapter 2.5 in Algorithm Design and Chapters 11.1-11.4 in Introduction to Algorithms.
(Week 4) Chapter 14 in Introduction to Algorithms (our textbook Algorithm Design doesn't have a specific section on augmenting data structures).
(Weeks 2 & 3) Chapters 3.1 and 3.3 in Algorithm Design and Chapters 10, 12 and 13 in Introduction to Algorithms.

Assignments

Assignment 1 (due Oct 2).
Assignment 2 (due Oct 14).
Assignment 3 (due Nov 6).
Assignment 4 (due Nov 18).
Assignment 5 (due Dec 4).

Announcements

Date	Announcement(s)
21/11/08	Assignment 5 (due Dec 4) is out!
14/11/08	2 day extension for Assignment 4: Assignment 4 can be handed in at the BEGINNING of class Thursday, Nov 20. HOWEVER, no late assignments will be accepted.
12/11/08	Correction to Assignment 4: In question 1c, the upper bound on tree height should be (log₂n)+1 not log₂n.
6/11/08	Assignment 4 (due Nov 18th) is out!
24/10/08	IMPORTANT: Next week tutorial will be held on Tuesday (Oct 28th) and there will be a 2 hour class on Thursday (Oct 30th). Tutorial division for Tuesday: Last names A-F: go to MP 137 Last names G-Z: go to BA 3004
24/10/08	Assignment 3 (due Nov 6th) is out!
24/10/08	Next week's office hours will be held Wednesday (Oct 29th) 12:00-1:30pm.
16/10/08	Extra office hours (in addition to regular Tuesday office hours) Wed Oct 22nd 11-1pm.
16/10/08	REMINDER: Midterm this Thursday Oct 23rd in class (MP137) from 10:10-12:00. I'll post midterm topics on the bulletin board over the next couple of days.
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.