Indeholder "Preface", "Declaration", "1. Fundamental Data Structures", "1.1 Introduction", "1.2 The Concept of Data Type", "1.3 Primitive Data Types", "1.4 Standard Primitive Types", "1.5 Subrange Types", "1.6 The Array Structure", "1.7 The Record Structure", "1.8 Variants of Record Structure", "1.9 The Set Structure", "1.10 Representation of Arrays, Records, and Set Structures", "1.10.1 Representation of Arrays", "1.10.2 Representation of Record Structures", "1.10.3 Representation of Sets", "1.11 The Sequential File Structure", "1.11.1 Elementary File Operators", "1.11.2 Files with Substructure", "1.11.3 Texts", "1.11.4 A File Editing Program", "2. Sorting", "2.1 Introduction", "2.2 Sorting Arrays", "2.2.1 Sorting by Straight Insertion", "2.2.2 Sorting by Straight Selection", "2.2.3 Sorting by Straight Exchange", "2.2.4 Insertion Sort by Diminishing Increment", "2.2.5 Tree Sort", "2.2.6 Partition Sort", "2.2.7 Finding the Median", "2.2.8 A Comparison of Array Sorting Methods", "2.3 Sorting Sequential Files", "2.3.1 Straight Merging", "2.3.2 Natural Merging", "2.3.3 Balanced Multiway Merging", "2.3.4 Polyphase Sort", "2.3.5 Distribution of Initial Runs", "3 Recursive Algorithms", "3.1 Introduction", "3.2 When Not to Use Recursion", "3.3 Two Examples of Recursive Programs", "3.4 Backtracking Algorithms", "3.5 The Eight Queens Problem", "3.6 The Stable Marriage Problem", "3.7 The Optimal Selection Problem", "4. Dynamic Information Structures", "4.1 Recursive Data Types", "4.2 Pointers or References", "4.3 Linear Lists", "4.3.1 Basic Operations", "4.3.2 Ordered Lists and Re-organizing Lists", "4.3.3 An Application: Topological Sorting", "4.4 Tree Structures", "4.4.1 Basic Concepts and Definitions", "4.4.2 Basic Operations on Binary Trees", "4.4.3 Tree Search and Insertion", "4.4.4 Tree Deletion", "4.4.5 Analysis of Tree Search and Insertion", "4.4.6 Balanced Trees", "4.4.7 Balanced Tree Insertion", "4.4.8 Balanced Tree Deletion", "4.4.9 Optimal Search Trees", "4.4.10 Displaying a Tree Structure", "4.5 Multiway Trees", "4.5.1 B-Trees", "4.5.2 Binary B-Trees", "4.6 Key Transformations (Hashing)", "4.6.1 Choice of a Transformation function", "4.6.2 Collision handling", "4.6.3 Analysis of Key Transformation ", "5. Language Structures and compilers", "5.1 Language Definition and Structure", "5.2 Sentence Analysis", "5.3 Constructing a Syntax Graph", "5.4 Constructing a Parser for a Given Syntax", "5.5 Constructing a Table-Driven Parsing Program", "5.6 A Translator from BNF into Parser-Driving Data Structures", "5.7 The Programming Language PL/0", "5.8 A Parser for PL/0", "5.9 Recovering from Syntactic Errors", "5.10 A PL/0 Processor", "5.11 Code Generation", "Appendices", "A The ASCII Character Set", "B Pascal Syntax Diagrams", "Subject Index", "Index of Programs".

Forældet lærebog tilbage fra ca 1980, hvor jeg havde Datalogi 1. Indeholder noget ikke-ret-pænt programkode, fx side 15, hvor en underlig ad-hoc metode til at skrive 0.5, 0.25, 0.125 osv ud er ret ulæselig. Program 5.6 er en compiler for et simpelt sprog kaldet PL/0. ( )