Data Structures and Algorithms 2

0.5 credits · Undergraduate

A continuation of COIS 2020H, this course introduces more complex data structures and algorithmic techniques. Core topics include adjacency matrices and lists, randomly built binary search trees, augmented data structures, tries, binomial heaps, B-trees, disjoint sets, and quad trees. Prerequisite: COIS 2020H. Recommended: COIS-MATH 2600H.