Pascal

, by Leestma, Sanford; Nyhoff, Larry

Write a Review

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

ISBN: 9780023887314 | 0023887311
Cover: Paperback
Copyright: 1/1/1993

Rent

(Recommended)

$137.09

Term

Due

Price

Semester

Dec 12

$144.30

Quarter

Aug 13

$137.09

Short Term

Jul 16

$129.87

*This item is part of an exclusive publisher rental program and requires an additional convenience fee. This fee will be reflected in the shopping cart.
Buy Used

Usually Ships in 2-4 Business Days

$137.30
Buy New

Currently Available, Usually Ships in 24-48 Hours

$184.74

Supplemental Materials

The Computer Science Picture

(28)

Part of The Picture: The History of Computing

(13)

The Mechanization of Arithmetic

(4)

The Stored Program Concept

(1)

Mechanical Computers

(2)

Early Electronic Computers

(2)

Modern Computers

(1)

Computer Software

(2)

Summary

(1)

Part of The Picture: Computer Organization

(13)

Computing Systems

(1)

Memory Organization

(1)

Number Systems

(2)

Data Storage

(4)

Instruction Processing

(2)

Exercises

(4)

Program Development

(34)

Problem Analysis and Specification

(2)

Calculating Revenue

(1)

Pollution Index

(1)

Mean Time to Failure

(1)

Design

(5)

Calculating Revenue---Sequential Structure

(1)

Pollution Index---Selection Structure

(1)

Mean Time to Failure---Repetition Structure

(2)

Coding

(4)

Variables

(1)

Types

(1)

Operations

(1)

Input/Output

(1)

Comments

(1)

Program Composition

(2)

Verification and Validation

(3)

Software Engineering

(7)

Problem Analysis and Specification

(1)

Design

(2)

Program Coding

(2)

Program Execution and Testing

(1)

Maintenance

(1)

Part of The Picture: Social, Professional, and Ethical Issues

(11)

Exercises

(7)

Basic Pascal

(52)

Data Types + Algorithms = Programs

(1)

Constants and Variables

(7)

Constants

(2)

Identifiers

(1)

Named Constants

(1)

Variables

(2)

Exercises

(1)

Arithmetic Operations and Functions

(5)

Operations

(3)

Functions

(1)

Exercises

(1)

The Assignment Statement

(5)

Exercises

(1)

Input/Output

(16)

Program Heading

(1)

Output

(3)

Format Descriptors

(4)

Input

(5)

Exercises

(2)

Program Composition

(2)

Pascal Program

(1)

Program Heading

(1)

Declaration Part

(1)

Constant Section

(1)

Variable Section

(1)

Statement Part

(1)

Comments

100

(1)

Example: Truck Fleet Accounting

100

(2)

Problem

100

(1)

Specification

100

(1)

Design

100

(1)

Coding and Testing

101

(1)

Part of The Picture: Syntax and Semantics

102

(13)

Exercises

106

(3)

Programming Pointers

109

(1)

Program Design

109

(1)

Potential Problems

110

(3)

Program Style

113

(1)

Variations and Extensions

113

(2)

Structured Programming

115

(52)

Sequential Structure: Compound Statements; BEGIN and END

116

(2)

Compound Statements

117

(1)

The Boolean Data Type

118

(5)

Simple Boolean Expressions

119

(1)

The Effect of Roundoff Errors

120

(1)

Compound Boolean Expressions

121

(2)

Example: Logical Circuits

123

(6)

Exercises

126

(3)

Selection Structure: The IF Statement

129

(14)

Simple IF Statement

129

(2)

General IF Statement

131

(1)

Example: Pollution Index Problem

132

(1)

Example: Grade Calculation---Version 1

133

(2)

Example: Grade Calculation---Version 2

135

(3)

IF-ELSE IF Construct

138

(1)

Example: Grade Calculation---Version 3

139

(3)

Exercises

142

(1)

Repetition Structure: The WHILE Statement

143

(6)

Example: Summation

145

(2)

Sentinel-Controlled While Loops

147

(1)

Example: Calculating the Mean Time to Failure

147

(2)

Program Testing and Debugging Techniques: An Example

149

(18)

An Example

150

(2)

Trace Tables

152

(1)

Debugging Statements

152

(1)

Modifying and Testing the Program

153

(2)

Summary

155

(1)

Exercises

156

(3)

Programming Pointers

159

(1)

Program Design

159

(1)

Potential Problems

160

(4)

Program Style

164

(2)

Variations and Extensions

166

(1)

Modular Design

167

(94)

Introduction to Procedures and Modular Design

168

(8)

Exercises

175

(1)

Procedures with Parameters

176

(13)

Value (In) Parameters

177

(6)

Variable (In--Out) Parameters

183

(6)

Rules for Parameter Association

189

(1)

More Examples of Procedures

189

(8)

Example 1: Displaying a Date

189

(4)

Example 2: Making Change

193

(4)

Example of Modular Programming: Menu-Driven Checkbook-Balancing Program

197

(14)

Problem: Checkbook Reconciliation

197

(1)

Specification

198

(1)

Design Plan

198

(3)

Coding and Testing

201

(6)

Maintenance

207

(1)

Exercises

208

(3)

Functions

211

(11)

Example: Cubes of Numbers

213

(2)

Example: Rounding Amounts to the Nearest Cent

215

(1)

Example: Maximum of Two Integers

215

(1)

Example: Pass--Fail Grades

215

(2)

Example: Sum of Digits

217

(1)

Functions Versus Procedures

218

(1)

Exercises

219

(3)

Scope Rules

222

(11)

Fundamental Scope Principle

222

(1)

Scope Rule for Local Entities

222

(2)

Scope Rule for Global Entities

224

(1)

Scope Rule for Nested Subprograms

225

(5)

Scope Rule for Subprograms at the Same Level

230

(1)

Exercises

231

(2)

Top--Down Design

233

(28)

Problem: Academic Eligibility

234

(1)

Specification

234

(1)

Design Plan

234

(5)

Coding and Testing

239

(17)

Exercises

256

(1)

Programming Pointers

257

(1)

Program Design

257

(1)

Potential Problems

257

(3)

Program Style

260

(1)

Variations and Extensions

260

(1)

Data Files

261

(40)

Input/Output Procedures

262

(11)

Procedure writeln

262

(1)

Procedure write

263

(1)

Procedure readln

264

(1)

The file input

264

(3)

Procedure read

267

(1)

Reading Character Data

268

(2)

Reading Mixed Data

270

(1)

Exercises

271

(2)

Text Files

273

(17)

Input Files

274

(1)

Declaring Text Files

274

(1)

Opening an Input File

275

(1)

Reading from a File

276

(1)

End-of-File While Loops: The eof Function

277

(2)

Output Files

279

(1)

Opening a File for Output

280

(1)

Writing to a File

281

(2)

Files as Parameters

283

(4)

The End-of-Line Function eoln

287

(3)

Part of The Picture: Databases

290

(11)

Exercises

292

(2)

Programming Pointers

294

(1)

Program Design

294

(1)

Potential Problems

295

(5)

Variations and Extensions

300

(1)

Other Control Structures

301

(88)

Multialternative Selection Structure: The CASE Statement

302

(7)

Form of the CASE Statement

302

(2)

Examples of CASE Statements

304

(1)

Example: Assigning Letter Grades

305

(2)

Exercises

307

(2)

Repetition Structure: The FOR Statement

309

(7)

Example: A Table of Squares

313

(1)

Some Rules for FOR Statements

314

(1)

Example: A Multiplication Table

315

(1)

Repetition Structure: The REPEAT-UNTIL Statement

316

(4)

Form of a REPEAT-UNTIL Statement

317

(1)

Example: Calculating the Mean Time to Failure

318

(2)

Example: Depreciation Tables, Compound Interest, Simulation

320

(21)

Example 1: Depreciation Tables

321

(6)

Example 2: Compound Interest

327

(4)

Example 3: Simulation

331

(4)

Exercises

335

(6)

Part of The Picture: Numeric Computation

341

(17)

Curve Fitting: Least Squares Line

342

(4)

Solving Equations

346

(3)

Numerical Integration

349

(4)

Exercises

353

(5)

Introduction to Recursion

358

(18)

Exercises

372

(4)

Part of The Picture: Artificial Intelligence

376

(4)

Exercises

379

(1)

Functions and Procedures as Parameters

380

(9)

Programming Pointers

383

(1)

Program Design

383

(1)

Potential Problems

384

(3)

Program Style

387

(1)

Variations and Extensions

388

(1)

Ordinal Data Types: Enumerated and Subrange

389

(26)

Part of The Picture: Data Structures and Data Types

390

(1)

The Type Section

391

(2)

Enumerated Data Types

393

(11)

Defining an Enumerated Type

394

(1)

Operations on Enumerated Types

395

(2)

Example: A Package for the Data Type DaysOfWeek

397

(7)

Subrange Data Types

404

(11)

Defining a Subrange Type

404

(1)

An Octal Calculator

405

(4)

Exercises

409

(1)

Programming Pointers

410

(1)

Program Design

410

(1)

Potential Problems

411

(2)

Variations and Extensions

413

(2)

One-Dimensional Arrays

415

(68)

Introduction to Arrays: Indexed Variables

416

(8)

Problem

416

(3)

Arrays

419

(3)

Array Declarations

422

(1)

Address Translation

423

(1)

List Processing Using One-Dimensional Arrays

424

(9)

Example

424

(5)

Array Assignment

429

(1)

Arrays as Parameters

430

(2)

Some Limitations

432

(1)

Example: Frequency Distributions; Class Averages

433

(16)

Example 1: Frequency Distributions

433

(6)

Example 2: Class Averages

439

(5)

Exercises

444

(5)

Part of The Picture: Sorting and Searching

449

(19)

Sorting: Simple Selection Sort

449

(5)

Sorting: Quicksort

454

(4)

Searching: Linear Search

458

(1)

Searching: Binary Search

459

(6)

Exercises

465

(3)

Part of The Picture: Analysis of Algorithms

468

(15)

Exercises

474

(3)

Programming Pointers

477

(1)

Program Design

477

(1)

Potential Problems

478

(4)

Variations and Extensions

482

(1)

Strings

483

(46)

The String ADT

484

(1)

A String Package for Standard Pascal

485

(11)

Storage Structure

485

(2)

Algorithms for the Basic Operations

487

(9)

The Predefined Data Type String in Turbo and Other Pascals

496

(6)

Example: Text Editing; Sorting Names

502

(17)

Example 1: Text Editing

502

(7)

Example 2: Sorting Names

509

(5)

Exercises

514

(5)

Part of The Picture: Data Encryption

519

(10)

Exercises

526

(1)

Programming Pointers

527

(1)

Program Design

527

(1)

Potential Problems

527

(1)

Variations and Extensions

528

(1)

Multidimensional Arrays

529

(52)

Introduction to Multidimensional Arrays; Multiply Indexed Variables

530

(7)

Processing Multidimensional Arrays

537

(5)

Examples: Automobile Sales, Inventory Control

542

(20)

Example 1: Automobile Sales

542

(6)

Example 2: Inventory Control

548

(7)

Exercises

555

(7)

Part of The Picture: Numeric Computation

562

(10)

Matrix Multiplication

562

(5)

Solving Linear Systems

567

(2)

Exercises

569

(3)

Part of The Picture: Computer Graphics

572

(9)

Plotting Graphs

572

(2)

Density Plots

574

(2)

Exercises

576

(1)

Programming Pointers

577

(1)

Program Design

577

(1)

Potential Problems

577

(2)

Variations and Extensions

579

(2)

Records

581

(56)

Introduction to Records and Fields

582

(3)

Record Declarations

582

(2)

Accessing Fields in a Record

584

(1)

Nested Records

584

(1)

Processing Records

585

(9)

Assigning Values to Fields in a Record

585

(1)

Example: Processing Student Records

586

(5)

Record Assignment

591

(1)

Records as Parameters

591

(1)

Example: Equations of Lines

591

(3)

The WITH Statement

594

(6)

Nested WITHs

595

(2)

Example: Processing Student Records---Version 2

597

(3)

When Not to Use WITH

600

(1)

Example: Grading on the Curve and Sorting an Array of Records

600

(8)

Part of The Picture: Databases

608

(6)

Information Retrieval

608

(6)

Variant Records

614

(23)

Examples of Variant Records

614

(4)

General Form of Record Declarations

618

(2)

Example: Processing Employee Records

620

(6)

Exercises

626

(5)

Programming Pointers

631

(1)

Program Design

631

(1)

Potential Problems

632

(3)

Program Style

635

(1)

Variations and Extensions

636

(1)

ADTs and OOP

637

(40)

Introduction to Stacks

638

(4)

Four Problems

638

(2)

A LIFO Structure: the Stack

640

(2)

Implementing Stacks with Arrays and Records

642

(11)

Storage Structure

642

(2)

Algorithms for the Basic Stack Operations

644

(1)

A Stacks Package in Standard Pascal

645

(4)

A Stacks Unit

649

(3)

Exercises

652

(1)

Part of The Picture: Programming Languages

653

(8)

Compilers

653

(1)

Reverse Polish Notation

654

(4)

Exercises

658

(3)

Queues

661

(5)

Examples of Queues in Computer Systems

661

(1)

Implementing Queues

662

(3)

Exercises

665

(1)

Introduction to OOP (Object-Oriented Programming)

666

(11)

Example: Employee Records as Objects

667

(2)

Example: Stacks as Objects

669

(4)

Example: Priority Queues

673

(2)

Exercises

675

(2)

Sets

677

(34)

Set Declarations, Set Values, and Set Assignments

678

(4)

Set Declarations

678

(2)

Set Values

680

(1)

Empty Set

681

(1)

Set Assignment

681

(1)

Set Relations and Operations

682

(6)

The Membership Relation

682

(1)

The Subset and Superset Relations

683

(1)

The Equality Relation

684

(1)

Set Operations

684

(4)

Processing Sets

688

(4)

Example: Checking Major Program Requirements

692

(6)

Part of The Picture: Programming Languages

698

(13)

Compilers

698

(3)

Finite State Automata and Lexical Analysis

701

(4)

Exercises

705

(3)

Programming Pointers

708

(1)

Program Design

708

(1)

Potential Problems

709

(1)

Variations and Extensions

710

(1)

Files

711

(42)

Review of Text Files

712

(2)

Binary Files

714

(24)

File Declarations

714

(1)

Data Representation in Binary Files

715

(1)

Writing to a Binary File

716

(1)

Example: Creating a File of Computer Usage Records

717

(2)

File Output and File Buffer Variables

719

(2)

Example: Creating a File of Computer Usage Records (Version 2)

721

(2)

Reading from a Binary File

723

(1)

Example: Reading Records from UsersFile

723

(2)

File Input and File Buffer Variables

725

(2)

Example: Reading Records from UsersFile (Version 2)

727

(1)

Example: Creating and Verifying a Binary File of Computer Usage Records

728

(3)

The eoln and eof Functions

731

(1)

Files as Parameters

731

(1)

Example: Appending Data to a File

732

(3)

Exercises

735

(3)

Part of The Picture: Databases

738

(15)

Updating a Sequential File

738

(4)

Mergesort

742

(5)

Updating Direct Access Files

747

(1)

Indexed Files

748

(1)

Exercises

749

(2)

Programming Pointers

751

(1)

Variations and Extensions

752

(1)

Pointers and Linked Structures

753

(190)

Introduction to Linked Lists

754

(6)

Inserting New Elements into a Linked List

755

(2)

Deleting Elements from a Linked List

757

(2)

Summary

759

(1)

Exercises

759

(1)

Pointers; The Procedures new and dispose

760

(6)

Pointer Variables

760

(1)

The Procedure new

761

(1)

Nil Pointers

762

(1)

Operations on Pointers

762

(2)

Dereferencing Pointers

764

(1)

The Procedure dispose

765

(1)

Implementing Linked Lists

766

(12)

Linked List Declarations

766

(1)

Creating an Empty Linked List

767

(1)

Checking if a Linked List is Empty

768

(1)

Adding Elements at the Front of a Linked List

768

(1)

Traversing a Linked List

769

(2)

Example: Reversing a String

771

(3)

Exercises

774

(4)

FREE SHIPPING

Rent More, Save More! Use code: BBRENTAL

5% off 1 book, 7% off 2 books, 10% off 3+ books

Pascal

Table of Contents

Supplemental Materials

FREE SHIPPING

Rent More, Save More! Use code: BBRENTAL

5% off 1 book, 7% off 2 books, 10% off 3+ books

Pascal

Table of Contents

Supplemental Materials

Digital License