Essentials

Course Description

Design, analysis, implementation and comparison of efficient data structures for common abstract data types. Priority queues: heaps and mergeable heaps. Dictionaries: balanced binary search trees, B-trees, hashing. Amortization: data structures for managing dynamic tables and disjoint sets. Data structures for representing graphs. Graph searches.

Exclusion CSC263H, CSC265H, (CSCC78H)

Prerequisite CSCB36H or (CSCB38H) & [CGPA 2.75 or enrolment in a CSC subject POSt]

Syllabus

Instructor

Dr. Anna Bretscher
Email: bretscher@utsc.utoronto.ca
Office: IC 493

Timetable

Lectures

Wednesdays 3-4pm Zoom Link, Thursdays 9:10-11:00 Zoom Link

Office Hours

Usually Mondays 11:00-12:30, Thursdays 11:30-1:00. Please see the calendar for weekly changes.