CSC 263H1F: Data Structures and Analysis
Fall 2007

Course Information

Instructor: Richard Krueger

email:

Lectures: Tuesdays and Thursdays, 10am-11am in LM 158

Tutorials: Thursdays, 11am-12noon in (tutorials begin the first week!)

BA 3008     (last names A to J)     TA: Nilgun

BA 3012     (last names K to Z)     TA: Guoyu

Teaching Assistants: Nilgun Donmez, Sebastian Raaphorst, Vladimir Yanovsky, Guoyu Wang

Office hours: during exam period as posted on Announcements page.

Bulletin board: in the Computer Science Community

Previous offerings of this course: Summer 2007

Course Description

Algorithm analysis: worst-case, average-case, and amortized complexity. Standard abstract data types, such as graphs, dictionaries, priority queues, and disjoint sets. A variety of data structures for implementing these abstract data types, such as balanced search trees, hashing, heaps, and disjoint forests. Design, implementation, and comparison of data structures. Introduction to lower bounds.
Official calendar description and restrictions

Course Links

• Course information sheet in postscript or PDF
• Announcements (updated periodically, please read regularly)
• Course outline
• Lecture schedule, readings and notes
• Assignments and cover sheet
• Test information
• Marks (via CDF)
• Course policies (including waiver requests)
• Remarking instructions and form
• Requests for special consideration (cases of illness, emergencies, etc.)

Other UofT links

• CS Undergraduate Announcements. Keep up to date with CS happenings and deadlines.
• Computer Science Student Union (CSSU). Work for a better CS undergrad experience.
• Department of Computer Science. All the info on Computer Science programs and courses.
• Help with writing in English. Write clearly (proofs too!).
• Accessibility services. Overcome obstacles to learning.
• Student services. Find health, housing, counselling.
• Faculty of Arts and Science. Verify exam schedules and such.