Data Structures, Algorithms, and Generic Programming
COP 4530 Spring 2012
Chapter Index
0. Introduction to COP 4530
1. Introduction to Algorithms: Verification, Complexity, and Searching
2. A Generic Vector Class
3. A Generic List Class and Linked Lists
3A. Chalktalk: TList - PushFront() and Testing
4. Generic Positional Containers and Double Ended Queues
5. Abstract Data Types: Stacks and Queues
5A. Chalktalk: The Rat and Maze Specification
6. Function Classes and Objects
7. Iterators
8. Generic Algorithms
9. Introduction to Sets
10. Introduction to Maps
11. Introduction to Trees
12. Binary Search Trees
13. Balanced BSTs
14. Hashing, Hash Functions, and Their Uses
15. Hash Tables and Associative Arrays
16. Binary Heaps
17. BST Iterators
Appendix 1: Template Classes and Functions
Appendix 2: Bit Vectors
Appendix 3: I/O
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) 2012 R.C. Lacher, Florida State University.
|