Data Structures, Algorithms, and Generic Programming
COP 4530
Chapter Index
1. Introduction
2. C Strings, Proper Type, and String Objects
3. A BitVector Class
4. Hashing, Hash Functions, and Their Uses
5. Template Classes and Functions
6. A Generic Vector Class
7. Introduction to Algorithms: Verification, Complexity, and Searching
8. A Generic List Class and Linked Lists
Chalktalk: TList - PushFront() and Testing
9. Generic Positional Containers and Double Ended Queues
10. Abstract Data Types: Stacks and Queues
Chalktalk: The Rat and Maze Specification
11. Function Classes and Objects
12. Generic Algorithms
13. Iterators
14. Generic Set Algorithms
15. Generic Associative Containers and Sorted Lists
16. Sets and Maps
17. Trees 1: Theory, Models, Generic Heap Algorithms, Priority Queues
18. Trees 2: Dynamic Binary Tree Navigation and Iteration
19. Trees 3: Construction of Dynamic Binary Trees
20. Trees 4: Associative Binary Tree Structures
21. Tables and Associative Arrays
Chalktalk: Internet Router
22. Graphs and Digraphs
A1. The Emacs Text Editor
A2. ELectronic Mail (elm)
A3. The G++ Compiler
A4. The Make Utility
A5. C/C++ Pointers, Arrays, and Pointer Arithmetic
A6. C++ Polymorphism
A7. The C++ I/O System
Z1. Patterns
Z2. Introduction to the Standard Template Library
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) 1999 - 2003 R.C. Lacher, Florida State
University.
|