Data Structures, Algorithms, and Generic Programming
COP 4530 Spring 2011
Chapter Index
0. Introduction to COP 4530
1. Introduction to Algorithms: Verification, Complexity, and Searching
2. Template Classes and Functions
3. A Generic Vector Class
4. A Generic List Class and Linked Lists
4A. Chalktalk: TList - PushFront() and Testing
5. Generic Positional Containers and Double Ended Queues
6. Abstract Data Types: Stacks and Queues
6A. Chalktalk: The Rat and Maze Specification
7. Function Classes and Objects
8. Iterators
9. Generic Algorithms
10. Generic Set Algorithms
11. Trees 1: Theory, Models, Generic Heap Algorithms, Priority Queues
12. Trees 2: Dynamic Binary Tree Navigation and Iteration
13. Trees 3: Construction of Dynamic Binary Trees
14: Introduction to Associative Containers
15. Sets and Maps 1: Ordered
16. Trees 4: Associative Binary Tree Structures
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) 2011 R.C. Lacher, Florida State University.
|