Amazon no longer offers textbook rentals. We do!

Pointers on C

by: Reek, Kenneth

Pointers on C

by: Reek, Kenneth

ISBN 13:
9780673999863
ISBN 10:
0673999866
Edition: 1st
Format: Paperback
Copyright: 07/25/1997
Publisher: Pearson

Rent From $89.09

Used From $128.20

New From $164.99

List Price $166.65 Save

Rent $89.09

TERM	PRICE	DUE
SEMESTER	$98.99	Aug 02
QUARTER	$94.04	Jul 18
SHORT TERM	$89.09	Jun 07

Added Benefits of Renting

Free Shipping Both Ways
Highlight/Take Notes Like You Own It
Purchase/Extend Before Due Date

Add to Cart

List Price $166.65 Save $38.45

Used $128.20

Usually Ships in 24-48 Hours

We Buy This Book Back!

Included with your book

Free Shipping On Every Order

Add to Cart

List Price $166.65 Save $1.66

New $164.99

Usually Ships in 2-3 Business Days

We Buy This Book Back!

Included with your book

Free Shipping On Every Order

Add to Cart

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

Extend or Purchase Your Rental at Any Time

Need to keep your rental past your due date? At any time before your due date you can extend or purchase your rental through your account.

Summary

Designed for professionals and advanced students, Pointers on C provides a comprehensive resource for those needing in-depth coverage of the C programming language. An extensive explanation of pointer basics and a thorough exploration of their advanced features allow programmers to incorporate the power of pointers into their C programs. Complete coverage, detailed explanations of C programming idioms, and thorough discussion of advanced topics, makes Pointers on C a valuable tutorial and reference for students and professionals alike.

Preface

Chapter 1: A Quick Start

(24)

1.1 Introduction

(19)

1.1.1 Spacing and Comments

(1)

1.1.2 Preprocessor Directives

(2)

1.1.3 The Main Function

(3)

1.1.4 The read_column_numbers Function

(6)

1.1.5 The rearrange Function

(3)

1.2 Other Capabilities

(1)

1.3 Compiling

(1)

1.4 Summary

(1)

1.5 Summary of Cautions

(1)

1.6 Summary of Programming Tips

(1)

1.7 Questions

(1)

1.8 Programming Exercises

(2)

Chapter 2: Basic Concepts

(14)

2.1 Environments

(4)

2.1.1 Translation

(3)

2.1.2 Execution

(1)

2.2 Lexical Rules

(4)

2.2.1 Characters

(2)

2.2.2 Comments

(1)

2.2.3 Free Form Source Code

(1)

2.2.4 Identifiers

(1)

2.2.5 Form of a Program

(1)

2.3 Program Style

(2)

2.4 Summary

(1)

2.5 Summary of Cautions

(1)

2.6 Summary of Programming Tips

(1)

2.7 Questions

(2)

2.8 Programming Exercises

(1)

Chapter 3: Data

(32)

3.1 Basic Data Types

(8)

3.1.1 The Integer Family

(5)

3.1.2 Floating-Point Types

(1)

3.1.3 Pointers

(2)

3.2 Basic Declarations

(4)

3.2.1 Initialization

(1)

3.2.2 Declaring Simple Arrays

(1)

3.2.3 Declaring Pointers

(2)

3.2.4 Implicit Declarations

(1)

3.3 Typedef

(1)

3.4 Constants

(2)

3.5 Scope

(3)

3.5.1 Block Scope

(2)

3.5.2 File Scope

(1)

3.5.3 Prototype Scope

(1)

3.5.4 Function Scope

(1)

3.6 Linkage

(2)

3.7 Storage Class

(2)

3.7.1 Initialization

(1)

3.8 The Static Keyword

(1)

3.9 Scope, Linkage, and Storage Class Example

(2)

3.10 Summary

(1)

3.11 Summary of Cautions

(1)

3.12 Summary of Programming Tips

(1)

3.13 Questions

(5)

Chapter 4: Statements

(22)

4.1 Empty Statement

(1)

4.2 Expression Statement

(1)

4.3 Statement Blocks

(1)

4.4 If Statement

(2)

4.5 While Statement

(2)

4.5.1 Break and Continue Statements

(1)

4.5.2 Execution of the While

(2)

4.6 For Statement

(2)

4.6.1 Execution of a For

(2)

4.7 Do Statement

(1)

4.8 Switch Statement

(4)

4.8.1 Break in a Switch

(1)

4.8.2 Defaults

(1)

4.8.3 Execution of the Switch

(1)

4.9 Goto Statement

(2)

4.10 Summary

(1)

4.11 Summary of Cautions

(1)

4.12 Summary of Programming Tips

(1)

4.13 Questions

(2)

4.14 Programming Exercises

(4)

Chapter 5: Operators and Expressions

(36)

5.1 Operators

(16)

5.1.1 Arithmetic

(1)

5.1.2 Shifting

(1)

5.1.3 Bitwise

(2)

5.1.4 Assignment

(3)

5.1.5 Unary

100

(3)

5.1.6 Relational

103

(1)

5.1.7 Logical

104

(2)

5.1.8 Conditional

106

(1)

5.1.9 Comma

107

(1)

5.1.10 Subscript, Function Call, and Structure Member

108

(1)

5.2 Boolean Values

109

(2)

5.3 L-values and R-values

111

(1)

5.4 Expression Evaluation

112

(7)

5.4.1 Implicit Type Conversions

112

(1)

5.4.2 Arithmetic Conversions

113

(1)

5.4.3 Properties of Operators

113

(2)

5.4.4 Precedence and Order of Evaluation

115

(4)

5.5 Summary

119

(1)

5.6 Summary of Cautions

120

(1)

5.7 Summary of Programming Tips

121

(1)

5.8 Questions

121

(4)

5.9 Programming Exercises

125

(4)

Chapter 6: Pointers

129

(36)

6.1 Memory and Addresses

129

(2)

6.1.1 Address Versus Contents

130

(1)

6.2 Values and Their Types

131

(1)

6.3 Contents of a Pointer Variable

132

(1)

6.4 Indirection Operator

133

(2)

6.5 Uninitialized and Illegal Pointers

135

(1)

6.6 The Null Pointer

136

(1)

6.7 Pointers, Indirection, and L-values

137

(1)

6.8 Pointers, Indirection, and Variables

138

(1)

6.9 Pointer Constants

138

(1)

6.10 Pointers to Pointers

139

(2)

6.11 Pointer Expressions

141

(7)

6.12 Examples

148

(4)

6.13 Pointer Arithmetic

152

(5)

6.13.1 Arithmetic Operations

153

(3)

6.13.2 Relational Operations

156

(1)

6.14 Summary

157

(2)

6.15 Summary of Cautions

159

(1)

6.16 Summary of Programming Tips

159

(1)

6.17 Questions

159

(3)

6.18 Programming Exercises

162

(3)

Chapter 7: Functions

165

(32)

7.1 Function Definition

165

(3)

7.1.1 Return Statement

167

(1)

7.2 Function Declaration

168

(4)

7.2.1 Prototypes

168

(3)

7.2.2 Default Function Assumptions

171

(1)

7.3 Function Arguments

172

(4)

7.4 ADTs and Black Boxes

176

(3)

7.5 Recursion

179

(10)

7.5.1 Tracing a Recursive Function

181

(4)

7.5.2 Recursion versus Iteration

185

(4)

7.6 Variable Argument Lists

189

(3)

7.6.1 The stdarg Macros

190

(1)

7.6.2 Limitations of Variable Arguments

190

(2)

7.7 Summary

192

(2)

7.8 Summary of Cautions

194

(1)

7.9 Summary of Programming Tips

194

(1)

7.10 Questions

194

(1)

7.11 Programming Exercises

195

(2)

Chapter 8: Arrays

197

(46)

8.1 One-Dimensional Arrays

197

(18)

8.1.1 Array Names

197

(2)

8.1.2 Subscripts

199

(3)

8.1.3 Pointers versus Subscripts

202

(1)

8.1.4 Pointer Efficiency

203

(7)

8.1.5 Arrays and Pointers

210

(1)

8.1.6 Array Names as Function Arguments

210

(2)

8.1.7 Declaring Array Parameters

212

(1)

8.1.8 Initialization

213

(1)

8.1.9 Incomplete Initialization

214

(1)

8.1.10 Automatic Array Sizing

214

(1)

8.1.11 Character Array Initialization

215

(1)

8.2 Multidimensional Arrays

215

(12)

8.2.1 Storage Order

216

(2)

8.2.2 Array Names

218

(1)

8.2.3 Subscripts

218

(3)

8.2.4 Pointers to Arrays

221

(2)

8.2.5 Multidimensional Arrays as Function Arguments

223

(1)

8.2.6 Initialization

224

(3)

8.2.7 Automatic Array Sizing

227

(1)

8.3 Arrays of Pointers

227

(4)

8.4 Summary

231

(1)

8.5 Summary of Cautions

232

(1)

8.6 Summary of Programming Tips

232

(1)

8.7 Questions

233

(4)

8.8 Programming Exercises

237

(6)

Chapter 9: Strings, Characters, and Bytes

243

(26)

9.1 String Basics

243

(1)

9.2 String Length

244

(1)

9.3 Unrestricted String Functions

245

(3)

9.3.1 Copying Strings

245

(1)

9.3.2 Concatenating Strings

246

(1)

9.3.3 Function Return Value

247

(1)

9.3.4 String Comparisons

247

(1)

9.4 Length-Restricted String Functions

248

(2)

9.5 Basic String Searching

250

(1)

9.5.1 Finding a Character

250

(1)

9.5.2 Finding Any of Several Characters

250

(1)

9.5.3 Finding a Substring

251

(1)

9.6 Advanced String Searching

251

(4)

9.6.1 Finding String Prefixes

251

(2)

9.6.2 Finding Tokens

253

(2)

9.7 Error Messages

255

(1)

9.8 Character Operations

255

(2)

9.8.1 Character Classification

255

(1)

9.8.2 Character Transformation

256

(1)

9.9 Memory Operations

257

(1)

9.10 Summary

258

(2)

9.11 Summary of Cautions

260

(1)

9.12 Summary of Programming Tips

260

(1)

9.13 Questions

261

(1)

9.14 Programming Exercises

262

(7)

Chapter 10: Structures and Unions

269

(34)

10.1 Structure Basics

269

(7)

10.1.1 Structure Declarations

270

(2)

10.1.2 Structure Members

272

(1)

10.1.3 Direct Member Access

272

(1)

10.1.4 Indirect Member Access

273

(1)

10.1.5 Self-Referential Structures

274

(1)

10.1.6 Incomplete Declarations

275

(1)

10.1.7 Initializing Structures

276

(1)

10.2 Structures, Pointers, and Members

276

(7)

10.2.1 Accessing the Pointer

277

(1)

10.2.2 Accessing the Structure

278

(1)

10.2.3 Accessing Structure Members

279

(2)

10.2.4 Accessing a Nested Structure

281

(1)

10.2.5 Accessing a Pointer Member

282

(1)

10.3 Structure Storage Allocation

283

(2)

10.4 Structures as Function Arguments

285

(3)

10.5 Bit Fields

288

(3)

10.6 Unions

291

(4)

10.6.1 Variant Records

293

(1)

10.6.2 Initializing Unions

294

(1)

10.7 Summary

295

(1)

10.8 Summary of Cautions

296

(1)

10.9 Summary of Programming Tips

296

(1)

10.10 Questions

296

(4)

10.11 Programming Exercises

300

(3)

Chapter 11: Dynamic Memory Allocation

303

(18)

11.1 Why Use Dynamic Allocation

303

(1)

11.2 Malloc and Free

304

(1)

11.3 Calloc and Realloc

305

(1)

11.4 Using Dynamically Allocated Memory

306

(1)

11.5 Common Dynamic Memory Errors

307

(3)

11.5.1 Memory Leaks

309

(1)

11.6 Memory Allocation Examples

310

(7)

11.7 Summary

317

(1)

11.8 Summary of Cautions

318

(1)

11.9 Summary of Programming Tips

318

(1)

11.10 Questions

318

(1)

11.11 Programming Exercises

319

(2)

Chapter 12: Using Structures and Pointers

321

(30)

12.1 Linked Lists

321

(1)

12.2 Singly Linked Lists

321

(13)

12.2.1 Inserting into a Singly Linked List

322

(12)

12.2.2 Other List Operations

334

(1)

12.3 Doubly Linked Lists

334

(11)

12.3.1 Inserting into a Doubly Linked List

335

(10)

12.3.2 Other List Operations

345

(1)

12.4 Summary

345

(1)

12.5 Summary of Cautions

346

(1)

12.6 Summary of Programming Tips

346

(1)

12.7 Questions

346

(1)

12.8 Programming Exercises

347

(4)

Chapter 13: Advanced Pointer Topics

351

(32)

13.1 More Pointers to Pointers

351

(2)

13.2 Advanced Declarations

353

(3)

13.3 Pointers to Functions

356

(6)

13.3.1 Callback Functions

357

(3)

13.3.2 Jump Tables

360

(2)

13.4 Command Line Arguments

362

(7)

13.4.1 Passing Command Line Arguments

363

(2)

13.4.2 Processing Command Line Arguments

365

(4)

13.5 String Literals

369

(3)

13.6 Summary

372

(1)

13.7 Summary of Cautions

373

(1)

13.8 Summary of Programming Tips

373

(1)

13.9 Questions

373

(4)

13.10 Programming Exercises

377

(6)

Chapter 14: The Preprocessor

383

(26)

14.1 Predefined Symbols

383

(1)

14.2 #define

384

(10)

14.2.1 Macros

385

(3)

14.2.2 #define Substitution

388

(1)

14.2.3 Macros versus Functions

389

(1)

14.2.4 Macro Arguments with Side Effects

390

(1)

14.2.5 Naming Conventions

391

(1)

14.2.6 #undef

392

(1)

14.2.7 Command Line Definitions

393

(1)

14.3 Conditional Compilation

394

(3)

14.3.1 If Defined

395

(1)

14.3.2 Nested Directives

396

(1)

14.4 File Inclusion

397

(4)

14.4.1 Library Includes

398

(1)

14.4.2 Local Includes

398

(1)

14.4.3 Nested File Inclusion

399

(2)

14.5 Other Directives

401

(1)

14.6 Summary

402

(1)

14.7 Summary of Cautions

403

(1)

14.8 Summary of Programming Tips

403

(1)

14.9 Questions

404

(2)

14.10 Programming Exercises

406

(3)

Chapter 15: Input/Output Functions

409

(44)

15.1 Error Reporting

409

(1)

15.2 Terminating Execution

410

(1)

15.3 The Standard I/O Library

411

(1)

15.4 ANSI I/O Concepts

411

(4)

15.4.1 Streams

412

(1)

15.4.2 FILEs

413

(1)

15.4.3 Standard I/O Constants

414

(1)

15.5 Overview of Stream I/O

415

(5)

15.6 Opening Streams

416

(2)

15.7 Closing Streams

418

(2)

15.8 Character I/O

420

(3)

15.8.1 Character I/O Macros

421

(1)

15.8.2 Undoing Character I/O

421

(2)

15.9 Unformatted Line I/O

423

(2)

15.10 Formatted Line I/O

425

(11)

15.10.1 The scanf Family

425

(1)

15.10.2 scanf Format Codes

426

(4)

15.10.3 The printf Family

430

(3)

15.10.4 printf Format Codes

433

(3)

15.11 Binary I/O

436

(2)

15.12 Flushing and Seeking Functions

438

(2)

15.13 Changing the Buffering

440

(1)

15.14 Stream Error Functions

441

(1)

15.15 Temporary Files

442

(1)

15.16 File Manipulation Functions

442

(1)

15.17 Summary

443

(3)

15.18 Summary of Cautions

446

(1)

15.19 Summary of Programming Tips

446

(1)

15.20 Questions

446

(2)

15.21 Programming Exercises

448

(5)

Chapter 16: Standard Library

453

(40)

16.1 Integer Functions

453

(4)

16.1.1 Arithmetic stdlib.h

453

(1)

16.1.2 Random Numbers stdlib.h

454

(1)

16.1.3 String Conversion stdlib.h

455

(2)

16.2 Floating-Point Functions

457

(4)

16.2.1 Trigonometry math.h

458

(1)

16.2.2 Hyperbolic math.h

458

(1)

16.2.3 Logarithm and Exponent math.h

458

(1)

16.2.4 Floating-Point Representation math.h

459

(1)

16.2.5 Power math.h

459

(1)

16.2.6 Floor, Ceiling, Absolute Value, and Remainder math.h

460

(1)

16.2.7 String Conversion stdlib.h

460

(1)

16.3 Date and Time Functions

461

(4)

16.3.1 Processor Time time.h

461

(1)

16.3.2 Time of Day time.h

462

(3)

16.4 Nonlocal Jumps setjmp.h

465

(4)

16.4.1 Example

466

(2)

16.4.2 When to Use Nonlocal Jumps

468

(1)

16.5 Signals

469

(5)

16.5.1 Signal Names signal.h

469

(1)

16.5.2 Processing Signals signal.h

470

(2)

16.5.3 Signal Handlers

472

(2)

16.6 Printing Variable Argument Lists stdarg.h

474

(1)

16.7 Execution Environment

474

(3)

16.7.1 Terminating Execution stdlib.h

475

(1)

16.7.2 Assertions assert.h

475

(2)

16.7.3 The Environment stdlib.h

477

(1)

16.7.4 Executing System Commands stdlib.h

477

(1)

16.8 Sorting and Searching stdlib.h

477

(3)

16.9 Locales

480

(5)

16.9.1 Numeric and Monetary Formatting locale.h

481

(3)

16.9.2 Strings and Locales string.h

484

(1)

16.9.3 Effects of Changing the Locale

485

(1)

16.10 Summary

485

(2)

16.11 Summary of Cautions

487

(1)

16.12 Summary of Programming Tips

488

(1)

16.13 Questions

488

(2)

16.14 Programming Exercises

490

(3)

Chapter 17: Classic Abstract Data Types

493

(44)

17.1 Memory Allocation

493

(1)

17.2 Stacks

494

(11)

17.2.1 Stack Interface

494

(1)

17.2.2 Implementing a Stack

494

(11)

17.3 Queues

505

(7)

17.3.1 Queue Interface

505

(2)

17.3.2 Implementing a Queue

507

(5)

17.4 Trees

512

(14)

17.4.1 Insertions into a Binary Search Tree

513

(1)

17.4.2 Deletions from a Binary Search Tree

514

(1)

17.4.3 Searching a Binary Search Tree

514

(1)

17.4.4 Tree Traversals

515

(1)

17.4.5 Binary Search Tree Interface

516

(1)

17.4.6 Implementing a Binary Search Tree

516

(10)

17.5 Improvements in Implementation

526

(5)

17.5.1 Having More Than One Stack

526

(1)

17.5.2 Having More Than One Type

526

(1)

17.5.3 Name Clashes

527

(1)

17.5.4 Standard Libraries of ADTs

528

(3)

17.6 Summary

531

(1)

17.7 Summary of Cautions

532

(1)

17.8 Summary of Programming Tips

533

(1)

17.9 Questions

533

(2)

17.10 Programming Exercises

535

(2)

Chapter 18: Runtime Environment

537

(24)

18.1 Determining the Runtime Environment

537

(7)

18.1.1 Test Program

539

(2)

18.1.2 Static Variables and Initialization

541

(1)

18.1.3 The Stack Frame

542

(1)

18.1.4 Register Variables

543

(2)

18.1.5 Length of External Identifiers

545

(1)

18.1.6 Determining the Stack Frame Layout

545

(7)

18.1.7 Expression Side Effects

552

(2)

18.2 Interfacing With Assembly Language

554

(1)

18.3 Runtime Efficiency

555

(4)

18.3.1 Improving Efficiency

556

(3)

18.4 Summary

559

(1)

18.5 Summary of Cautions

559

(1)

18.6 Summary of Programming Tips

560

(1)

18.7 Questions

560

(1)

18.8 Programming Exercises

560

(1)

Appendix: Selected Problem Solutions

561

Amazon no longer offers textbook rentals. We do!

Pointers on C

Pointers on C

9780673999863

0673999866

Summary

Author Biography

Table of Contents

Supplemental Materials

Excerpts

Write a Review