COMP 610 Information Structures 1 (4 credits)

Offered by: Computer Science (Faculty of Science)

Administered by: Graduate Studies


Computer Science (Sci) : Study of elementary data structures: lists, stacks, queues, trees, hash tables, binary search trees, red-black trees, heaps. Augmenting data structures. Sorting and selection, Recursive algorithms. Advanced data structures including binomial heaps, Fibonacci heaps, disjoint set structures, and splay trees. Amortizing. String algorithms. Huffman trees and suffix trees. Graph algorithms.

Terms: Winter 2018

Instructors: Bruce Alan Reed (Winter)

  • 3 hours