×

Uh-oh, it looks like your Internet Explorer is out of date.

For a better shopping experience, please upgrade now.

Pascal / Edition 5
     

Pascal / Edition 5

by Elliot B. Koffman
 

ISBN-10: 0201526743

ISBN-13: 9780201526745

Pub. Date: 01/12/1995

Publisher: Addison-Wesley

Overview



Product Details

ISBN-13:
9780201526745
Publisher:
Addison-Wesley
Publication date:
01/12/1995
Edition description:
5th ed
Pages:
731
Product dimensions:
7.46(w) x 9.18(h) x 1.11(d)

Table of Contents

Overview of Computers and Programming
1(22)
Electronic Computers Then and Now
2(2)
Introduction to Computer Hardware
4(6)
Problem Solving and Programming
10(1)
Overview of Programming Languages
11(2)
Processing a High-Level Language Program
13(3)
Using an Operating System
16(7)
Chapter Review
17(3)
Interview: David A. Patterson
20(3)
Problem Solving and Pascal
23(60)
The Software Development Method
24(3)
Applying the Software Development Method
27(3)
Converting Units of Measurement
27(3)
Overview of Pascal, Reserved Words, and Identifiers
30(5)
Data Types and Declarations
35(4)
Executable Statements
39(9)
General Form of a Pascal Program
48(4)
Arithmetic Expressions
52(11)
Evaluating Coins
59(4)
Formatting Program Output
63(5)
Interactive Mode, Batch Mode, and Data Files (Optional)
68(4)
Debugging and Programming Errors
72(11)
Chapter Review
76(5)
Interview: Philippe Kahn
81(2)
Functions and Procedures
83(34)
Building Programs from Existing Information
84(7)
Finding the Area and Circumference of a Circle
85(3)
Finding the Most Pizza for Your Money
88(3)
Functions
91(7)
Top-Down Design and Structure Charts
98(2)
Drawing Simple Diagrams
98(2)
Procedures
100(6)
Procedures as Program Building Blocks
106(3)
Common Programming Errors
109(8)
Chapter Review
109(5)
Interview: James D. Foley
114(3)
Selection Structures: If and case Statements
117(52)
Control Structures
118(1)
Boolean Expressions
119(7)
The if Statement
126(4)
Syntax Diagrams
130(3)
if Statements with Compound Statements
133(2)
Decision Steps in Algorithms
135(8)
Payroll Problem
136(5)
Computing Insurance Dividends
141(2)
Hand-Tracing an Algorithm
143(2)
Nested if Statements and Multiple-Alternative Decisions
145(9)
The case Statement
154(5)
Common Programming Errors
159(10)
Chapter Review
160(7)
Interview: Ellen Isaacs
167(2)
Repetition: while, for, and repeat Statements
169(48)
The while Statement
170(3)
Using Loops to Accumulate a Sum
173(3)
Event-Controlled Loops
176(5)
Loop Design
181(9)
The for Statement
190(6)
The repeat Statement
196(5)
Nested Loops
201(4)
Debugging and Testing Programs
205(2)
Common Programming Errors
207(10)
Chapter Review
209(6)
Interview: Marie desJardins
215(2)
Modular Programming
217(54)
Introduction to Parameter Lists
218(5)
Returning Information from Procedures
223(8)
Syntax Rules for Procedures with Parameter Lists
231(5)
Scope of Identifiers
236(7)
Functions: Modules That Return a Single Result
243(7)
Stepwise Design with Functions and Procedures
250(8)
General Sum-and-Average Problem
251(7)
Debugging and Testing Programs with Modules
258(3)
Recursive Functions (Optional)
261(3)
Common Programming Errors
264(7)
Chapter Review
264(7)
Simple Data Types
271(36)
Numeric Data Types: Real and Integer
272(2)
The Boolean Data Type
274(2)
The Character Data Type
276(1)
Ordinal Functions and Character Functions
277(4)
Subrange Types
281(3)
Type Compatibility and Assignment Compatibility
284(2)
Enumerated Types
286(7)
Iterative Approximations (Optional)
293(3)
Approximating the Value of e
294(2)
Common Programming Errors
296(11)
Chapter Review
298(7)
Interview: Judith Schlesinger
305(2)
Text Files
307(34)
Text Files, Data Files, and Output Files
308(6)
Procedures and Functions for Text Files
314(9)
Using Text Files
323(7)
Preparing a Payroll File
323(7)
Debugging with Files
330(1)
Common Programming Errors
330(11)
Chapter Review
331(7)
Interview: Donna Auguste
338(3)
Software Engineering
341(28)
Programming in the Large
342(3)
Module Libraries
345(4)
Abstract Data Types
349(4)
Testing Large Programs
353(2)
Formal Methods of Program Verification
355(6)
Ethics and Responsibilities
361(1)
Common Programming Errors
362(7)
Chapter Review
363(4)
Interview: Robert Sedgewick
367(2)
Arrays
369(54)
The Array Data Structure
370(7)
Sequential Access to Array Elements
377(4)
Arrays as Parameters and Operands
381(13)
Home Budget Problem
387(7)
Subarray Processing
394(3)
Searching and Sorting an Array
397(7)
Analysis of Algorithms: Big-O Notation (Optional)
404(3)
Arrays with Type Char Elements and Subscripts
407(7)
Cryptogram Generator Problem
410(4)
Debugging Programs with Arrays
414(1)
Common Programming Errors
414(9)
Chapter Review
414(9)
Packed Arrays and Multidimensional Arrays
423(40)
Strings and Packed Arrays of Characters
424(8)
Using Strings
432(4)
Printing a Form Letter
432(4)
Two-Dimensional Arrays: Arrays of Arrays
436(5)
Processing Two-Dimensional Arrays
441(9)
Analysis of Sales Data
445(5)
Three-Dimensional Arrays
450(4)
Common Programming Errors
454(9)
Chapter Review
455(5)
Interview: Patrick H. Winston
460(3)
Records
463(46)
The Record Data Type
464(3)
Records as Operands and Parameters
467(3)
The with Statement
470(2)
Arrays of Records
472(7)
Hierarchical Records
479(4)
Data Abstraction and Object-Oriented Programming
483(8)
Variant Records (Optional)
491(5)
Common Programming Errors
496(13)
Chapter Review
497(9)
Interview: Adele Goldberg
506(3)
Recursion
509(36)
Recursive Modules
510(6)
Parameter and Local Variable Stacks
516(2)
Recursive Mathematical Functions
518(5)
Recursive Modules with Array Parameters
523(7)
Summing the Values in an Array
523(7)
Binary Search
530(4)
Recursive Binary search
530(4)
Problem Solving with Recursion
534(6)
Towers of Hanoi Problem
536(4)
Debugging Recursive Algorithms
540(1)
Common Programming Erros
540(5)
Chapter Review
541(4)
Sets
545(14)
Set Data Type
546(3)
Set Operators
549(5)
Common Programming Errors
554(5)
Chapter Review
555(4)
External Data Structures: Files
559(28)
Text File ADT and Binary File ADT
560(4)
Creating and Using Binary Files
564(5)
File Merge
569(7)
Merging Two Files
570(6)
File Buffer Variable
576(5)
Common Programming Errors
581(6)
Chapter Review
581(6)
Pointers and Linked Lists
587(34)
Pointer Types and Pointers
588(5)
Manipulating the Heap
593(2)
Linked Lists
595(8)
Linked List ADT
603(11)
Common Programming Errors
614(7)
Chapter Review
615(6)
Dynamic Data Structures
621(76)
Stacks
622(4)
Stack Applications
626(6)
Reversing a Data Line
626(3)
Checking for Balanced Parentheses
629(3)
Queues
632(6)
Binary Trees
638(6)
Binary Search Tree ADT
644(6)
Efficiency of a Binary Search Tree
650(2)
Common Programming Errors
652(5)
Chapter Review
652(5)
APPENDIXES
Appendix A Reserved Words, Standard Identifiers, Operators Functions, and Procedures
657(4)
Appendix B Pascal Syntax Diagrams
661(12)
Appendix C Character Sets
673(2)
Appendix D VAX Pascal Modules
675(4)
Appendix E Turbo Pascal Units
679(4)
Appendix F Using PcPix/MacPix and Dr. Pascal
683(4)
Appendix G Using Turbo Pascal
687(6)
Appendix H Reference Guide to Pascal Constructs
693(4)
Answers to Odd-Numbered Exercises 697(26)
Index 723

Customer Reviews

Average Review:

Post to your social network

     

Most Helpful Customer Reviews

See all customer reviews