Data Structures, Algorithms, and Generic Programming, Part II
COP 4531 Fall 2010
Chapter Index
1. Introduction to COP 4531
2. Generic Positional Containers
3. Introduction to Algorithms: Verification, Complexity, and Searching
4. Abstract Data Types: Stacks and Queues
5. Function Classes and Objects
6. Iterators
7. Generic Algorithms
8. Generic Set Algorithms
9. Trees 1: Theory, Models, Generic Heap Algorithms, Priority Queues
10. Sorting Algorithms
11. Generic Associative Containers
12. Set and Map Abstractions
13. Hashing, Hash Functions, and Their Uses
14. Tables and Associative Arrays
15. Trees 2: Dynamic Binary Tree Navigation and Iteration
16. Trees 3: Construction of Dynamic Binary Trees
17. Trees 4: Associative Binary Tree Structures
18. Graphs and Digraphs
Copyright notice: The source documents, rendered pages, and content
in this course are proprietary and may not be copied without express written
permission of the author. (C) 2010 R.C. Lacher, Florida State
University.
|