CSC263H5
UTMData Structures and Analysis
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.
View full details on the UofT Academic CalendarPrereq: CSC207H5 and CSC236H5 and ( STA107H5 or STA246H5 or STA256H5 or STA237H1 or STA238H1 or ECO227Y5 or ECE286H1 or MIE286H1)Breadth: ScienceExcl: CSC263H1 or CSC265H1 or CSCB63H3
0%
liked
Easy0%
Useful0%
0
comments
0
ratings
Course Info
DepartmentCSC
CampusUTM (Mississauga)
Level200
Hours24L/12T
BreadthScience
What do you think of CSC263H5?
Reviews
No reviews yet — be the first to share your experience.