COMP 610 Information Structures 1 (4 credits)

Main navigation

Derni猫res mises 脿 jour en lien avec la COVID-19 disponibles ici.
Latest information about COVID-19 available here.

COMP 610 Information Structures 1 (4 credits)

Note: This is the 2020鈥�2021 eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or .

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: This course is not scheduled for the 2020-2021 academic year.

Instructors: There are no professors associated with this course for the 2020-2021 academic year.