CSC263H: Course Webpage


Welcome to CSC263H! Our two major goals are to learn many important data structures and abstract data types useful for both organizing your programs and making them faster; and to reason about the efficiency of algorithms.

This is a proofs-based course. We will do a lot of proving, because this type of thinking is important for being successful in CS-related careers. Our work, however, also leads to practical goals: writing fast programs, organizing our data in clear ways, and arguing about the efficiency of programs.

Here is the course information sheet for LEC0101. Check here for all general course-related information.

Contact Information

Instructor Lecture Times Office Hours Email
Sushant Sachdeva (Coordinator) L0101 W 9:00-11:00 (IB245)
L0102 W 15:00-17:00 (IB245)
W 1100-1200hrs and
W 1330-1430hrs
sushant.sachdeva at utoronto dot ca
Jessica Burgner-Kahrs L0103 F 11:00-13:00 (IB245) F 1400-1500hrs
jessica.burgnerkahrs at utoronto dot ca