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 2024-2025 academic year.
Instructors: There are no professors associated with this course for the 2024-2025 academic year.
3 hours
