book

C++ How to Program, Ninth Edition

by Paul Deitel, Harvey Deitel

February 2013

Beginner to intermediate

1080 pages

47h 53m

English

Pearson

Read now

Unlock full access

How To Program SeriesSimply SeriesCourseSmart Web BooksDeitel® Developer SeriesLiveLessons Video Learning Products
C++11 StandardObject-Oriented ProgrammingPedagogic FeaturesOther FeaturesSecure C++ ProgrammingOnline ContentDependency ChartTeaching ApproachObtaining the Software Used in C++ How to Program, 9/eInstructor SupplementsOnline Practice and Assessment with MyProgrammingLab™AcknowledgmentsAbout the AuthorsCorporate Training from Deitel & Associates, Inc.
1.1. Introduction1.2. Computers and the Internet in Industry and Research1.3. Hardware and Software1.4. Data Hierarchy1.5. Machine Languages, Assembly Languages and High-Level Languages1.6. C++1.7. Programming Languages1.8. Introduction to Object Technology1.9. Typical C++ Development Environment1.10. Test-Driving a C++ Application1.11. Operating Systems1.12. The Internet and World Wide Web1.13. Some Key Software Development Terminology1.14. C++11 and the Open Source Boost Libraries1.15. Keeping Up to Date with Information Technologies1.16. Web ResourcesSelf-Review ExercisesAnswers to Self-Review ExercisesExercisesMaking a DifferenceMaking a Difference Resources
2.1. Introduction2.2. First Program in C++: Printing a Line of Text2.3. Modifying Our First C++ Program2.4. Another C++ Program: Adding Integers2.5. Memory Concepts2.6. Arithmetic2.7. Decision Making: Equality and Relational Operators2.8. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesMaking a Difference
3.1. Introduction3.2. Defining a Class with a Member Function3.3. Defining a Member Function with a Parameter3.4. Data Members, set Member Functions and get Member Functions3.5. Initializing Objects with Constructors3.6. Placing a Class in a Separate File for Reusability3.7. Separating Interface from Implementation3.8. Validating Data with set Functions3.9. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesMaking a Difference
4.1. Introduction4.2. Algorithms4.3. Pseudocode4.4. Control Structures4.5. if Selection Statement4.6. if...else Double-Selection Statement4.7. while Repetition Statement4.8. Formulating Algorithms: Counter-Controlled Repetition4.9. Formulating Algorithms: Sentinel-Controlled Repetition4.10. Formulating Algorithms: Nested Control Statements4.11. Assignment Operators4.12. Increment and Decrement Operators4.13. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesMaking a Difference

5.1. Introduction5.2. Essentials of Counter-Controlled Repetition5.3. for Repetition Statement5.4. Examples Using the for Statement5.5. do...while Repetition Statement5.6. switch Multiple-Selection Statement5.7. break and continue Statements5.8. Logical Operators5.9. Confusing the Equality (==) and Assignment (=) Operators5.10. Structured Programming Summary5.11. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesMaking a Difference
6.1. Introduction6.2. Program Components in C++6.3. Math Library Functions6.4. Function Definitions with Multiple Parameters6.5. Function Prototypes and Argument Coercion6.6. C++ Standard Library Headers6.7. Case Study: Random Number Generation6.8. Case Study: Game of Chance; Introducing enum6.9. C++11 Random Numbers6.10. Storage Classes and Storage Duration6.11. Scope Rules6.12. Function Call Stack and Activation Records6.13. Functions with Empty Parameter Lists6.14. Inline Functions6.15. References and Reference Parameters
6.17. Unary Scope Resolution Operator6.18. Function Overloading6.19. Function Templates6.20. Recursion6.21. Example Using Recursion: Fibonacci Series6.22. Recursion vs. Iteration6.23. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesMaking a Difference
7.1. Introduction7.2. arrays7.3. Declaring arrays7.4. Examples Using arrays7.5. Range-Based for Statement7.6. Case Study: Class GradeBook Using an array to Store Grades7.7. Sorting and Searching arrays7.8. Multidimensional arrays
7.10. Introduction to C++ Standard Library Class Template vector7.11. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesRecursion ExercisesMaking a Difference
8.1. Introduction8.2. Pointer Variable Declarations and Initialization8.3. Pointer Operators8.4. Pass-by-Reference with Pointers8.5. Built-In Arrays8.6. Using const with Pointers8.7. sizeof Operator8.8. Pointer Expressions and Pointer Arithmetic8.9. Relationship Between Pointers and Built-In Arrays8.10. Pointer-Based Strings8.11. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesSpecial Section: Building Your Own Computer
9.1. Introduction9.2. Time Class Case Study9.3. Class Scope and Accessing Class Members9.4. Access Functions and Utility Functions9.5. Time Class Case Study: Constructors with Default Arguments9.6. Destructors9.7. When Constructors and Destructors Are Called9.8. Time Class Case Study: A Subtle Trap—Returning a Reference or a Pointer to a private Data Member9.9. Default Memberwise Assignment9.10. const Objects and const Member Functions
9.12. friend Functions and friend Classes9.13. Using the this Pointer9.14. static Class Members9.15. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesMaking a Difference
10.1. Introduction10.2. Using the Overloaded Operators of Standard Library Class string10.3. Fundamentals of Operator Overloading10.4. Overloading Binary Operators10.5. Overloading the Binary Stream Insertion and Stream Extraction Operators10.6. Overloading Unary Operators10.7. Overloading the Unary Prefix and Postfix ++ and -- Operators10.8. Case Study: A Date Class10.9. Dynamic Memory Management10.10. Case Study: Array Class
10.12. Converting Between Types10.13. explicit Constructors and Conversion Operators10.14. Overloading the Function Call Operator ()10.15. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
11.1. Introduction11.2. Base Classes and Derived Classes11.3. Relationship between Base and Derived Classes11.4. Constructors and Destructors in Derived Classes11.5. public, protected and private Inheritance11.6. Software Engineering with Inheritance11.7. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
12.1. Introduction12.2. Introduction to Polymorphism: Polymorphic Video Game12.3. Relationships Among Objects in an Inheritance Hierarchy12.4. Type Fields and switch Statements12.5. Abstract Classes and Pure virtual Functions12.6. Case Study: Payroll System Using Polymorphism12.7. (Optional) Polymorphism, Virtual Functions and Dynamic Binding “Under the Hood”12.8. Case Study: Payroll System Using Polymorphism and Runtime Type Information with Downcasting, dynamic_cast, typeid and type_info12.9. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesMaking a Difference
13.1. Introduction13.2. Streams13.3. Stream Output13.4. Stream Input13.5. Unformatted I/O Using read, write and gcount13.6. Introduction to Stream Manipulators13.7. Stream Format States and Stream Manipulators13.8. Stream Error States13.9. Tying an Output Stream to an Input Stream13.10. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
14.1. Introduction14.2. Files and Streams14.3. Creating a Sequential File14.4. Reading Data from a Sequential File14.5. Updating Sequential Files14.6. Random-Access Files14.7. Creating a Random-Access File14.8. Writing Data Randomly to a Random-Access File14.9. Reading from a Random-Access File Sequentially14.10. Case Study: A Transaction-Processing Program14.11. Object Serialization14.12. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesMaking a Difference
15.1. Introduction15.2. Introduction to Containers15.3. Introduction to Iterators15.4. Introduction to Algorithms15.5. Sequence Containers15.6. Associative Containers15.7. Container Adapters15.8. Class bitset15.9. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesRecommended Reading
16.1. Introduction16.2. Minimum Iterator Requirements16.3. Algorithms
16.5. Lambda Expressions16.6. Standard Library Algorithm Summary16.7. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
17.1. Introduction17.2. Example: Handling an Attempt to Divide by Zero17.3. Rethrowing an Exception17.4. Stack Unwinding17.5. When to Use Exception Handling17.6. Constructors, Destructors and Exception Handling17.7. Exceptions and Inheritance17.8. Processing new Failures17.9. Class unique_ptr and Dynamic Memory Allocation17.10. Standard Library Exception Hierarchy17.11. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
18.1. Introduction18.2. Class Templates18.3. Function Template to Manipulate a Class-Template Specialization Object18.4. Nontype Parameters18.5. Default Arguments for Template Type Parameters18.6. Overloading Function Templates18.7. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
19.1. Introduction19.2. Self-Referential Classes19.3. Linked Lists19.4. Stacks19.5. Queues19.6. Trees19.7. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesSpecial Section: Building Your Own Compiler
20.1. Introduction20.2. Searching Algorithms20.3. Sorting Algorithms20.4. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
21.1. Introduction21.2. string Assignment and Concatenation21.3. Comparing strings21.4. Substrings21.5. Swapping strings21.6. string Characteristics21.7. Finding Substrings and Characters in a string21.8. Replacing Characters in a string21.9. Inserting Characters into a string21.10. Conversion to Pointer-Based char * Strings21.11. Iterators21.12. String Stream Processing21.13. C++11 Numeric Conversion Functions21.14. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesMaking a Difference
22.1. Introduction22.2. Structure Definitions22.3. typedef22.4. Example: Card Shuffling and Dealing Simulation22.5. Bitwise Operators22.6. Bit Fields22.7. Character-Handling Library22.8. C String-Manipulation Functions
22.10. Search Functions of the C String-Handling Library22.11. Memory Functions of the C String-Handling Library22.12. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesSpecial Section: Advanced String-Manipulation ExercisesChallenging String-Manipulation Projects
23.1. Introduction23.2. const_cast Operator23.3. mutable Class Members23.4. namespaces23.5. Operator Keywords23.6. Pointers to Class Members (.* and ->*)23.7. Multiple Inheritance23.8. Multiple Inheritance and virtual Base Classes23.9. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
24.1 Introduction24.2 Smart Pointers24.3 Multithreading24.4 noexcept Exception Specifications and the noexcept Operator24.5 Move Semantics24.6 static_assert24.7 decltype24.8 constexpr24.9 Defaulted Special Member Functions24.10 Variadic Templates24.11 tuples24.12 initializer_list Class Template24.13 Inherited Constructors with Multiple Inheritance
24.15 Raw String Literals24.16 Wrap-Up
25.1 Introduction25.2 Introduction to Object-Oriented Analysis and Design25.3 Examining the ATM Requirements Document25.4 Identifying the Classes in the ATM Requirements Document25.5 Identifying Class Attributes25.6 Identifying Objects’ States and Activities25.7 Identifying Class Operations25.8 Indicating Collaboration Among Objects25.9 Wrap-Up
26.1 Introduction26.2 Starting to Program the Classes of the ATM System26.3 Incorporating Inheritance into the ATM System26.4 ATM Case Study Implementation
D.1. IntroductionD.2. Abbreviating Binary Numbers as Octal and Hexadecimal NumbersD.3. Converting Octal and Hexadecimal Numbers to Binary NumbersD.4. Converting from Binary, Octal or Hexadecimal to DecimalD.5. Converting from Decimal to Binary, Octal or HexadecimalD.6. Negative Binary Numbers: Two’s Complement NotationSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
E.1. IntroductionE.2. #include Preprocessing DirectiveE.3. #define Preprocessing Directive: Symbolic ConstantsE.4. #define Preprocessing Directive: MacrosE.5. Conditional CompilationE.6. #error and #pragma Preprocessing DirectivesE.7. Operators # and ##E.8. Predefined Symbolic ConstantsE.9. AssertionsE.10. Wrap-UpSummarySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
F.1 IntroductionF.2 Redirecting Input/Output on UNIX/Linux/Mac OS X and Windows SystemsF.3 Variable-Length Argument ListsF.4 Using Command-Line ArgumentsF.5 Notes on Compiling Multiple-Source-File ProgramsF.6 Program Termination with exit and atexitF.7 Type Qualifier volatileF.8 Suffixes for Integer and Floating-Point ConstantsF.9 Signal HandlingF.10 Dynamic Memory Allocation with calloc and reallocF.11 Unconditional Branch: gotoF.12 UnionsF.13 Linkage SpecificationsF.14 Wrap-Up
G.1 IntroductionG.2 Additional Diagram Types
H.1 IntroductionH.2 Breakpoints and the Continue CommandH.3 Locals and Watch WindowsH.4 Controlling Execution Using the Step Into, Step Over, Step Out and Continue CommandsH.5 Autos WindowH.6 Wrap-Up
I.1 IntroductionI.2 Breakpoints and the run, stop, continue and print CommandsI.3 print and set CommandsI.4 Controlling Execution Using the step, finish and next CommandsI.5 watch CommandI.6 Wrap-Up
J.1 IntroductionJ.2 Breakpoints and the Continue program execution CommandJ.3 Auto WindowJ.4 Controlling Execution Using the Step Into, Step Over and Step Out CommandsJ.5 Wrap-Up

Content preview from C++ How to Program, Ninth Edition

Preface

“The chief merit of language is clearness ...”

—Galen

Welcome to the C++ computer programming language and C++ How to Program, Ninth Edition. This book presents leading-edge computing technologies. It’s appropriate for introductory course sequences based on the curriculum recommendations of two key professional organizations—the ACM and the IEEE. If you haven’t already done so, please read the back cover and inside back cover—these capture the essence of the book concisely. In this Preface we provide more detail for students, instructors and professionals.

At the heart of the book is the Deitel signature live-code approach—we present concepts in the context of complete working programs followed by sample executions, rather than in code ...