每日探花

COMP 610 Information Structures 1 (4 credits)

Offered by: Informatique (Facult茅 des sciences)

Administered by: 脡tudes sup茅rieures et recherch

Vue d'ensemble

Informatique (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: Hiver 2010

Instructors: Devroye, Luc P (Winter)

  • 3 hours
Back to top