Data Structures, Algorithms, and Generic Programming - Parts I and II
COP 4530,4531 Combined Review
Chapter Index
1. A BitVector Class
2. C Strings, Proper Type, and String Objects
3. Hashing, Hash Functions, and Their Uses
4. Template Classes and Functions
5. A Generic Vector Class
6. Introduction to Algorithms: Verification, Complexity, and Searching
7. A Generic List Class and Linked Lists
8. Generic Positional Containers and Double Ended Queues
9. Abstract Data Types: Stacks and Queues
10. Function Classes and Objects
11. Iterators
12. Generic Algorithms
13. Tables and Associative Arrays
14. Trees 1: Theory, Models, Generic Heap Algorithms, Priority Queues
15. Generic Positional Containers
16. Generic Set Algorithms
17. Sorting Algorithms
18. Generic Associative Containers
19. Set and Map Abstractions
20. Trees 2: Dynamic Binary Tree Navigation and Iteration
21. Trees 3: Construction of Dynamic Binary Trees
22. Trees 4: Associative Binary Tree Structures
23. 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) 2007 R.C. Lacher, Florida State
University.
|