Overview
Welcome to the course webpage for the fall 2015 term of CSC263H1, Data Structures and Analysis. Here is the 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.
Make sure to read and understand the course information sheet. Check the discussion board frequently to make sure you receive any course announcements.
Contact information
| Instructor | Toniann Pitassi |
|---|---|
| |
Office hours
Wednesday 12:15-1:45pm in SF 2305A
Fridays 2:15-3:15pm in Pratt 266
Mondays 6-7pm in Pratt 266
Text Book
Introduction to Algorithms, Third Edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein is available online from the University of Toronto library.
Tutorials
| Section | Time | Room |
|---|---|---|
| L0101 | Friday 10-11am | RW 117 |
| L2001 | Friday 10-11am | RW 117 |
| L2003 | Friday 10-11am | RW 117 |
| L0201 | Friday 1-2pm | WI 1016 |
| L2000 | Friday 1-2pm | WI 1016 |
| L2201 | Friday 1-2pm | WI 1016 |