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 [CSCB07H or (CSCB70H)] & [CSCB36H or (CSCB38H)] & [STAB52H or (STAB47H)] & [CGPA 2.5 or enrolment in a CSC subject POSt]
Dr. Anna Bretscher
Phone: (416) 208-4745
Lectures Mondays 1:10-2:00, Wednesdays 1:10-2:00 in MW170.
ScheduleTentative schedule of assignments, midterms and other important dates.
|Jan 4||1st Day of Lectures (1-2pm)|
|Jan 25||A1 Due|
|Feb 1||Quiz 1|
|Feb 15-19||Reading Week|
|Mar 1||A2 due|
|Mar 8||Quiz 2|
|Mar 29||A3 Due|
|April 5||Start of Final Exams|