COMP 610. Information Structures 1.
Credits: 4
Offered by: Computer Science (Graduate Studies)
This course is not offered this catalogue year.
Description
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.
- 3 hours