University of Toronto -- Department of Computer Science
St. George Campus -- Winter Session 2004

CSC 263H: "Data Structures and Analysis"

Lecture and Tutorial Summaries

Outline of lecture topics.
Lecture summaries/outlines.
Tutorial summaries/outlines.

The schedule of lectures, tutorials, and office hours is available on the main page.

Outline of lecture topics

The following topics will be covered in this course, in the order listed. For each topic, we have indicated the approximate number of weeks required to cover each topic as well as a list of the relevant sections in the textbook.

Complexity analysis [2 weeks].
(sections 1.1, 1.2, 1.3, 1.4, 1.6)
Balanced search trees [2 weeks].
(sections 3.1, 3.3)
Hashing [2 weeks].
(section 2.5)
Amortized analysis [1.5 weeks].
(section 1.5)
Heaps and priority queues, disjoint sets [3.5 weeks].
(sections 2.4, 4.2)
Graphs and graph traversal [2 weeks].
(section 6.3)

Lecture summaries/outlines

All summaries/outlines are plain text (ASCII) files, unless otherwise indicated.

Week 1
And here is an addendum to the lecture notes (from the Scarborough instructor).
Week 2 Updated on Thu 15 Jan!
Week 3
Week 4
Week 5 Updated on Thu 5 Feb!
And here is an addendum to the lecture notes.
Week 6
Week 7 Tiny update on Tue 24 Feb...
Week 8

Tiny update on Wed 21 April ...

Week 9
Week 10 Here is an addendum to the lecture notes, for the St. George campus, with more details about some of the data structures for disjoint sets.
Week 11 Here is an addendum to the lecture notes, for the St. George campus, with more details about some of the data structures for disjoint sets.
Week 12: see Week 11
Week 13: review

Tutorial summaries/outlines