Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 51. Chapters: Array data structure, Binary tree, Collection (abstract data type), Compressed data structure, Concurrent data structure, Container (abstract data type), Control table, Disjoint-set data structure, Dynamization, Hash table, Implicit data structure, Linked data structure, List of data structures, Partition refinement, Persistent data structure, Piece table, Recordset, Retroactive data structures, Search data structure, Search tree, Sequential access, Serialization, Sorted array, Spaghetti stack, Succinct data structure, Symbol table, Synonym (database), Wavelet Tree, Zipper (data structure). Excerpt: Control tables are tables that control the control flow or play a major part in program control. There are no rigid rules about the structure or content of a control table-its qualifying attribute is its ability to direct control flow in some way through "execution" by a processor or interpreter. The design of such tables is sometimes referred to as table-driven design (although this typically refers to generating code automatically from external tables rather than direct run-time tables). In some cases, control tables can be specific implementations of finite-state-machine-based automata-based programming. If there are several hierarchical levels of control table they may behave in a manner equivalent to UML state machines Control tables often have the equivalent of conditional expressions or function references embedded in them, usually implied by their relative column position in the association list. Control tables reduce the need for programming similar structures or program statements over and over again. The two-dimensional nature of most tables makes them easier to view and update than the one-dimensional nature of program code. In some cases, non-programmers can be assigned to maintain the control tables....