Data Structures and Analysis
Welcome to the course webpage for the Winter 2008 term of CSC263H/B63H, Data Structures and Analysis.The instructors (Andrew, Anna and Jen) are collaborating on the course in order to provide you with a uniform offering across campuses. The navigation menu to the left contains links to general information, as well as campus-specific details.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.
The course is delivered through 2 lecture hours and a tutorial each week.
Contact Information
| Instructor | Office | |
|---|---|---|
| Anna Bretscher (UTSC) | bretscher [at] utsc.utoronto.ca | H418 |
| Jennifer Campbell (St. George) | campbell [at] cdf.toronto.edu | BA4238 | Andrew Petersen (UTM) | andrew.petersen [at] utoronto.ca | SB2036E |