@cpp_programming_books.pdf

GLOBAL EDITION Problem Solving with C++    TENTH EDITION    Walter Savitch  Digital Resources for Students Your new textbook provides 12-month access to digital resources that may include VideoNotes (step-by-step video tutorials on programming con...

GLOBAL EDITION Problem Solving with C++    TENTH EDITION    Walter Savitch  Digital Resources for Students Your new textbook provides 12-month access to digital resources that may include VideoNotes (step-by-step video tutorials on programming concepts), source code, web chapters, quizzes, and more. Refer to the preface in the textbook for a detailed list of resources. Follow the instructions below to register for the Companion Website for Walter Savitch’s Problem Solving with C++, Tenth Edition, Global Edition. 1. Go to www.pearsonglobaleditions.com/savitch. 2. Enter the title of your textbook or browse by author name. 3. Click Companion Website. 4. Click Register and follow the on-screen instructions to create a login name and password. Use a coin to scratch off the coating and reveal your access code. Do not use a sharp knife or other sharp object as it may damage the code. Use the login name and password you created during registration to start using the online resources that accompany your textbook. IMPORTANT: This prepaid subscription does not include access to MyProgrammingLab, which is available at www.myprogramminglab.com for purchase. This access code can only be used once. This subscription is valid for 12 months upon activation and is not transferable. If the access code has already been revealed it may no longer be valid. For technical support go to https://support.pearson.com/getsupport/ This page intentionally left blank PROBLEM SOLVING with C++ This page intentionally left blank  Tenth Edition Global Edition PROBLEM SOLVING with C++ Walter J. Savitch UNIVERSITY OF CALIFORNIA, SAN DIEGO CONTRIBUTOR Kenrick Mock UNIVERSITY OF ALASKA, ANCHORAGE 330 Hudson Street, New York, NY 10013 Senior Vice President Courseware Portfolio Management: Marcia J. Horton Director, Portfolio Management: Engineering, Computer Science & Global Editions: Julian Partridge Portfolio Manager: Matt Goldstein Assistant Acquisitions Editor, Global Edition: Aditee Agarwal Portfolio Management Assistant: Kristy Alaura Field Marketing Manager: Demetrius Hall Product Marketing Manager: Yvonne Vannatta Managing Producer, ECS and Math: Scott Disanno Content Producer: Sandra L. Rodriguez Project Editor, Global Edition: K.K. Neelakantan Senior Manufacturing Controller, Global Edition: Angela Hawksbee Manager, Media Production, Global Edition: Vikram Kumar Cover Designer: Lumina Datamatics, Inc. Cover Photo: Iana Chyrva/Shutterstock The author and publisher of this book have used their best efforts in preparing this book. These efforts include the development, research, and testing of theories and programs to determine their effectiveness. The author and publisher make no warranty of any kind, expressed or implied, with regard to these programs or the documentation contained in this book. The author and publisher shall not be liable in any event for incidental or consequential damages with, or arising out of, the furnishing, performance, or use of these programs. Pearson Education Limited KAO Two KAO Park Harlow CM17 9NA United Kingdom and Associated Companies throughout the world Visit us on the World Wide Web at: www.pearsonglobaleditions.com © Pearson Education Limited 2018 The rights of Walter Savitch to be identified as the author of this work has been asserted by him in accordance with the Copyright, Designs and Patents Act 1988. Authorized adaptation from the United States edition, entitled Problem Solving with C++, 10th Edition, ISBN 978-0-13-444828-2 by Walter Savitch published by Pearson Education © 2018. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, without either the prior written permission of the publisher or a license permitting restricted copying in the United Kingdom issued by the Copyright Licensing Agency Ltd, Saffron House, 6–10 Kirby Street, London EC1N 8TS. All trademarks used herein are the property of their respective owners. The use of any trademark in this text does not vest in the author or publisher any trademark ownership rights in such trademarks, nor does the use of such trademarks imply any affiliation with or endorsement of this book by such owners. British Library Cataloguing-in-Publication Data A catalogue record for this book is available from the British Library 10 9 8 7 6 5 4 3 2 1 ISBN 10:   1-292-22282-4 ISBN 13: 978-1-292-22282-0 Typeset by iEnergizer Aptara®, Ltd. Printed and bound in Malaysia Preface This book is meant to be used in a first course in programming and computer science using the C++ language. It assumes no previous programming experi- ence and no mathematics beyond high school algebra. If you have used the previous edition of this book, you should read the following section that explains the changes to this tenth edition and then you can skip the rest of this preface. If you are new to this book, the rest of this preface will give you an overview of the book. Changes to the Tenth Edition This tenth edition presents the same programming philosophy as the ninth edition. All of the material from the ninth edition remains, but with the fol- lowing enhancements: Consistent use of camelCase notation rather than underscore_case through- out the text. Discussion in Chapter 10 of shallow vs. deep copy. Additional material in Chapter 12 and 17 on compiling templates with header files. Additional material in Chapter 18 on the std::array class, regular expres- sions, threads, and smart pointers in C++11. Correction of errata and edits for clarity such as indicating preferred meth- ods for file I/O, naming of terminology, better definition of encapsulation, and removing material that is now standard in C++11 and higher. Ten new Programming Projects. Five new VideoNotes for a total of sixty nine VideoNotes. These VideoNotes walk students through the process of both problem solving and coding to help reinforce key programming concepts. An icon appears in the margin of the book when a VideoNote is available regarding the topic covered in the text. If you are an instructor already using the ninth edition, you can continue to teach your course almost without change. Flexibility in Topic Ordering This book was written to allow instructors wide latitude in reordering the material. To illustrate this flexibility, we suggest two alternative ways to order 5 6 PREFACE the topics. There is no loss of continuity when the book is read in either of these ways. To ensure this continuity when you rearrange material, you may need to move sections rather than entire chapters. However, only large sections in convenient locations are moved. To help customize a particular order for any class’s needs, the end of this preface contains a dependency chart, and each chapter has a “Prerequisites” section that explains what material needs to be covered before each section in that chapter. Reordering 1: Earlier Classes To effectively design classes, a student needs some basic tools such as control structures and function definitions. This basic material is covered in Chapters 1 through 6. After completing Chapter 6, students can begin to write their own classes. One possible reordering of chapters that allows for such early coverage of classes is the following: Basics: Chapters 1, 2, 3, 4, 5, and 6. This material covers all control struc- tures, function definitions, and basic file I/O. Chapter 3, which covers ad- ditional control structures, could be deferred if you wish to cover classes as early as possible. Classes and namespaces: Chapter 10, Sections 11.1 and 11.2 of Chapter 11, and Chapter 12. This material covers defining classes, friends, overloaded operators, and namespaces. Arrays, strings and vectors: Chapters 7 and 8 Pointers and dynamic arrays: Chapter 9 Arrays in classes: Sections 11.3 and 11.4 of Chapter 11 Inheritance: Chapter 15 Recursion: Chapter 14. (Alternately, recursion may be moved to later in the course.) Pointers and linked lists: Chapter 13 Any subset of the following chapters may also be used: Exception handling: Chapter 16 Templates: Chapter 17 Standard Template Library: Chapter 18 Reordering 2: Classes Slightly Later but Still Early This version covers all control structures and the basic material on arrays before doing classes, but classes are covered later than the previous ordering and slightly earlier than the default ordering. Basics: Chapters 1, 2, 3, 4, 5, and 6. This material covers all control structures, function definitions, and the basic file I/O.  PREFACE 7 Arrays and strings: Chapter 7, Sections 8.1 and 8.2 of Chapter 8 Classes and namespaces: Chapter 10, Sections 11.1 and 11.2 of Chapter 11, and Chapter 12. This material covers defining classes, friends, overloaded operators, and namespaces. Pointers and dynamic arrays: Chapter 9 Arrays in classes: Sections 11.3 and 11.4 of Chapter 11 Inheritance: Chapter 15 Recursion: Chapter 14. (Alternately, recursion may be moved to later in the course.) Vectors: Chapter 8.3 Pointers and linked lists: Chapter 13 Any subset of the following chapters may also be used: Exception handling: Chapter 16 Templates: Chapter 17 Standard Template Library: Chapter 18 Accessibility to Students It is not enough for a book to present the right topics in the right order. It is not even enough for it to be clear and correct when read by an instructor or other experienced programmer. The material needs to be presented in a way that is accessible to beginning students. In this introductory textbook, I have endeav- ored to write in a way that students find clear and friendly. Reports from the many students who have used the earlier editions of this book confirm that this style makes the material clear and often even enjoyable to students. ANSI/ISO C++ Standard This edition is fully compatible with compilers that meet the latest ANSI/ISO C++ standard. At the time of this writing the latest standard is C++14. Advanced Topics Many “advanced topics” are becoming part of a standard CS1 course. Even if they are not part of a course, it is good to have them available in the text as enrichment material. This book offers a number of advanced topics that can be integrated into a course or left as enrichment topics. It gives thorough coverage of C++ templates, inheritance (including virtual functions), exception han- dling, the STL (Standard Template Library), threads, regular expressions, and smart pointers. Although this book uses libraries and teaches students the importance of libraries, it does not require any nonstandard libraries. This book uses only libraries that are provided with essentially all C++ implementations. 8 PREFACE Dependency Chart The dependency chart on the next page shows possible orderings of chapters and subsections. A line joining two boxes means that the upper box must be covered before the lower box. Any ordering that is consistent with this partial ordering can be read without loss of continuity. If a box contains a section number or numbers, then the box refers only to those sections and not to the entire chapter. Summary Boxes Each major point is summarized in a boxed section. These boxed sections are spread throughout each chapter. Self-Test Exercises Each chapter contains numerous Self-Test Exercises at strategic points. Com- plete answers for all the Self-Test Exercises are given at the end of each chapter. VideoNotes VideoNote VideoNotes are designed for teaching students key programming concepts and techniques. These short step-by-step videos demonstrate how to solve prob- lems from design through coding. VideoNotes allow for self-paced instruction with easy navigation including the ability to select, play, rewind, fast-forward, and stop within each VideoNote exercise. Online Practice and Assessment with MyProgrammingLab MyProgrammingLab helps students fully grasp the logic, semantics, and syntax of programming. Through practice exercises and immediate, personalized feedback, MyProgrammingLab improves the programming competence of beginning students who often struggle with the basic concepts and paradigms of popular high-level programming languages. A self-study and homework tool, a MyProgrammingLab course consists of hundreds of small practice problems organized around the structure of this textbook. For students, the system automatically detects errors in the logic and syntax of their code submissions and offers targeted hints that enable students to figure out what went wrong—and why. For instructors, a comprehensive gradebook tracks correct and incorrect answers and stores the code inputted by students for review. MyProgrammingLab is offered to users of this book in partnership with Turing’s Craft, the makers of the CodeLab interactive programming exercise system. For a full demonstration, to see feedback from instructors and students, or to get started using MyProgrammingLab in your course, visit www.myprogramminglab.com.  PREFACE 9 DISPLAY P.1 Dependency Chart Chapter 1 Chapter 2 Chapter 4 Chapter 5 Introduction C++ Basics Functions 1 Functions 2 Chapter 3 Chapter 6 More Flow I/O Streams of Control Chapter 7 Chapter 14 Chapter 10 Arrays Recursion Classes 1 7.1–7.3 Chapter 7 Chapter 11 *Chapter 16 7.4 Multi- Classes 2 Exception Dimensional 11.1–11.2 Handling Arrays Chapter 12 Chapter 8 Chapter 11 Separate Strings and 11.3 Classes & ­Compilation Vectors Arrays & Namespaces Chapter 9 Chapter 11 Chapter 13 Pointers and 11.4 Classes & Pointers and Dynamic Dynamic Linked Lists Arrays Arrays Chapter 15 Inheritance Chapter 17 Templates *Chapter 16 contains occasional references Chapter 18 to derived classes, STL and but those references C++11 can be omitted 10 PREFACE Support Material There is support material available to all users of this book and additional material available only to qualified instructors. Materials Available to All Users of this Book Source Code from the book PowerPoint slides VideoNotes To access these materials, go to: www.pearsonglobaleditions.com/savitch Resources Available to Qualified Instructors Only Visit Pearson Education’s instructor resource center at www. pearsonglobal­editions.com/savitch to access the following instructor resources: Instructor’s Resource Guide—including chapter-by-chapter teaching hints, quiz questions with solutions, and solutions to many programming projects Test Bank and Test Generator PowerPoint Lectures—including programs and art from the text Lab Manual Contact Us Your comments, suggestions, questions, and corrections are always welcome. Please e-mail them to [email protected] Acknowledgments Numerous individuals and groups have provided me with suggestions, discus- sions, and other help in preparing this textbook. Much of the first edition of this book was written while I was visiting the Computer Science Department at the University of Colorado in Boulder. The remainder of the writing on the first edition and the work on subsequent editions was done in the Computer Science and Engineering Department at the University of California, San Diego (UCSD). I am grateful to these institutions for providing a conducive environ- ment for teaching this material and writing this book. I extend a special thanks to all the individuals who have contributed critiques or programming projects for this or earlier editions and drafts of this book. In alphabetical order, they are: Alex Feldman, Amber Settle, Andrew Burt, Andrew Haas, Anne Marchant, Barney MacCabe, Bob Holloway, Bob Matthews, Brian R. King, Bruce Johnston, Carol Roberts, Charles Dowling, Claire Bono, Cynthia Martincic, David Feinstein, David Teague, Dennis Heckman, Donald Needham, Doug Cosman, Dung Nguyen, Edward Carr, Eitan M. Gurari, Ethan Munson, Firooz Khosraviyani, Frank Moore, Gilliean Lee, Huzefa Kagdi, James Stepleton, Jeff Roach, Jeffrey Watson, Jennifer Perkins,  PREFACE 11 Jerry Weltman, Joe Faletti, Joel Cohen, John J. Westman, John Marsaglia, John Russo, Joseph Allen, Joseph D. Oldham, Jerrold Grossman, Jesse Morehouse, Karla Chaveau, Ken Rockwood, Larry Johnson, Len Garrett, Linda F. Wilson, Mal Gunasekera, Marianne Lepp, Matt Johnson, Michael Keenan, Michael Main, Michal Sramka, Naomi Shapiro, Nat Martin, Noah Aydin, Nisar Hundewale, Paul J. Kaiser, Paul Kube, Paulo Franca, Richard Borie, Scot Drysdale, Scott Strong, Sheila Foster, Steve Mahaney, Susanne Sherba, Thomas Judson, Walter A. Manrique, Wei Lian Chen, and Wojciech Komornicki. I extend a special thanks to the many instructors who used early editions of this book. Their comments provided some of the most helpful reviewing that the book received. Finally, I thank Kenrick Mock who implemented the changes in this edition. He had the almost impossible task of pleasing me, my editor, and his own sensibilities, and he did a superb job of it. Walter Savitch Acknowledgments for the Global Edition Pearson would like to thank and acknowledge Bradford Heap, University of New South Wales, for contributing to the Global Edition, and Kaushik Goswami, St. Xavier’s College Kolkata, Ela Kashyap, and Sandeep Singh, Jaypee Institute of Technology, for reviewing the Global Edition. This page intentionally left blank  To improving results Through the power of practice and immediate personalized feedback, MyProgrammingLab helps improve your students’ performance. PROGRAMMING PRACTICE experience in an interactive online environment. IMMEDIATE, PERSONALIZED FEEDBACK MyProgrammingLab automatically detects errors in the logic and syntax of their went wrong and why. GRADUATED COMPLEXITY MyProgrammingLab breaks down programming concepts into short, understandable sequences of exercises. Within each sequence the level and sophistication of the exercises increase gradually but steadily. DYNAMIC ROSTER Students’ submissions are stored in a roster that indicates whether the submission is correct, how many attempts were made, and the actual code submissions from each attempt. PEARSON eTEXT The Pearson eText gives students access to their textbook anytime, anywhere. STEP-BY-STEP VIDEONOTE TUTORIALS These step-by-step video tutorials enhance the programming concepts presented in select Pearson textbooks. For more information and titles available with MyProgrammingLab, please visit www.myprogramminglab.com. 2018 This page intentionally left blank Brief Contents Chapter 1 Introduction to Computers and C++ Programming 33 Chapter 2 C++ Basics 71 Chapter 3 More Flow of Control 143 Chapter 4 Procedural Abstraction and Functions That Return a Value 213 Chapter 5 Functions for All Subtasks 283 Chapter 6 I/O Streams as an Introduction to Objects and Classes 339 Chapter 7 Arrays 411 Chapter 8 Strings and Vectors 485 Chapter 9 Pointers and Dynamic Arrays 541 Chapter 10 Defining Classes 575 Chapter 11 Friends, Overloaded Operators, and Arrays in Classes 653 Chapter 12 Separate Compilation and Namespaces 737 15 16 BRIEF CONTENTS Chapter 13 Pointers and Linked Lists 773 Chapter 14 Recursion 823 Chapter 15 Inheritance 867 Chapter 16 Exception Handling 927 Chapter 17 Templates 959 Chapter 18 Standard Template Library and C++11 991 Appendices 1 C++ Keywords 1067 2 Precedence of Operators 1068 3 The ASCII Character Set 1070 4 Some Library Functions 1071 5 Inline Functions 1078 6 Overloading the Array Index Square Brackets 1079 7 The this Pointer 1081 8 Overloading Operators as Member Operators 1084 Credits 1086 Index 1089 Contents Chapter 1 Introduction to Computers and C++ Programming 33 1.1 COMPUTER SYSTEMS 34 Hardware 34 Software 39 High-Level Languages 40 Compilers 41 History Note 44 1.2 PROGRAMMING AND PROBLEM-SOLVING 44 Algorithms 44 Program Design 47 Object-Oriented Programming 48 The Software Life Cycle 49 1.3 INTRODUCTION TO C++ 50 Origins of the C++ Language 50 A Sample C++ Program 51 Pitfall: Using the Wrong Slash in \n 55 Programming Tip: Input and Output Syntax 55 Layout of a Simple C++ Program 56 Pitfall: Putting a Space Before the include File Name 58 Compiling and Running a C++ Program 58 Pitfall: Compiling a C++11 Program 59 Programming Tip: Getting Your Program to Run 59 1.4 TESTING AND DEBUGGING 61 Kinds of Program Errors 62 Pitfall: Assuming Your Program Is Correct 63 Chapter Summary 64 Answers to Self-Test Exercises 65 Practice Programs 67 Programming Projects 68 17 18 CONTENTS Chapter 2 C++ Basics 71 2.1 VARIABLES AND ASSIGNMENTS 72 Variables 72 Names: Identifiers 74 Variable Declarations 77 Assignment Statements 77 Pitfall: Uninitialized Variables 79 Programming Tip: Use Meaningful Names 81 2.2 INPUT AND OUTPUT 82 Output Using cout 82 Include Directives and Namespaces 84 Escape Sequences 85 Programming Tip: End Each Program with a \n or endl 87 Formatting for Numbers with a Decimal Point 87 Input Using cin 88 Designing Input and Output 90 Programming Tip: Line Breaks in I/O 90 2.3 DATA TYPES AND EXPRESSIONS 92 The Types int and double 92 Other Number Types 94 C++11 Types 95 The Type char 96 The Type bool 98 Introduction to the Class string 98 Type Compatibilities 100 Arithmetic Operators and Expressions 101 Pitfall: Whole Numbers in Division 104 More Assignment Statements 106 2.4 SIMPLE FLOW OF CONTROL 106 A Simple Branching Mechanism 107 Pitfall: Strings of Inequalities 112 Pitfall: Using = in place of == 113 Compound Statements 114 Simple Loop Mechanisms 116 Increment and Decrement Operators 119 Programming Example: Charge Card Balance 121 Pitfall: Infinite Loops 122  CONTENTS 19 2.5 PROGRAM STYLE 125 Indenting 125 Comments 125 Naming Constants 127 Chapter Summary 130 Answers to Self-Test Exercises 130 Practice Programs 135 Programming Projects 137 Chapter 3 More Flow of Control 143 3.1 USING BOOLEAN EXPRESSIONS 144 Evaluating Boolean Expressions 144 Pitfall: Boolean Expressions Convert to int Values 148 Enumeration Types (Optional) 151 3.2 MULTIWAY BRANCHES 152 Nested Statements 152 Programming Tip: Use Braces in Nested Statements 153 Multiway if-else Statements 155 Programming Example: State Income Tax 157 The switch Statement 160 Pitfall: Forgetting a break in a switch Statement 164 Using switch Statements for Menus 165 Blocks 167 Pitfall: Inadvertent Local Variables 170 3.3 MORE ABOUT C++ LOOP STATEMENTS 171 The while Statements Reviewed 171 Increment and Decrement Operators Revisited 173 The for Statement 176 Pitfall: Extra Semicolon in a for Statement 181 What Kind of Loop to Use 182 Pitfall: Uninitialized Variables and Infinite Loops 184 The break Statement 185 Pitfall: The break Statement in Nested Loops 186 3.4 DESIGNING LOOPS 187 Loops for Sums and Products 187 Ending a Loop 189 20 CONTENTS Nested Loops 192 Debugging Loops 194 Chapter Summary 197 Answers to Self-Test Exercises 198 Practice Programs 204 Programming Projects 206 Chapter 4 Procedural Abstraction and Functions That Return a Value 213 4.1 TOP-DOWN DESIGN 214 4.2 PREDEFINED FUNCTIONS 215 Using Predefined Functions 215 Random Number Generation 220 Type Casting 222 Older Form of Type Casting 224 Pitfall: Integer Division Drops the Fractional Part 224 4.3 PROGRAMMER-DEFINED FUNCTIONS 225 Function Definitions 225 Functions That Return a Boolean Value 231 Alternate Form for Function Declarations 231 Pitfall: Arguments in the Wrong Order 232 Function Definition–Syntax Summary 233 More About Placement of Function Definitions 234 Programming Tip: Use Function Calls in Branching Statements 235 4.4 PROCEDURAL ABSTRACTION 236 The Black-Box Analogy 236 Programming Tip: Choosing Formal Parameter Names 239 Programming Tip: Nested Loops 240 Case Study: Buying Pizza 243 Programming Tip: Use Pseudocode 249 4.5 SCOPE AND LOCAL VARIABLES 250 The Small Program Analogy 250 Programming Example: Experimental Pea Patch 253 Global Constants and Global Variables 253 Call-by-Value Formal Parameters Are Local Variables 256 Block Scope 258  CONTENTS 21 Namespaces Revisited 259 Programming Example: The Factorial Function 262 4.6 OVERLOADING FUNCTION NAMES 264 Introduction to Overloading 264 Programming Example: Revised Pizza-Buying Program 267 Automatic Type Conversion 270 Chapter Summary 272 Answers to Self-Test Exercises 272 Practice Programs 277 Programming Projects 279 Chapter 5 Functions for All Subtasks 283 5.1 VOID FUNCTIONS 284 Definitions of void Functions 284 Programming Example: Converting Temperatures 287 return Statements in void Functions 287 5.2 CALL-BY-REFERENCE PARAMETERS 291 A First View of Call-by-Reference 291 Call-by-Reference in Detail 294 Programming Example: The swapValues Function 299 Mixed Parameter Lists 300 Programming Tip: What Kind of Parameter to Use 301 Pitfall: Inadvertent Local Variables 302 5.3 USING PROCEDURAL ABSTRACTION 305 Functions Calling Functions 305 Preconditions and Postconditions 307 Case Study: Supermarket Pricing 308 5.4 TESTING AND DEBUGGING FUNCTIONS 313 Stubs and Drivers 314 5.5 GENERAL DEBUGGING TECHNIQUES 319 Keep an Open Mind 319 Check Common Errors 319 Localize the Error 320 The assert Macro 322 22 CONTENTS Chapter Summary 324 Answers to Self-Test Exercises 325 Practice Programs 328 Programming Projects 331 Chapter 6 I/O Streams as an Introduction to Objects and Classes 339 6.1 STREAMS AND BASIC FILE I/O 340 Why Use Files for I/O? 341 File I/O 342 Introduction to Classes and Objects 346 Programming Tip: Check Whether a File Was Opened Successfully 348 Techniques for File I/O 350 Appending to a File (Optional) 354 File Names as Input (Optional) 355 6.2 TOOLS FOR STREAM I/O 357 Formatting Output with Stream Functions 357 Manipulators 363 Streams as Arguments to Functions 366 Programming Tip: Checking for the End of a File 366 A Note on Namespaces 369 Programming Example: Cleaning Up a File Format 370 6.3 CHARACTER I/O 372 The Member Functions get and put 372 The putback Member Function (Optional) 376 Programming Example: Checking Input 377 Pitfall: Unexpected '\n' in Input 379 Programming Example: Another newLine Function 381 Default Arguments for Functions (Optional) 382 The eof Member Function 387 Programming Example: Editing a Text File 389 Predefined Character Functions 390 Pitfall: toupper and tolower Return Values 392 Chapter Summary 394 Answers to Self-Test Exercises 395 Practice Programs 402 Programming Projects 404  CONTENTS 23 Chapter 7 Arrays 411 7.1 INTRODUCTION TO ARRAYS 412 Declaring and Referencing Arrays 412 Programming Tip: Use for Loops with Arrays 414 Pitfall: Array Indexes Always Start with Zero 414 Programming Tip: Use a Defined Constant for the Size of an Array 414 Arrays in Memory 416 Pitfall: Array Index Out of Range 417 Initializing Arrays 420 Programming Tip: C++11 Range-Based for Statement 420 7.2 ARRAYS IN FUNCTIONS 423 Indexed Variables as Function Arguments 423 Entire Arrays as Function Arguments 425 The const Parameter Modifier 428 Pitfall: Inconsistent Use of const Parameters 431 Functions That Return an Array 431 Case Study: Production Graph 432 7.3 PROGRAMMING WITH ARRAYS 445 Partially Filled Arrays 445 Programming Tip: Do Not Skimp on Formal Parameters 448 Programming Example: Searching an Array 448 Programming Example: Sorting an Array 451 Programming Example: Bubble Sort 455 7.4 MULTIDIMENSIONAL ARRAYS 458 Multidimensional Array Basics 459 Multidimensional Array Parameters 459 Programming Example: Two-Dimensional Grading Program 461 Pitfall: Using Commas Between Array Indexes 465 Chapter Summary 466 Answers to Self-Test Exercises 467 Practice Programs 471 Programming Projects 473 24 CONTENTS Chapter 8 Strings and Vectors 485 8.1 AN ARRAY TYPE FOR STRINGS 487 C-String Values and C-String Variables 487 Pitfall: Using = and == with C Strings 490 Other Functions in 492 Pitfall: Copying past the end of a C-string using strcpy 495 C-String Input and Output 498 C-String-to-Number Conversions and Robust Input 500 8.2 THE STANDARD STRING CLASS 506 Introduction to the Standard Class string 506 I/O with the Class string 509 Programming Tip: More Versions of getline 512 Pitfall: Mixing cin >> variable; and getline 513 String Processing with the Class string 514 Programming Example: Palindrome Testing 518 Converting between string Objects and C Strings 521 Converting Between Strings and Numbers 522 8.3 VECTORS 523 Vector Basics 523 Pitfall: Using Square Brackets Beyond the Vector Size 526 Programming Tip: Vector Assignment Is Well Behaved 527 Efficiency Issues 527 Chapter Summary 529 Answers to Self-Test Exercises 529 Practice Programs 531 Programming Projects 532 Chapter 9 Pointers and Dynamic Arrays 541 9.1 POINTERS 542 Pointer Variables 543 Basic Memory Management 550 Pitfall: Dangling Pointers 551 Static Variables and Automatic Variables 552 Programming Tip: Define Pointer Types 552  CONTENTS 25 9.2 DYNAMIC ARRAYS 555 Array Variables and Pointer Variables 555 Creating and Using Dynamic Arrays 556 Pointer Arithmetic (Optional) 562 Multidimensional Dynamic Arrays (Optional) 564 Chapter Summary 566 Answers to Self-Test Exercises 566 Practice Programs 567 Programming Projects 568 Chapter 10 Defining Classes 575 10.1 STRUCTURES 576 Structures for Diverse Data 576 Pitfall: Forgetting a Semicolon in a Structure Definition 581 Structures as Function Arguments 582 Programming Tip: Use Hierarchical Structures 583 Initializing Structures 585 10.2 CLASSES 588 Defining Classes and Member Functions 588 Public and Private Members 593 Programming Tip: Make All Member Variables Private 601 Programming Tip: Define Accessor and Mutator Functions 601 Programming Tip: Use the Assignment Operator with Objects 603 Programming Example: BankAccount Class—Version 1 604 Summary of Some Properties of Classes 608 Constructors for Initialization 610 Programming Tip: Always Include a Default Constructor 618 Pitfall: Constructors with No Arguments 619 Member Initializers and Constructor Delegation in C++11 621 10.3 ABSTRACT DATA TYPES 622 Classes to Produce Abstract Data Types 623 Programming Example: Alternative Implementation of a Class 627 10.4 INTRODUCTION TO INHERITANCE 632 Derived Classes 633 Defining Derived Classes 634 26 CONTENTS Chapter Summary 638 Answers to Self-Test Exercises 639 Practice Programs 645 Programming Projects 646 Chapter 11 Friends, Overloaded Operators, and Arrays in Classes 653 11.1 FRIEND FUNCTIONS 654 Programming Example: An Equality Function 654 Friend Functions 658 Programming Tip: Define Both Accessor Functions and Friend Functions 660 Programming Tip: Use Both Member and Nonmember Functions 662 Programming Example: Money Class (Version 1) 662 Implementation of digitToInt (Optional) 669 Pitfall: Leading Zeros in Number Constants 670 The const Parameter Modifier 672 Pitfall: Inconsistent Use of const 673 11.2 OVERLOADING OPERATORS 677 Overloading Operators 678 Constructors for Automatic Type Conversion 681 Overloading Unary Operators 683 Overloading >> and peasPerPod; 11 totalPeas = numberOfPods * peasPerPod; 12 cout 0 and score > 5\n"; 4 else 5 cout budget; 14 15 area = budget / COST_PER_SQ_FT; 16 length_side = sqrt(area); 17 18 cout.setf(ios::fixed); 19 cout.setf(ios::showpoint); 20 cout.precision(2); 21 cout