CSC 263H1Y: Data Structures and Analysis
Summer 2007

Course Information

Instructor: Richard Krueger

email:

Lectures: Tuesdays, 6pm-8pm in BA 1220

Tutorials: Tuesdays, 8pm-9pm in BA 1220 (tutorials begin the first week!)

Teaching Assistants: Emad Shenouda, Nilgun Donmez, Stratis Ioannidis

Office hours: Thursdays 3-5pm in BA 4261, or by appointment

Bulletin board: in the Computer Science Community

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

This week's reading assignment: none (good luck on your other exams, and have a great rest of the summer!)

Course Links

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

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.