book

Programming and Problem Solving with C++: Brief, 6th Edition

by Nell Dale, Chip Weems

March 2013

Intermediate to advanced

773 pages

22h 9m

English

Jones & Bartlett Learning

Read now

Unlock full access

1.1 Overview of ProgrammingWhat Is Programming?How Do We Write a Program?What Is an Algorithm?What Is a Programming Language?1.2 How Does a Computer Run a Program?What Kinds of Instructions Can Be Written in a Programming Language?What Is Software Maintenance?Software Maintenance Case Study: An Introduction to Software Maintenance1.3 What’s Inside the Computer?1.4 Ethics and Responsibilities in the Computing ProfessionSoftware PiracyPrivacy of DataUse of Computer ResourcesSoftware Engineering1.5 Problem-Solving TechniquesAsk QuestionsLook for Things That Are FamiliarSolve by AnalogyMeans-Ends AnalysisDivide and ConquerThe Building-Block ApproachMerging SolutionsMental Blocks: The Fear of StartingAlgorithmic Problem SolvingProblem-Solving Case Study: Leap Year AlgorithmSummaryQuick Check AnswersExam Preparation ExercisesProgramming Warm-Up ExercisesCase Study Follow-UpLine Number
2.1 The Elements of C++ ProgramsC++ Program StructureSyntax and SemanticsSyntax TemplatesNaming Program Elements: IdentifiersData and Data TypesNaming Elements: DeclarationsTaking Action: Executable StatementsBeyond Minimalism: Adding Comments to a Program2.2 Program ConstructionBlocks (Compound Statements)The C++ PreprocessorSoftware Maintenance Case Study: Adding Titles to Names2.3 More About OutputCreating Blank LinesInserting Blanks Within a LineSpecial Characters2.4 Program Entry, Correction, and ExecutionEntering a ProgramCompiling and Running a ProgramProblem-Solving Case Study: Printing a ChessboardTesting and DebuggingSummaryQuick Check AnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up
3.1 Overview of C++ Data Types3.2 Numeric Data TypesIntegral TypesFloating-Point Types3.3 Declarations for Numeric TypesNamed Constant DeclarationsVariable Declarations3.4 Simple Arithmetic ExpressionsArithmetic OperatorsIncrement and Decrement Operators3.5 Compound Arithmetic ExpressionsPrecedence RulesType Coercion and Type CastingSoftware Maintenance Case Study: Precedence Error3.6 Function Calls and Library FunctionsValue-Returning FunctionsLibrary FunctionsVoid Functions3.7 Formatting OutputIntegers and StringsFloating-Point Numbers3.8 Additional string OperationsThe length and size FunctionsThe find FunctionThe substr FunctionAccessing Characters Within a String: The at FunctionConverting to Lowercase and UppercaseProblem-Solving Case Study: Mortgage Payment CalculatorTesting and DebuggingSummaryQuick Check AnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up
4.1 Getting Data into ProgramsInput Streams and the Extraction Operator (>>)The Reading Marker and the Newline CharacterReading Character Data with the get FunctionSkipping Characters with the ignore FunctionReading String Data4.2 Interactive Input/Output4.3 Noninteractive Input/Output4.4 File Input and OutputFilesUsing FilesSoftware Maintenance Case Study: Adding File Input/Output to a ProgramRun-Time Input of File Names4.5 Input Failure4.6 Software Design Methodologies4.7 Functional DecompositionModulesImplementing the DesignA Perspective on DesignProblem-Solving Case Study: Displaying a Name in Multiple FormatsTesting and DebuggingSummaryQuick Check AnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up
5.1 Flow of ControlSelection5.2 Conditions and Logical ExpressionsThe bool Data TypeLogical Expressions5.3 The If StatementThe If-Then-Else FormBlocks (Compound Statements)The If-Then FormA Common MistakeSoftware Maintenance Case Study: Incorrect Output5.4 Nested If StatementsThe Dangling else5.5 Logical OperatorsPrecedence of OperatorsRelational Operators with Floating-Point Types5.6 Testing the State of an I/O StreamProblem-Solving Case Study: BMI CalculatorTesting and DebuggingTesting in the Problem-Solving Phase: The Algorithm Walk-ThroughTesting in the Implementation PhaseThe Test PlanTests Performed Automatically During Compilation and ExecutionSummaryQuick Check AnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up
6.1 The While Statement6.2 Phases of Loop Execution6.3 Loops Using the While StatementCount-Controlled LoopsEvent-Controlled LoopsLooping SubtasksSoftware Maintenance Case Study: Make a Program General6.4 How to Design LoopsDesigning the Flow of ControlDesigning the Process Within the LoopThe Loop Exit6.5 Nested LogicDesigning Nested LoopsProblem-Solving Case Study: Recording Studio DesignTesting and DebuggingLoop-Testing StrategyTest Plans Involving LoopsSummaryQuick Check AnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up

7.1 The Switch Statement7.2 The Do-While Statement7.3 The For StatementSoftware Maintenance Case Study: Changing a Loop Implementation7.4 The Break and Continue Statements7.5 Guidelines for Choosing a Looping Statement7.6 Additional C++ OperatorsAssignment Operators and Assignment ExpressionsIncrement and Decrement OperatorsBitwise OperatorsThe Cast OperationThe sizeof OperatorThe ?: OperatorOperator PrecedenceType Coercion in Arithmetic and Relational ExpressionsProblem-Solving Case Study: The Rich UncleTesting and DebuggingSummaryQuick Check AnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up
8.1 Functional Decomposition with Void FunctionsWhen to Use FunctionsWhy Do Modules Need an Interface Design?Designing InterfacesWriting Modules as Void Functions8.2 An Overview of User-Defined FunctionsFlow of Control in Function CallsFunction Parameters8.3 Syntax and Semantics of Void FunctionsFunction Call (Invocation)Function Declarations and DefinitionsLocal VariablesThe Return Statement8.4 ParametersValue ParametersReference ParametersSoftware Maintenance Case Study: Refactoring a ProgramUsing Expressions with ParametersA Last Word of Caution About Argument and Parameter ListsWriting Assertions as Function DocumentationProblem-Solving Case Study: Lawn Care Company BillingTesting and DebuggingThe assert Library FunctionSummaryQuick Check AnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up
9.1 Scope of IdentifiersScope RulesVariable Declarations and DefinitionsNamespaces9.2 Lifetime of a VariableInitializations in DeclarationsSoftware Maintenance Case Study: Debug a Simple Program9.3 Interface DesignSide EffectsGlobal Constants9.4 Value-Returning FunctionsComplete ExampleBoolean FunctionsInterface Design and Side EffectsWhen to Use Value-Returning Functions9.5 Type Coercion in Assignments, Argument Passing, and Return of a Function ValueProblem-Solving Case Study: Health ProfileTesting and DebuggingStubs and DriversSummaryQuick Check AnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up
10.1 Built-In Simple TypesNumeric TypesCharacters10.2 User-Defined Simple TypesThe Typedef StatementEnumeration TypesNamed and Anonymous Data Types10.3 Simple Versus Structured Data Types10.4 Records (Structs)Accessing Individual ComponentsAggregate Operations on StructsMore About Struct DeclarationsBinding Like ItemsSoftware Maintenance Case Study: Changing a Loop Implementation10.5 Hierarchical Records10.6 Unions10.7 PointersPointer VariablesPointers Expressions10.8 Reference TypesProblem-Solving Case Study: Stylistical Analysis of TextTesting and DebuggingCoping with Input ErrorsDebugging with PointersSummaryQuick Check AnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up
11.1 One-Dimensional ArraysDeclaring ArraysAccessing Individual ComponentsOut-of-Bounds Array IndexesInitializing Arrays in Declarations(Lack of) Aggregate Array OperationsExamples of Declaring and Accessing ArraysPassing Arrays as ArgumentsCommenting ArraysSoftware Maintenance Case Study: Modularizing a ProgramUsing Typedef with ArraysPointer Expressions and Arrays11.2 Arrays of RecordsArrays of Records11.3 Special Kinds of Array ProcessingSubarray ProcessingIndexes with Semantic Content11.4 Two-Dimensional Arrays11.5 Passing Two-Dimensional Arrays as Arguments11.6 Processing Two-Dimensional ArraysSum the RowsSum the Columns RevisedSum the ColumnsInitialize the ArrayPrint the Array11.7 Another Way of Defining Two-Dimensional Arrays11.8 Multidimensional Arrays11.9 Sorting and Searching in an ArraySortingSearching11.10 Dynamic DataAllocating Dynamic DataDeleting Dynamic DataConstants and Dynamic Data11.11 C-Style StringsStrings as ArraysC String OperationsConverting C Strings to C++ StringsWhich String Representation to UseProblem-Solving Case Study: Calculating Exam StatisticsProblem-Solving Case Study: Favorite Rock GroupTesting and DebuggingOne-Dimensional ArraysComplex StructuresMultidimensional ArraysSorting and SearchingSummaryQuick Check AnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up
12.1 Abstract Data Types12.2 C++ ClassesImplementing the Member FunctionsClasses, Objects, and MembersBuilt-in Operations on ObjectsClass Scope12.3 Information HidingUser-Written Header FilesSpecification and Implementation FilesCompiling and Linking a Multifile Program12.4 What Is an Object?12.5 Class Design PrinciplesEncapsulationAbstractionDesigning for Modifiability and ReuseMutabilitySoftware Maintenance Case Study: Comparing Two TimeOfDay Objects12.6 The Name ADTSpecification of the ADTImplementation File12.7 CompositionDesign of an Entry Class12.8 UML DiagramsDiagramming a ClassDiagramming Composition of ClassesProblem-Solving Case Study: Create an Array of Name ObjectsTesting and DebuggingSummaryQuick Check AnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up
13.1 What Is Recursion?13.2 Recursive Algorithms with Simple Variables13.3 Towers of Hanoi13.4 Recursive Algorithms with Structured Variables13.5 Recursion or Iteration?Software Maintenance Case Study: Substituting Binary Search for Linear SearchTesting and DebuggingSummaryQuick Check AnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming Problems
Appendix A: Reserved WordsAppendix B: Operator PrecedenceAppendix C: A Selection of Standard Library RoutinesAppendix D: Using This Book with a Prestandard Version of C++Appendix E: Character SetsAppendix F: Program Style, Formatting, and DocumentationAppendix G: More on Floating-Point NumbersAppendix H: Using C StringsAppendix I: C++ char Constants

Content preview from Programming and Problem Solving with C++: Brief, 6th Edition

Preface

Introduction to the Brief Sixth Edition

The first five editions of Programming and Problem Solving with C++ have consistently been among the best-selling computer science textbooks in the United States. These editions, as well as the Java, Ada, and Pascal versions, have been accepted widely as model textbooks for ACM/IEEE-recommended curricula for the CS1/C101 course, and for the Advanced Placement exam in computer science.

Throughout the successive editions of this book, one thing has not changed: our commitment to the student. As always, our efforts are directed toward making the sometimes difficult concepts of computer science more accessible to all students. This edition of Programming and Problem Solving with C++ continues to reflect ...