Indeholder "Chapter 1. Introduction to Computers and Problem Solving", " What a Computer Is", " The Modern Digital Computer", " The Notion of an Algorithm", " Programs and Data", " High-Level Languages", " The Pascal Language", " Programming Environments", " Designing Programs", " Summary of Terms", " Exercises", " References for Further Reading", "Chapter 2. Introduction to Problem Solving with Pascal", " The Notion of a Program Variable", " Stepping Through a Program", " Assignment Statements", " Pitfall - Uninitialized Variables", " Data Types - An Introduction", " More about Real Values", " Type Compatibilities", " Arithmetic Expressions", " Simple Output", " Input", " Designing Input and Output", " Pitfall - Input in Wrong Order", " Names: Identifiers", " Putting the Pieces Together", " Introduction to Programming Style", " Self-Test Exercises", " Interactive Exercises", " Problem Solving and Program Design", " Top-Down Design", " Case Study - A Guessing Game", " Integer Division - mod and div", " Desktop Testing", " Case Study - Making Change", " Exploring the Solution Space", " Summary of Problem Solving Techniques", " Summary of Programming Techniques", " Summary of Pascal Constructs", " Exercises", "Chapter 3. More Pascal and Programming Techniques", " Naming Constants", " Comments", " Pitfall - Forgetting a Closing Comment Delimiter", " Formatting Output", " Example Using Named Constants and Formatted Output", " Allowable Range for Numbers", " More about Commenting", " Testing and Debugging", " Tracing", " Use of Assertions in Testing (Optional)", " Self-Test Exercises", " Interactive Exercises", " Syntax Diagrams", " Simple Branching - if-then-else", " Pitfall - The Equality Operator", " Optional else", " Pitfall - Extra Semicolons", " Compound Statements", " Iterative Enhancement", " Case Study - Payroll Calculation", " Simple Looping - while Statements", " while Loop Example - Charge Card Balance", " Pitfall - Infinite Loops", " Standard Functions", " Using Known Algorithms", " Case Study - Solving Quadratic Equations", " Defensive Programming", " More about Indenting and Commenting", " Summary of Problem Solving Techniques", " Summary of Programming Techniques", " Summary of Pascal Constructs", " Exercises", " References for Further Reading", "Chapter 4. Designing Procedures for Subtasks", " Simple Pascal Procedures", " Variable Parameters", " Parameter Lists", " Implementation of Variable Parameters (Optional)", " Procedures Calling Procedures", " Procedural Abstraction", " Self-Test Exercises", " Value Parameters", " What Kind of Parameter to Use", " Mixed Parameter Lists", " Case Study - Supermarket Pricing", " Case Study - Change Program with Procedures", " Pitfall - Incorrectly Ordered Parameter Lists", " Generalizing Procedures", " Choosing Parameter Names", " Summary of Problem Solving and Programming Techniques", " Summary of Pascal Constructs", " Exercises", "Chapter 5. Procedures for Modular Design", " Local Variables", " Case Study - Grade Warnings", " Other Local Identifiers", " Pitfall - Use of Global Variables", " Self-Test Exercises", " Implementation of Value Parameters", " Pitfall - Inadvertent Local Variables", " Scope of an Identifier", " Case Study - Automobile Bargaining", " Testing Procedures", " Top-Down and Bottom-Up Strategies", " Preconditions and Postconditions", " Case Study - Calculating Leap Years", " Summary of Problem Solving and Programming Techniques", " Summary of Pascal Constructs", " Exercises", "Chapter 6. Designing Programs that Make Choices", " Nested Statements", " Nesting if-then and if-then-else Statements", " Complex Boolean Expressions", " George Boole (Optional)", " Evaluating Boolean Expressions", " Pitfall - Undefined Boolean Expressions", " Self-Test Exercises", " Programming with Boolean Variables", " Pitfall - Omitting Parentheses in Boolean Expressions", " Boolean Input and Output", " Case Study - Designing Output", " Boolean Constants and Debugging Switches", " The case Statement", " Pitfall - Case Expression Value Not on Any Label List", " The Empty Statement", " Programming Multiple Alternatives", " Case Study - State Income Tax", " Simple Use of Sets (Optional)", " Summary of Problem Solving and Programming Techniques", " Summary of Pascal Constructs", " Exercises", "Chapter 7. Design and Implementation of Loops", " Basic Loop Considerations", " The While Statement", " Case Study - Summing a List of Numbers", " Pitfall - Uninitialized Variables", " Pitfall Review - Unintended Infinite Loops", " Self-Test Exercises", " The Repeat Statement", " Comparison of the While and Repeat Loops", " Case Study - Testing a Procedure", " Self-Test Exercises", " Designing Robust Programs", " Invariant Assertions and Variant Expressions (Optional)", " For Statements", " Example - Summing a Series", " Repeat N Times", " Invariant Assertions and For Loops (Optional)", " ase Study - Summing a List of Numbers Once Again", " Ending a Loop", " Using eoln and eof", " Pitfall - Use of eoln with Numeric Data", " Case Study - Computing an Average", " What Kind of Loop to Use", " Nested Loops", " Debugging Loops", " Summary of Problem Solving and Programming Techniques", " Summary of Pascal Constructs", " Exercises", " References for Further Reading", "Chapter 8. Functions and Abstract Data Types", " Use of Functions", " A Sample Function Declaraion", " Case Study - A Function to Compute Powers", " Pitfall - Thinking the Function Name is a Variable", " Pitfall - Special Cases", " Local Identifiers", " Functions That Change Their Minds", " Side Effects", " Self-Test Exercises", " Boolean Valued Functions", " Case Study - Testing for Primes (Optional)", " More Standard Functions (Optional)", " Random Number Generators (Optional)", " Using Pseudorandom Numbers (Optional)", " Self-Test Exercises", " ADTs - Abstract Data Types", " Type Declarations", " Case Study - Abstract Data Type Money", " Using the Money ADT in a Program", " Improving the Money ADT", " Self-Test Exercises", " Ordinal Types", " The Functions ord, chr, pred, and succ (Optional)", " Subrange Types", " The For and Case Statements Revisitet", " Allowable Parameter Types", " Pitfall - Parameter Type Conflicts", " Pitfall - Anonymous Types", " Time ADT", " Use of Subrange Types for Error Detection", " Enumerated Types", " Summary of Problem Solving and Programming Techniques", " Summary of Pascal Constructs", " Exercises", "Chapter 9. One-Dimensional Arrays", " Introduction to Arrays", " Pitfall - Use of Plurals in Array Definitions", " Type Declarations - A Summary", " Input and Output with Arrays", " Partially Filled Arrays", " Pitfall - Array Index Out of Range", " Self-Test Exercises", " Arrays as a Structuret Type", " Allowable Function Types", " Case Study - Searching an Array", " Pitfall - Type Mismatches with Array Parameters", " Efficiency of Variable Parameters", " Array Examples with Noninteger Indexes", " Array Indexes with Semantic Content", " Enumerated Types as Array Index Types", " Time ADT Implemented as an Array", " Off-Line Data (Optional)", " Case Study - Sorting", " Summary of Problem Solving and Programming Techniques", " Summary of Pascal Constructs", " Exercises", " References for Further Reading", "Chapter 10. Complex Array Structures", " CharString ADT for Strings of Characters", " Component Types of Arrays", " Parallel Arrays", " Case Study - Making a History Table", " Self-Test Exercises", " Case Study - Automated Drill", " Adapting a Known Algorithm", " Case Study - Pattern Matching", " Design by Concrete Example", " Time Efficiency", " Packed Arrays (Optional)", " Packed Arrays of Characters (Optional)", " Self-Test Exercises", " Multidimensional Arrays", " Case Study - Grading Program", " Pitfall - Exceeding Storage Capacity", " Summary of Problem Solving and Programming Techniques", " Summary of Pascal Constructs", " Exercises", " References for Further Reading", "Chapter 11. Records and Other Data Structures", " Introduction to Records", " Comparison of Arrays and Records", " The Syntax of Simple Records", " Self-Test Exercises", " Records within Records", " Arrays of Records", " Sample Program Using Records", " Choosing a Data Structure", " The With Statement", " Pitfall - Problems with the With Statement", " Case Study - Sales Report", " Case Study - Alternative Implementation of the CharString ADT", " Case Study - Sorting Records", " Algorithm Abstraction", " Searching by Hashing (Optional)", " Variant Records (Optional)", " Sets in Boolean Expressions", " More About Sets (Optional)", " Pitfall - Limitations of Sets (Optional)", " Summary of Problem Solving and Programming Techniques", " Summary of Pascal Constructs", " Exercises", " References for Further Reading", "Chapter 12. Program Design Methodology", " Some Guidelines for Designing Algorithms", " Writing Code", " Abstraction and ADTs", " Testing and Debugging", " Verification", " Portability", " Analysis of Algorithms", " Running Times", " Big O Notation", " Self-Test Exercises", " Software Engineering", " Summary of Terms", " Exercises", " References for Further Reading", "Chapter 13. Text Files and Secondary Storage", " Part I", " Text Files", " Writing and Reading Text Files", " Opening Files", " Pitfall - Mixing Reading and Writing to a Text File", " Pitfall - The Silent Program", " Self-Test Exercise", " Interactive Exercises", " Part II", " read and write Reexamined", " eof and eoln", " Using a Buffer", " Pitfall - Forgetting the File Variable in eof and eoln", " Pitfall - Use of eoln and eof with numeric data", " Pitfall - Mixing eof and eoln", " Text Files as Parameters to Procedures", " Pitfall - Portability", " Basic Technique for Editing Text Files", " Internal Files", " Case Study - Editing out Excess Blanks", " Text Editing as a Programming Aid", " Summary of Problem Solving and Programming Techniques", " Summary of Pascal Constructs", " Exercises", "Chapter 14. Problem Solving Using Recursion", " Case Study - A Recursive Function", " A Closer Look at Recursion", " Pitfall - Infinite Recursion", " Stacks", " Pitfall - Stack Overflow", " Self-Test Exercises", " Proving Termination and Correctness for Recursive Functions (Optional)", " Case Study - A Simple Example of a Recursive Procedure", " Technique for Designing Recursive Algorithms", " Case Study - Towers of Hanoi - An Example of Recursive Thinking", " Recursive versus Iterative Procedures and Functions", " Case Study - Binary Search", " Case Study - Quicksort (Optional)", " Forward Declarations (Optional)", " Summary of Problem Solving and Programming Techniques", " Exercises", " References for Further Reading", "Chapter 15. Solving Numeric Problems", " A Hypothetical Decimal Computer", " Binary Numbers (Optional)", " Machine Representation of Numbers in Binary (Optional)", " Extra Precision (Optional)", " Self-Test Exercises", " Pitfall - Sources of Error in Real Arithmetic", " Pitfall - Error Propagation", " Case Study - Series Evaluation", " Case Study - Finding a Root of a Function", " Summary of Problem Solving and Programming Techniques", " Summary of Terms", " Exercises", " References for Further Reading", "Chapter 16. More File Types", " The General Notion of a File", " File Variables", " Opening Files", " Windows", " read and write", " Case Study - Processing a File of Numeric Data", " Pitfall - Unexpected End of File", " Self-Test Exercises", " Files as Parameters to Procedures", " Case Study - Changing a File of Records", " Deciding What Type of File to Use", " Case Study - Merging Two Files", " File Buffer Variable (Optional)", " put and get (Optional)", " Example Using put and get (Optional)", " Summary of Problem Solving and Programming Techniques", " Summary of Pascal Constructs", " Summary of put and get (Optional)", " Exercises", " References for Further Reading", "Chapter 17. Dynamic Data Structures", " The Notion of a Pointer", " Pascal Pointers and Dynamic Variables", " Manipulating Pointers", " Nodes", " The Pointer nil", " Pitfall - Forgetting that nil is a Pointer", " Linked Lists - An Example of Pointer Use", " Case Study - Building a Linked List", " The Empty List", " Pitfall - Losing Nodes", " Case Study - Tools for Manipulating a Linked List", " Self-Test Exercises", " Pointer Functions", " Pitfall - Testing for the Empty List", " Case Study - Using a Linked List to Sort a File", " Stacks", " dispose (optional)", " Case Study - Implementing Queues", " Doubly Linked Lists - A Variation on Simple Linked Lists", " Implementation (optional)", " Trees", " Case Study - Building a Search Tree", " Summary of Problem Solving and Programming Techniques", " Summary of Pascal Constructs", " Exercises", " References for Further Reading", "Appendix One. The goto Statement", "Appendix Two. Syntax Diagrams for Standard Pascal", "Appendix Three. Using Files with Dr. Pascal", "Appendix Four. Getting Started with UNIX", "Appendix Five. A Quick Introduction to the VI Editor", "Appendix Six. Summary of VI Commands", "Appendix Seven. UNIX Files and Directories", "Appendix Eight. Summary of UNIX Commands", "Appendix Nine. I/O Redirection in UNIX", "Appendix Ten. Character Sets", " ASCII", " EBCDIC", " CDC", "Answers to Self-Test Exercises", "Index", " Description of Dr. Pascal", " Free PCPix/MACPix Command-line interpreters", " Discount Purchase Coupon", "Inside of Back Cover", " Reserved Words", " Standard Identifiers", " Precedence of Operators", " Ordinal Types", " Types that May Be Used for the Value Returned by a Function", " Predefined Functions".

Standard lærebog i Pascal, men venlig og behagelig at arbejde med. Primtalstest foregår med en løkke fra 1 til n-1 og QuickSort er den mest avancerede algoritme, der bliver vist. Ikke værd at gemme på, selv om den er meget pædagogisk og har et fint opslagsregister. ( )

Pascal