did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

We're the #1 textbook rental company. Let us show you why.

9780201754902

Problem Solving and Program Design in C: Updated

by
  • ISBN13:

    9780201754902

  • ISBN10:

    0201754908

  • Edition: 3rd
  • Format: Paperback
  • Copyright: 2001-07-01
  • Publisher: Addison-Wesley
  • View Upgraded Edition
  • Purchase Benefits
  • Free Shipping Icon Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • eCampus.com Logo Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $88.00 Save up to $0.44
  • Buy New
    $87.56
    Add to Cart Free Shipping Icon Free Shipping

    USUALLY SHIPS IN 2-3 BUSINESS DAYS

Supplemental Materials

What is included with this book?

Summary

The Third Edition Update of this best-selling book includes a completely updated On to C++ chapter, a free copy of Borland's Enterprise C compiler, and a new appendix on how to set-up and use this compiler. This text maintains its classic features like the gradual introduction of pointers and the connection between problem solving skills and effective software development. It features early coverage of functions, logical operators, and operators with side effects.

Table of Contents

Overview of Computers and Programming
1(32)
Electronic Computers Then and Now
2(3)
Computer Hardware
5(8)
Computer Software
13(9)
The Software Development Method
22(3)
Applying the Software Development Method
25(8)
Case Study: Converting Miles to Kilometers
26(3)
Chapter Review
29(4)
Overview of C
33(62)
C Language Elements
34(7)
Variable Declarations and Data Types
41(4)
Executable Statements
45(10)
General Form of a C Program
55(4)
Arithmetic Expressions
59(13)
Case Study: Evaluating a Collection of Coins
67(5)
Formatting Numbers in Program Output
72(4)
Interactive Mode, Batch Mode, and Data Files
76(4)
Common Programming Errors
80(15)
Chapter Review
87(8)
Top-Down Design with Functions
95(50)
Building Programs from Existing Information
96(9)
Case Study: Finding the Area and Circumference of a Circle
97(3)
Case Study: Computing the Weight of a Batch of Flat Washers
100(5)
Library Functions
105(7)
Top-Down Design and Structure Charts
112(2)
Case Study: Drawing Simple Diagrams
112(2)
Functions without Arguments
114(11)
Functions with Input Arguments
125(11)
Common Programming Errors
136(9)
Chapter Review
136(9)
Selection Structures: if and switch Statements
145(62)
Control Structures
146(1)
Conditions
146(12)
The if Statement
158(4)
if Statements with Compound Statements
162(4)
Decision Steps in Algorithms
166(10)
Case Study: Water Bill Problem
166(10)
More Problem Solving
176(3)
Case Study: Water Bill with Conservation Requirements
177(2)
Nested if Statements and Multiple-Alternative Decisions
179(11)
The switch Statement
190(6)
Common Programming Errors
196(11)
Chapter Review
197(10)
Repetition and Loop Statements
207(70)
Repetition in Programs
208(2)
Counting Loops and the while Statement
210(4)
Computing a Sum or a Product in a Loop
214(6)
The for Statement
220(9)
Conditional Loops
229(7)
Loop Design
236(7)
Nested Loops
243(5)
The do-while Statement and Flag-Controlled Loops
248(4)
Problem Solving Illustrated
252(5)
Case Study: Computing Radiation Levels
252(5)
How to Debug and Test Programs
257(3)
Common Programming Errors
260(17)
Chapter Review
263(14)
Modular Programming
277(46)
Functions with Simple Output Parameters
278(9)
Multiple Calls to a Function with Input/Output Parameters
287(6)
Scope of Names
293(1)
Formal Output Parameters as Actual Arguments
294(5)
A Program with Multiple Functions
299(11)
Case Study: Arithmetic with Common Fractions
300(10)
Debugging and Testing a Program System
310(3)
Common Programming Errors
313(10)
Chapter Review
314(9)
Simple Data Types
323(40)
Representation and Conversion of Numeric Types
324(7)
Representation and Conversion of Type Char
331(3)
Enumerated Types
334(6)
Iterative Approximations
340(10)
Case Study: Bisection Method for Finding Roots
342(8)
Common Programming Errors
350(13)
Chapter Review
351(12)
Arrays
363(62)
Declaring and Referencing Arrays
364(4)
Array Subscripts
368(2)
Using for Loops for Sequential Access
370(6)
Using Array Elements as Function Arguments
376(3)
Array Arguments
379(14)
Searching and Sorting an Array
393(5)
Multidimensional Arrays
398(5)
Array Processing Illustrated
403(9)
Case Study: Analysis of Sales Data
404(8)
Common Programming Errors
412(13)
Chapter Review
414(11)
Strings
425(64)
String Basics
426(6)
String Library Functions: Assignment and Substrings
432(9)
Longer Strings: Concatenation and Whole-Line Input
441(5)
String Comparison
446(3)
Arrays of Pointers
449(6)
Character Operations
455(6)
String-to-Number and Number-to-String Conversions
461(7)
String Processing Illustrated
468(9)
Case Study: Text Editor
468(9)
Common Programming Errors
477(12)
Chapter Review
479(10)
Recursion
489(50)
The Nature of Recursion
490(5)
Tracing a Recursive Function
495(8)
Recursive Mathematical Functions
503(7)
Recursive Functions with Array and String Parameters
510(6)
Case Study: Finding Capital Letters in a String
510(3)
Case Study: Recursive Selection Sort
513(3)
Problem Solving with Recursion
516(9)
Case Study: Operations on Sets
517(8)
A Classic Case Study in Recursion: Towers of Hanoi
525(5)
Common Programming Errors
530(9)
Chapter Review
532(7)
Structure and Union Types
539(56)
User-Defined Structure Types
540(6)
Structure Type Data as Input and Output Parameters
546(6)
Functions Whose Result Values Are Structured
552(3)
Problem Solving with Structure Types
555(9)
Case Study: A User-Defined Type for Complex Numbers
556(8)
Parallel Arrays and Arrays of Structures
564(12)
Case Study: Universal Measurement Conversion
567(9)
Union Types (Optional)
576(7)
Common Programming Errors
583(12)
Chapter Review
583(12)
Text and Binary File Processing
595(38)
Input/Output Files: Review and Further Study
596(11)
Binary Files
607(7)
Searching a Database
614(10)
Case Study: Database Inquiry
614(10)
Common Programming Errors
624(9)
Chapter Review
625(8)
Programming in the Large
633(44)
Using Abstraction to Manage Complexity
634(3)
Personal Libraries: Header Files
637(5)
Personal Libraries: Implementation Files
642(3)
Storage Classes
645(6)
Modifying Functions for Inclusion in a Library
651(3)
Conditional Compilation
654(4)
Arguments to Functions main
658(3)
Defining Macros with Parameters
661(5)
Common Programming Errors
666(11)
Chapter Review
667(10)
Dynamic Data Structures
677(66)
Pointers
678(4)
Dynamic Memory Allocation
682(7)
Linked Lists
689(6)
Linked List Operators
695(6)
Representing a Stock with a Linked List
701(4)
Representing a Queue with a Linked List
705(6)
Ordered Lists
711(12)
Case Study: Maintaining an Ordered List of Integers
712(11)
Binary Trees
723(11)
Common Programming Errors
734(9)
Chapter Review
734(9)
Onto C++
743(1)
C++ Control Structures, Input/Output, and Functions
744(7)
C++ Support for Object-Oriented Programming
751(15)
Chapter Review
766
Appendixes
A Character Sets
AP1
B ANSI C Standard Libraries
AP3
C C Operators
AP21
D Pointer Arithmetic
AP27
E ANSI C Reserved Words
AP29
Answers A1
Index I1

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program