Joy of C : Programming in C

, by Lawrence H. Miller (The Aerospace Corporation); Alexander E. Quilici (Univ. of Hawaii at Manoa)

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

ISBN: 9780471129332 | 047112933X
Cover: Paperback
Copyright: 1/1/1997

Rent

(Recommended)

$129.02

Term

Due

Price

Semester

Aug 2

$129.02

Quarter

Jul 19

$122.57

Short Term

Jun 21

$116.11

*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 New

Currently Available, Usually Ships in 24-48 Hours

$176.28

Written in a friendly tone, it shows readers how to write clear, concise programs that make maximum use of the power of C. It also details how to put together large programs, how to produce portable and efficient code, and how to use pointers to effectively organize and access data. The text begins with a gentle tutorial overview of C that introduces the basics of C programming. Then each topic is discussed in detail, with complete coverage of advanced data types and advanced program organization. Once the power of C is unveiled, the text arms readers with over 200 useful programs and functions, including a base converter, a histogram producer, and C program cross-references, and more.

PREFACE

Special Features

(2)

Organization

viii

(2)

Using This Book As A Textbook

(1)

Other Uses Of The Text

(1)

The Joy Of C Web Page

xii

(1)

Contacting The Authors

xii

(1)

Changes From The Previous Edition

xii

(2)

Acknowledgments

xiv

Part I A GENTLE INTRODUCTION TO C

(80)

1 GETTING STARTED WITH C

(20)

1.1 AN INTRODUCTION TO C

(1)

1.2 A FIRST C PROGRAM

(2)

The main Program

(1)

The Printf Statement

(1)

1.3 COMPILING AND RUNNING C PROGRAMS

(2)

1.4 IMPROVING OUR INITIAL PROGRAM: COMMENTS

(1)

1.5 FURTHER IMPROVING OUR INITIAL PROGRAM

(3)

Function Prototypes and Include Files

(2)

Return Values

(1)

1.6 A SECOND C PROGRAM

(4)

Variable Declarations

(2)

Assignment Statements

(1)

Formatted Output with printf

(1)

1.7 IMPROVING OUR SECOND PROGRAM

(8)

Defining Constants

(2)

Using Field Widths with printf

(1)

A Word to the Wise

(4)

2 GETTING COMFORTABLE WITH C

(30)

2.1 A PROGRAM TO COMPUTE SIMPLE INTEREST

(4)

Using Some Familiar Features

(1)

The while Loop

(3)

2.2 DEALING WITH COMPILE ERRORS

(3)

2.3 A MORE COMPACT INTEREST COMPUTING PROGRAM

(2)

2.4 EXTENDING OUR INTEREST PROGRAM TO READ VALUES

(4)

Using scanf

(2)

Repeatedly Reading Input

(2)

2.5 A PROGRAM TO PROCESS SCORES

(6)

Another Input-Reading Loop

(1)

The if Statement

(5)

2.6 HANDLING INPUT ERRORS

(5)

2.7 THE ASSIGNMENT OPERATOR

(6)

3 AN INTRODUCTION TO FUNCTIONS

(28)

3.1 WRITING OUR OWN FUNCTIONS

(9)

Creating Functions

(2)

Calling Functions

(1)

Return Values

(2)

Providing Function Prototypes

(1)

Functions without Return Values

(1)

Ignoring Function Return Values

(2)

Functions without Parameters

(1)

3.2 SEPARATE COMPILATION

(9)

Recompiling When Fixing Mistakes

(2)

Reusing Object Modules

(3)

Support for Testing Functions

(1)

3.3 SOME ADDITIONAL FEATURES OF FUNCTIONS

(10)

Part II THE BASICS

(192)

4 NUMBERS

(30)

4.1 IDENTIFIERS AND NAMING CONVENTIONS

(1)

4.2 INTEGERS

(5)

Integer Constants

(1)

Reading and Writing Integers

(3)

4.3 REALS

(5)

4.4 ARITHMETIC OPERATORS

(4)

Signed Integer Arithmetic

(1)

Unsigned Integer Arithmetic

(1)

Floating Point Arithmetic

(1)

Arithmetic Functions

(2)

4.5 TYPE CONVERSIONS

(9)

Assignment Conversions

100

(1)

Arithmetic Conversions

101

(1)

Casts

102

(5)

4.6 CASE STUDY--A BASE CONVERSION PROGRAM

107

(6)

5 CHARACTERS

113

(28)

5.1 REPRESENTING AND STORING CHARACTERS

113

(2)

Character Constants

114

(1)

Formatted Reading and Writing of Characters

114

(1)

5.2 CHARACTERS VERSUS INTEGERS

115

(2)

5.3 CHARACTER INPUT AND OUTPUT

117

(5)

5.4 CHARACTER-TESTING FUNCTIONS

122

(4)

5.5 CONVERTING CHARACTERS INTO NUMBERS

126

(5)

5.6 CASE STUDY--A MORE GENERAL BASE CONVERTER

131

(10)

6 OPERATORS

141

(40)

6.1 OPERATORS, OPERANDS, AND PRECEDENCE

141

(2)

6.2 THE RELATIONAL OPERATORS

143

(4)

6.3 THE LOGICAL OPERATORS

147

(5)

6.4 BITWISE OPERATORS

152

(12)

Bit Shifts

152

(2)

Bitwise Logical Operators

154

(3)

Getting and Setting Bits

157

(3)

Using Exclusive OR

160

(3)

Other Uses of Bitwise Operators

163

(1)

6.5 ASSIGNMENT OPERATORS

164

(4)

Shorthand Assignment Operators

164

(2)

Postfix and Prefix Assignment

166

(2)

6.6 OTHER OPERATORS

168

(6)

The Comma Operator

169

(2)

The Size of Operator

171

(1)

The Conditional Operator

172

(2)

6.7 CASE STUDY--DATA COMPRESSION

174

(7)

7 STATEMENTS

181

(28)

7.1 EXPRESSION STATEMENTS

181

(1)

7.2 COMPOUND STATEMENTS

182

(1)

7.3 SIMPLE DECISIONS--THE IF

183

(3)

7.4 MULTIWAY DECISIONS--THE ELSE-IF

186

(2)

7.5 MULTIWAY DECISIONS--THE SWITCH

188

(5)

7.6 LOOPS

193

(3)

The do-while Statement

193

(1)

The for Statement

193

(3)

7.7 THE NULL STATEMENT

196

(2)

7.8 JUMP STATEMENTS

198

(5)

The break Statement

199

(1)

The contiune Statement

200

(2)

The goto Statement

202

(1)

7.9 CASE STUDY--OCTAL DUMP

203

(6)

8 ARRAYS

209

(24)

8.1 USING ARRAYS--A PROGRAM TO REVERSE ITS INPUT

209

(5)

Preventing Illegal Array Accesses

211

(3)

Using for Loops to Process Arrays

214

(1)

8.2 PASSING ARRAYS AS PARAMETERS

214

(5)

A Function to Read Values into an Array

214

(4)

Arrays and Function Prototypes

218

(1)

Arrays and the sizeof Operator

218

(1)

8.3 SOME EXAMPLE PROGRAMS USING ARRAYS

219

(5)

Searching an Array with Sequential Search

219

(3)

Sorting an Array with Insertion Sort

222

(2)

8.4 CASE STUDY--A HISTOGRAM PRODUCER

224

(9)

9 PROGRAM STRUCTURE

233

(40)

9.1 LOCAL VARIABLES

233

(5)

Concise Variable Declarations

233

(1)

Initializing Local Variables

234

(2)

Declaring Variables within Blocks

236

(2)

9.2 GLOBAL VARIABLES

238

(3)

9.3 STORAGE CLASSES

241

(10)

The Storage Class auto

241

(1)

The Storage Class register

242

(1)

The Storage Class static

243

(3)

The Storage Class extern

246

(5)

9.4 TYPE QUALIFIERS

251

(2)

9.5 USER-DEFINED TYPES

253

(1)

9.6 HEADER FILES

254

(4)

9.7 PRIVATE VARIABLES AND FUNCTIONS

258

(4)

Implementing Queues

258

(3)

Implementing Our Bus Stop Simulator

261

(1)

9.8 CASE STUDY--ABSTRACT DATA TYPES

262

(11)

Implementing Sets

262

(2)

The Set Type and Its Operations

264

(1)

Using Sets

265

(8)

Part III ADVANCED DATA TYPES

273

(154)

10 POINTERS

275

(40)

10.1 POINTERS

275

(4)

Declaring and Obtaining Pointers

275

(1)

Dereferencing Pointer Variables

276

(1)

The Generic Pointer Type

276

(2)

The Null Pointer

278

(1)

10.2 USING POINTERS TO SIMULATE CALL BY REFERENCE

279

(4)

The swap Function

279

(2)

Some Common Mistakes

281

(2)

10.3 TRAVERSING ARRAYS USING POINTERS

283

(9)

Pointer Arithmetic

286

(3)

Pointer Comparison

289

(1)

Concise Pointer Loops

290

(2)

Pointers and Other Types of Arrays

292

(1)

10.4 ARRAY PARAMETERS AND POINTERS

292

(4)

10.5 POINTERS AS FUNCTION RETURN VALUES

296

(1)

10.6 CONSTANTS AND POINTERS

297

(4)

10.7 GENERIC POINTER AND POINTER CONVERSIONS

301

(3)

10.8 DYNAMICALLY ALLOCATING ARRAYS

304

(5)

Allocating Storage with malloc

305

(1)

Deallocating Storage with free

305

(1)

An Example of Dynamic Allocation

305

(2)

Some Common Mistakes

307

(2)

10.9 CASE STUDY--DYNAMICALLY ALLOCATED SETS

309

(6)

11 STRINGS

315

(24)

11.1 STRING CONSTANTS

315

(1)

11.2 STRING VARIABLES

316

(3)

11.3 BUILDING STRINGS FROM THE INPUT

319

(12)

11.4 STRING FUNCTIONS FROM THE STANDARD LIBRARY

319

(12)

Using the Standard String Functions

321

(6)

Implementing the Standard String Functions

327

(1)

Additional String Functions

327

(4)

11.5 USING POINTERS TO TRAVERSE STRINGS

331

(1)

11.6 CASE STUDY--ELIMINATING DUPLICATE LINES

331

(8)

12 CONSTRUCTED TYPES

339

(30)

12.1 STRUCTURES

339

(11)

Defining Structure Types

339

(1)

Declaring Structure Variables

340

(1)

Accessing Structure Fields

341

(1)

Initializing Structures at Compile Time

341

(1)

Structures and Functions

342

(2)

Structures and Operators

344

(1)

Arrays of Structures

345

(5)

12.2 BITFIELDS

350

(3)

12.3 UNIONS

353

(2)

12.4 ENUMERATED TYPES

355

(5)

12.5 CASE STUDY--A DATABASE APPLICATION

360

(9)

Storing the Database

360

(1)

The Database Program

361

(8)

13 ARRAYS OF ARRAYS

369

(32)

13.1 TWO-DIMENSIONAL ARRAYS

369

(3)

Initializing Two-Dimensional Arrays

372

(1)

Storing Two-Dimensioanl Arrays

373

(2)

13.2 POINTERS AND TWO-DIMENSIONAL ARRAYS

375

(9)

Traversing Columns

375

(4)

Traversing Rows

379

(2)

Accessing Rows

381

(3)

13.3 MULTIDIMENSIONAL ARRAYS

384

(4)

N-Dimensioanl Arrays and Parameters

384

(1)

N-Dimensioanl Arrays and Pointers

385

(3)

Initializing N-Dimensioanl Arrays

388

(1)

13.4 CASE SYUDY--THE GAME OF LIFE

388

(13)

An Array-Subscripting Version

390

(4)

A New Version Using Pointers

394

(7)

14 ARRAYS OF POINTERS

401

(26)

14.1 ARRAYS OF POINTERS-RAGGED ARRAYS

401

(9)

Accessing Individual Items

402

(4)

Dynamic String Allocation

406

(4)

14.2 POINTERS AND ARRAYS OF POINTERS

410

(4)

14.3 COMMAND-LINE ARGUMENTS

414

(7)

A Program to Echo Its Arguments

414

(1)

Command-Line Options

415

(6)

14.4 CASE STUDY--SORTING STRINGS

421

(6)

Part IV ADVANCED PROGRAM STRUCTURE

427

(110)

15 THE PREPROCESSOR

429

(32)

15.1 PREPROCESSOR DIRECTIVES

429

(1)

15.2 SIMPLE MACRO SUBSTITUTION

429

(7)

15.3 MACRO SUBSTITUTION WITH PARAMETERS

436

(9)

Using Macros in Macro Definitions

437

(1)

Some Useful Macros

438

(4)

Potential Problems

442

(2)

Macro Operators

444

(1)

Undefining a Name

445

(1)

15.4 FILE INCLUSION

445

(4)

15.5 CONDITIONAL COMPILATION

449

(6)

Other Testing Directives

452

(1)

Predefined Names

453

(2)

15.6 OTHER PREPROCESSOR DIRECTIVES

455

(1)

15.7 CASE STUDY--IMPLEMENTING SETS WITH MACROS

456

(5)

16 FUNCTIONS REVISITED

461

(30)

16.1 PASSING VARIABLE NUMBERS OF ARGUMENTS

461

(6)

Dealing with Differing Argument Types

463

(3)

Built-in Variable Argument Functions

466

(1)

16.2 POINTERS TO FUNCTIONS

467

(7)

16.3 OLD-STYLE DECLARATIONS AND DEFINITIONS

474

(7)

Type-Checking Problems

478

(2)

Automatic Conversions

480

(1)

Prototypes versus Old-Style Declarations

480

(1)

16.4 CASE STUDY--BINARY SEARCH

481

(10)

17 GENERIC FUNCTIONS

491

(26)

17.1 GENERIC LIBRARY FUNCTIONS

491

(9)

The bsearch Library Function

491

(5)

The qsort Library Function

496

(4)

17.2 WRITING GENERIC FUNCTIONS

500

(8)

Implementing a Generic Sequential Search

502

(2)

Implementing a Generic Insertion Sort

504

(4)

17.3 MAKING GENERIC FUNCTIONS EASIER TO USE

508

(3)

17.4 CASE STUDY--IMPLEMENTING A GENERIC BINARY SEARCH

511

(6)

18 COMPLEX DECLARATIONS

517

(20)

18.1 SOME NEW COMPLEX TYPES

517

(5)

Arrays of Pointers to Functions

517

(1)

Functions That Return Pointers to Functions

518

(4)

18.2 CONSTRUCTING TYPE DECLARATIONS

522

(4)

18.3 UNDERSTANDING COMPLEX TYPE DECLARATIONS

526

(2)

18.4 TYPE SPECIFICATIONS

528

(1)

18.5 CASE-STUDY--ENGLISH TO C

529

(8)

Part V C AND THE REAL WORLD

537

(94)

19 EXTERNAL FILES

539

(28)

19.1 ACCESSING EXTERNAL FILES

539

(7)

Character File I/O

541

(2)

Formatted File I/O

543

(1)

Line-Oriented File I/O

544

(2)

19.2 THE STANDARD FILES

546

(2)

19.3 RANDOM FILE ACCESS

548

(2)

19.4 BLOCK INPUT AND OUTPUT

550

(5)

19.5 FILE UPDATING

555

(1)

19.6 CASE STUDY--AN ELECTRONIC ADDRESS BOOK

556

(1)

20 LISTS AND TREES

567

(32)

20.1 LINKED LISTS

567

(12)

Representing Linked Lists

568

(2)

Common Linked-List Operations

570

(1)

Creating an Empty List

570

(3)

Traversing an Existing List

573

(1)

Inserting in a Sorted Linked List

573

(2)

Destroying a Linked List

575

(1)

Sorting Strings Using Linked Lists

575

(2)

Updating a Linked List

577

(2)

20.2 STACKS AND QUEUES--SPECIAL-PURPOSE LISTS

579

(6)

Stacks

580

(1)

Queues

581

(4)

20.3 BINARY SEARCH TREES

585

(6)

Binary Search Tree Operations

586

(1)

Building a Binary Search Tree

586

(2)

Traversing a Binary Search Tree

588

(2)

A Tree Sort Program

590

(1)

20.4 A CASE STUDY--A CROSS-REFERENCE PROGRAM

591

(8)

21 PORTABILITY

599

(32)

21.1 PRINCIPLES OF PORTABILITY

599

(1)

21.2 PORTING ACROSS ANSI-C COMPILERS

600

(1)

21.3 PORTABILITY ACROSS OPERATING SYSTEMS

601

(3)

21.4 MACHINE DEPENDENCIES

604

(9)

Data Type Sizes

604

(1)

Character Set Differences

605

(2)

Sign-Related Problems

607

(3)

Byte Ordering

610

(1)

Byte Alignment Problems

610

(1)

Pointer Problems

610

(2)

Evaluation Order

612

(1)

Libraries and Machines

613

(1)

21.5 PORTING TO NON-ANSI COMPILERS

613

(6)

Dealing with Function Prototypes

615

(1)

Generic Pointers

615

(2)

Missing Header Files

617

(2)

21.6 CASE STUDY--PORTABLE I/O DEVICE HANDLING

619

(12)

Immediate Input

622

(2)

Cursor Control

624

(7)

Part VI MOVING FROM C TO C++

631

(104)

22 C++ BASICS

633

(30)

22.1 COMPILING C PROGRAMS WITH C++ COMPILERS

633

(2)

Function Prototypes

633

(1)

Pointer Usage

634

(1)

Naming Problems

634

(1)

22.2 SIMPLE BUT USEFUL C++ EXTENSIONS TO C

635

(3)

C++ Comments

635

(1)

An Improved const

636

(1)

Variable Declarations

636

(1)

Structure Tags as Type Names

637

(1)

A Boolean Type

637

(1)

22.3 IMPROVEMENTS TO FUNCTIONS

638

(9)

Reference Parameters

639

(1)

Inline Functions

640

(3)

Default Function Parameters

643

(1)

Function Overloading

644

(2)

Operator Overloading

646

(1)

22.4 INPUT AND OUTPUT OPERATORS

647

(4)

Overloading I/O Operators

650

(1)

22.5 STORAGE ALLOCATION AND DEALLOCATION

651

(2)

22.6 CASE STUDY--A FIRST IMPLEMENTATION OF SETS IN C++

653

(10)

Implementing Arrays of Bits

653

(3)

Using Arrays of Bits to Implement Sets

656

(7)

23 ENCAPSULATION WITH CLASSES

663

(38)

23.1 INTRODUCTION TO ENCAPSULATION

663

(1)

23.2 THE BASICS OF CLASSES

664

(7)

Declaring a Class

664

(1)

Using a Class

665

(1)

Defining Class Operations

666

(3)

Constructors

669

(1)

Some More Detail on Private and Public

669

(2)

23.3 SOME MORE FEATURES OF CLASSES

671

(9)

Constructors That Take Parameters

671

(1)

Copy Constructors

672

(3)

Destructors

675

(1)

Assignment Operators

676

(2)

Friend Functions

678

(2)

23.4 LAYERING

680

(2)

Member Initialization Lists

680

(2)

Destructors, Copy Constructors, and Assignment

682

(1)

23.5 USING BUILT-IN CLASSES--ADDITIONAL I/O OPERATORS

682

(6)

Character-at-a-Time I/O

683

(1)

Line-at-a-Time Input and Output

684

(4)

23.6 CONSTANT OBJECTS

688

(1)

23.7 CASE STUDY--A LAYERED IMPLEMENTATION OF SETS

689

(12)

24 INHERITANCE

701

(34)

24.1 A SIMPLE EXAMPLE OF INHERITANCE

701

(1)

24.2 DEFINING INHERITED CLASSES

702

(11)

Defining a Base Class

702

(3)

Deriving a New Class

705

(2)

Defining Derived Class Constructors

707

(2)

Defining Derived Class Operations

709

(1)

More Details on Deriving Classes

710

(3)

Using Our Class Hierarchy

713

(1)

24.3 POLYMORPHISM AND DYNAMIC BINDING

713

(5)

An Example of Dynamic Binding

716

(1)

Why We Need Virtual Destructors

716

(2)

24.4 ABSTRACT BASE CLASSES

718

(3)

24.5 THE INPUT/OUTPUT HIERARCHY

721

(5)

24.6 CASE STUDY--A SIMPLE TEXT-BASED DRAWING LIBRARY

726

(9)

A LIBRARY DETAILS

735

(36)

A.1 THE STANDARD HEADER FILES

735

(1)

A.2 ERROR HANDLING

735

(2)

A.3 THE MATH LIBRARY

737

(1)

A.4 THE STRING LIBRARY

738

(1)

A.5 THE STANDARD C LIBRARY

739

(7)

String Conversion

741

(1)

Random Number Generation

742

(1)

Environment Communication

742

(1)

Integer Arithmetic

743

(2)

Multibyte Characters

745

(1)

A.6 THE STANDARD I/O LIBRARY

746

(10)

Removing and Renaming Files

746

(1)

Temporary Files

746

(1)

Error Detection

747

(1)

Input/Output Redirection

748

(1)

Moving the File Pointer

748

(1)

Putting Characters Back

749

(1)

Controlling Buffering

749

(1)

Formatted Output

749

(5)

Formatted Input

754

(2)

A.7 LOCALES

756

(2)

A.8 SIGNAL HANDLING

758

(4)

A.9 NONLOCAL GOTOS

762

(1)

A.10 TIME FUNCTIONS

763

(8)

B CHARACTER SETS

771

(2)

B.1 THE ASCII CHARACTER SET

771

(1)

B.2 THE EBCDIC CHARACTER SET

772

(1)

INDEX

773

Please wait while the item is added to your bag...

FREE SHIPPING

Amazon no longer offers textbook rentals. We do!

Joy of C : Programming in C

Summary

Table of Contents

Supplemental Materials