Table of Contents

(Each chapter contains a Chapter Review.)

1. Overview Of Computers And Programming
Electronic Computers Then and Now.Introduction to Computer Hardware.Problem Solving and Programming.Overview of Programming Language.Processing a High Level Language Program.Using an Operating System.Interview: David A Patterson.

2. Problem Solving And Pascal.
The Software Development Method.Applying the Software Development Method.Case Study: Converting Units of Measurement.Overview of Pascal, Reserved Words, and Identifiers.Data Types and Declarations.Executable Statements.General Form of a Pascal Program.Arithmetic Expressions.Case Study: Evaluating Coins.Formatting Program Output.Interactive Mode and Data Files (Optional).Debugging and Programming Errors.Interview: Philippe Kahn.

3. Functions And Procedures.
Building Programs from Existing Information.Case Study: Finding the Area and Circumference of a Circle.Case Study: Finding the Most Pizza for Your Money.Functions.Top-Down Design and Structure Charts.Case Study: Drawing Simple Diagrams.Procedures.Procedures as Program Building Blocks.Common Programming Errors.Interview: James Foley.

4. Selection Structures; if And case Statements.
Control Structures.Boolean Expressions.The if Statement.Syntax Diagrams.if Statements with Compound Statements.Decision Steps in Algorithms.Case Study: Payroll Problem.Case Study: Computing Insurance Dividends.Hand-Tracing an Algorithm.Nested if Statements and Multiple-Alternative Decisions.The case Statement.Common Programming Errors.Interview: Ellen Isaacs.5. Repetition: while, for And repeat Statements.The while Statement.Using Loops to Accumulate a Sum.Event-Controlled Loops.Loop Design.The for Statement.The repeat Statement.Nested Loops.Debugging and Testing Programs.Common Programming Errors.Interview: Marie des Jardins.6. Modular Programming.Introduction to Parameter Lists.Returning Information from Procedures.Syntax Rules for Procedures with Parameter Lists.Scope of Identifiers.Functions: Modules That Return a Single Result.Stepwise Design with Functions and Procedures.Case Study: General Sum-and-Average Problem.Debugging and Testing Programs with Modules.Recursive Functions (Optional).Common Programming Errors.

7. Simple Data Types.
Numeric Data Types: Real and Integer.The Boolean Data Type.The Character Data Type.Ordinal Functions and Character Functions.Subrange Type.Type Compatibility and Assignment Compatibility.Enumerated Types.Iterative Approximations (optional).Case Study: Approximating the Value of e.Common Programming Errors.Interview: Judith Schlesinger.

8. Text Files.
Text Files, Data Files and Output Files.Procedures and Functions for Text Files.Using Text Files.Case Study: Preparing a Payroll File.Debugging with Files.Common Programming Errors.Interview: Donna August.

9. Software Engineering.
Programming in the Large.Modular Libraries.Abstract Data Types.Testing Large Programs.Formal Methods of Program Verification.Ethics and Responsibilities.Common Programming Errors.Interview: Robert Sedgwick.

10. Arrays.
The Array Data Structure.Sequential Access to Array Elements.Arrays as Parameters and Operands.Case Study: Home Budget Problem.Subarray Processing.Searching and Sorting an Array.Analysis of Algorithms: Big-O Notation (Optional).Arrays with Type Char Elements and Subscripts.Case Study: Cryptogram Generator Problem.Debugging Programs with Arrays.Common Programming Errors.

11. Packed Arrays And Multi Dimensional Arrays.
Strings and Packed Arrays of Characters.Using Strings.Case Studies: Printing a Form Letter.Two Dimensional Arrays: Arrays of Arrays.Processing Two Dimensional Arrays.Case Study: Analysis of Sales Data.Three Dimensional Arrays.Common Programming Errors.Interview: Patrick H. Winston.

12. Records.
The Record Data Type.Records as Operands and Parameters.The with Statement.Arrays of Records.Hierarchical Records.Data Abstraction and Object-Oriented Programming.Variant Records (Optional).Debugging Records.Common Programming Errors.Interview: Adele Goldberg.

13. Recursion.
Recursive Modules.Parameter and Local Variable Stacks.Recursive Mathematical Functions.Recursive Modules with Array Parameters.Case Study: Summing the Values in an Array.Binary Search.Case Study: Recursive Binary Search.Problem Solving with Recursion.Case Study: Towers of Hanoi Problem.Debugging Recursive Algorithms.Common Programming Errors.

14. Sets.
Set Data Type.Set Operators.Common Programming Errors.

15. External Data Structures: Files.
Text File ADT and Binary File ADT.Creating and Using Binary Files.File Merge.Case Study: Merging Two Files.File Buffer Variable.Common Programming Errors.

16. Pointers And Linked Lists.
Pointer Types and Pointers.Manipulating the Heap.Linked Lists.Linked List ADT.Common Programming Errors.

17. Dynamic Data Structures.
Stacks.Stack Applications.Case Study: Reversing a Data Line.Case Study: checking for Balanced Parenthese.Queues.Binary Trees.Binary Search Tree ADT.Efficiency of Binary Search Tree.Common Programming Errors. 0201526743T04062001

About the Author

Elliot Koffman is a professor of computer and information science at Temple University. He is one of the country's foremost CS educators, a former chairman of the ACM Task Force for introductory programming methods courses, and author of a number of successful language texts in Modula-2, FORTRAN, in addition to his four editions of Pascal and Turbo Pascal.