秀色直播

COMP 610 Information Structures 1 (4 unit茅s)

important

Nota : Ceci est la version 2019鈥�2020 de l'annuaire 茅lectronique. Veuillez mettre 脿 jour l'ann茅e dans la barre d'adresse de votre navigateur pour une version plus r茅cente de cette page, ou .

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

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

  • 3 hours

Back to top