COMP 610 Information Structures 1 (4 credits)

Note: This is the 20132014 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click here to jump to the newest eCalendar.

Offered by: Computer Science (Faculty of Science)

Administered by: Graduate Studies

Overview

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 2014

Instructors: Luc P Devroye (Winter)

  • 3 hours