Pascal

Now, this leading text has been revised to make it even easier for students to learn Pascal. The fifth edition incorporate the best of earlier editions--with a highly refined text, redesigned layouts, enhanced learning features, and updated material throughout. All of these significant improvements work together to give CS1 students what they need most--a solid foundation in programming.

• Streamlined and thoroughly redesigned to further enhance the authorOs already readable prose.
• Improved learning features. 30% new exercises and programming projects.
• Greater emphasis on problem solving. The five-step problem-solving methodology demonstrates a solid approach to better program design.
• Coverage of object-oriented programming has been amplified in Turbo Pascal.
• New interviews with computer scientists show students the breadth of the subject area, review current issues, and provide a look at the background preparation needed for success in these fields.

Table of contents

1. Overview Of Computers And Programming

1. Electronic Computers Then and Now
2. Introduction to Computer Hardware
3. Problem Solving and Programming
4. Overview of Programming Language
5. Processing a High Level Language Program
6. Using an Operating System
7. Chapter Review
8. Interview: David A Patterson

2. Problem Solving And Pascal

1. The Software Development Method
2. Applying the Software Development Method
3. Case Study: Converting Units of Measurement
4. Overview of Pascal, Reserved Words, and Identifiers
5. Data Types and Declarations
6. Executable Statements
7. General Form of a Pascal Program
8. Arithmetic Expressions
9. Case Study: Evaluating Coins
10. Formatting Program Output
11. Interactive Mode and Data Files (Optional)
12. Debugging and Programming Errors
13. Chapter Review
14. Interview: Philippe Kahn

3. Functions And Procedures

1. Building Programs from Existing Information
2. Case Study: Finding the Area and Circumference of a Circle
3. Case Study: Finding the Most Pizza for Your Money
4. Functions
5. Top-Down Design and Structure Charts
6. Case Study: Drawing Simple Diagrams
7. Procedures
8. Procedures as Program Building Blocks.
9. Common Programming Errors
10. Chapter Review
11. Interview: James Foley

4. Selection Structures; if And case Statements

1. Control Structures
2. Boolean Expressions
3. The if Statement
4. Syntax Diagrams
5. if Statements with Compound Statements
6. Decision Steps in Algorithms
7. Case Study: Payroll Problem
8. Case Study: Computing Insurance Dividends
9. Hand-Tracing an Algorithm
10. Nested if Statements and Multiple-Alternative Decisions
11. The case Statement
12. Common Programming Errors
13. Chapter Review
14. Interview: Ellen Isaacs

5. Repetition: while, for And repeat Statements

1. The while Statement
2. Using Loops to Accumulate a Sum
3. Event-Controlled Loops
4. Loop Design
5. The for Statement
6. The repeat Statement
7. Nested Loops
8. Debugging and Testing Programs
9. Common Programming Errors
10. Chapter Review
11. Interview: Marie des Jardins

6. Modular Programming

1. Introduction to Parameter Lists
2. Returning Information from Procedures
3. Syntax Rules for Procedures with Parameter Lists
4. Scope of Identifiers
5. Functions: Modules That Return a Single Result
6. Stepwise Design with Functions and Procedures
7. Case Study: General Sum-and-Average Problem
8. Debugging and Testing Programs with Modules
9. Recursive Functions (Optional)
10. Common Programming Errors
11. Chapter Review

7. Simple Data Types

1. Numeric Data Types: Real and Integer
2. The Boolean Data Type
3. The Character Data Type
4. Ordinal Functions and Character Functions
5. Subrange Type
6. Type Compatibility and Assignment Compatibility
7. Enumerated Types
8. Iterative Approximations (optional)
9. Case Study: Approximating the Value of e
10. Common Programming Errors
11. Chapter Review
12. Interview: Judith Schlesinger

8. Text Files

1. Text Files, Data Files and Output Files
2. Procedures and Functions for Text Files
3. Using Text Files
4. Case Study: Preparing a Payroll File
5. Debugging with Files
6. Common Programming Errors
7. Chapter Review
8. Interview: Donna August

9. Software Engineering

1. Programming in the Large
2. Modular Libraries
3. Abstract Data Types
4. Testing Large Programs
5. Formal Methods of Program Verification
6. Ethics and Responsibilities
7. Common Programming Errors
8. Chapter Review
9. Interview: Robert Sedgwick

10. Arrays

1. The Array Data Structure
2. Sequential Access to Array Elements
3. Arrays as Parameters and Operands
4. Case Study: Home Budget Problem
5. Subarray Processing
6. Searching and Sorting an Array
7. Analysis of Algorithms: Big-O Notation (Optional)
8. Arrays with Type Char Elements and Subscripts
9. Case Study: Cryptogram Generator Problem
10. Debugging Programs with Arrays
11. Common Programming Errors
12. Chapter Review

11. Packed Arrays And Multi Dimensional Arrays

1. Strings and Packed Arrays of Characters
2. Using Strings
3. Case Studies: Priniting A Form Letter
4. Two Dimensional Arrays: Arrays of Arrays
5. Processing Two Dimensional Arrays
6. Case Study: Analysis of Sales Data
7. Three Dimensional Arrays
8. Common Programming Errors
9. Chapter Review
10. Interview: Patrick H. Winston

12. Records

1. The Record Data Type
2. Records as Operands and Parameters
3. The with Statement
4. Arrays of Records
5. Hierarchical Records
6. Data Abstraction and Object-Oriented Programming
7. Variant Records (Optional )
8. Debugging Records
9. Common Programming Errors
10. Chapter Review
11. Interview: Adele Goldberg

13. Recursion

1. Recursive Modules
2. Parameter and Local Variable Stacks
3. Recursive Mathematical Functions
4. Recursive Modules with Array Parameters
5. Case Study: Summing the Values in an Array
6. Binary Search
7. Case Study: Recursive Binary Search
8. Problem Solving with Recursion
9. Case Study: Towers of Hanoi Problem
10. Debugging Recursive Algorithms
11. Common Programming Errors
12. Chapter Review

14. Sets

1. Set Data Type
2. Set Operators
3. Common Programming Errors
4. Chapter Review

15. External Data Structures: Files

1. Text File ADT and Binary File ADT
2. Creating and Using Binary Files
3. File Merge
4. Case Study: Merging Two Files
5. File Buffer Variable
6. Common Programming Errors
7. Chapter Review

16. Pointers And Linked Lists

1. Pointer Types and Pointers
2. Manipulating the Heap
3. Linked Lists
4. Linked List ADT
5. Common Programming Errors
6. Chapter Review

17. Dynamic Data Structures

1. Stacks
2. Stack Applications
3. Case Study: Reversing a Data Line
4. Case Study: checking for Balanced Parenthese
5. Queues
6. Binary Trees
7. Binary Search Tree ADT
8. Efficiency of Binary Search Tree
9. Common Programming Errors
10. Chapter Review