book

Programming and Problem Solving with C++, 5th Edition

by Nell Dale, Chip Weems

May 2009

Intermediate to advanced

1020 pages

26h 27m

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 CheckAnswersExam 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 CheckAnswersExam 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 CheckAnswersExam 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 DebuggingTesting and Debugging HintsSummaryQuick CheckAnswersExam 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 ExecutionTesting and Debugging HintsSummaryQuick CheckAnswersExam 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 LoopsTesting and Debugging HintsSummaryQuick CheckAnswersExam 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 DebuggingTesting and Debugging HintsSummaryQuick CheckAnswersExam 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 FunctionTesting and Debugging HintsSummaryQuick CheckAnswersExam 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 DriversTesting and Debugging HintsSummaryQuick CheckAnswersExam 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 - UnionsProblem-Solving Case Study: Stylistical Analysis of TextTesting and DebuggingCoping with Input ErrorsTesting and Debugging HintsSummaryQuick CheckAnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up
11.1 - One-Dimensional ArraysDeclaring ArraysAccessing Individual Components of an ArrayOut-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 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 ArraysProblem-Solving Case Study: Calculating Exam StatisticsProblem-Solving Case Study: Favorite Rock GroupTesting and DebuggingOne-Dimensional ArraysComplex StructuresMultidimensional ArraysTesting and Debugging HintsSummaryQuick CheckAnswersExam 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 DebuggingTesting and Debugging HintsSummaryQuick CheckAnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up
13.1 - What is a List?13.2 - The List as an Abstract Data TypeRefining ResponsibilitiesData RepresentationExample Program13.3 - Implementation of List ADTBasic OperationsInsertion and DeletionSequential SearchIteratorsSoftware Maintenance Case Study: Enhancing Class List with a Sort13.4 - Sorted ListsBasic OperationsInsertionSequential SearchBinary SearchDeletion13.5 - Sorted List of ClassesIsThereInsert and Delete13.6 - More on UML DiagramsProblem-Solving Case Study: Calculating Exam Statistics RevisitedTesting and DebuggingTesting and Debugging HintsSummaryQuick CheckAnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up
14.1 - PointersPointer VariablesPointer Expressions14.2 - Reference Types14.3 - Dynamic DataAllocating Dynamic DataDeleting Dynamic DataConstants and Dynamic Data14.4 - Sequential Versus Linked Structures14.5 - Creating a Dynamic Linked List: A Walk-Through Example14.6 - Dynamic Implementation of ADT ListCreating an Empty Linked ListInserting into a Linked ListTraversals of a Linked ListDeleting from a Linked ListResetting the ListGetting the Next ItemTesting for the Full Linked ListSearching the List14.7 - Destructors and Copy ConstructorsDestructorShallow Versus Deep CopyingCopy-Constructor14.8 - Sorted Linked ListInsert(20)Insert(60) (pick up with loop)Insert(100)Deleting from a Linked ListDelete(30)Delete(50)Problem-Solving Case Study: Creating a Sorted List of Entry ObjectsTesting and DebuggingTesting and Debugging HintsSummaryQuick CheckAnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up
15.1 - Object-Oriented Programming15.2 - InheritanceAn AnalogyInheritance and the Object-Oriented Design ProcessDeriving One Class from Another ClassSpecification of the ExpandedEntry ClassImplementation of the ExpandedEntry ClassConstructor Execution OrderSoftware Maintenance Case Study: Extending TimeOfDay with Support for a Time Zone15.3 - Dynamic Binding and Virtual FunctionsThe Slicing ProblemVirtual Functions15.4 - Object-Oriented DesignBrainstormingFilteringScenario ExplorationResponsibility AlgorithmsA Final Word15.5 - Implementing a DesignProblem-Solving Case Study: Creating an Appointment CalendarTesting and DebuggingTesting and Debugging HintsSummaryQuick CheckAnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up
16.1 - Template ClassesDefining a Class TemplateInstantiating a Class TemplateAnother Way of Implementing Incoming Parameters: const ReferencesOrganization of Program CodeA Word of Caution16.2 - Generic FunctionsFunction OverloadingDefining a Function Template Outside a ClassInstantiating a Function Template16.3 - Operator OverloadingUsing *this16.4 - ExceptionsThe throw StatementThe try-catch StatementNonlocal Exception HandlersRethrowing an ExceptionStandard ExceptionsSoftware Maintenance Case Study: Adding Exceptions to the Date ClassProblem-Solving Case Study: Starship Weight and BalanceTesting and DebuggingTesting and Debugging HintsSummaryQuick CheckAnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up
17.1 - Abstract Data Structures versus Implementations17.2 - Additional Linear StructuresStacksQueuesPriority Queues17.3 - Bidirectional Linear StructuresBidirectional ListsDeques17.4 - An Introduction to the STLIteratorsThe vector TemplateThe list TemplateThe stack TemplateThe queue TemplateThe priority_queue TemplateThe deque TemplateSoftware Maintenance Case Study: Appointment Calendar Using STL List17.5 - Nonlinear StructuresBinary TreesHash Tables17.6 - Associative ContainersThe set TemplateThe map TemplateProblem-Solving Case Study: Creating a Deck of CardsTesting and DebuggingTesting and Debugging HintsSummaryQuick CheckAnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up
18.1 - What is Recursion?18.2 - Recursive Algorithms with Simple Variables18.3 - Towers of Hanoi18.4 - Recursive Algorithms with Structured VariablesSoftware Maintenance Case Study: Substituting Binary Search for Linear Search18.5 - Recursion Using Pointer VariablesPrinting a Dynamic Linked List in Reverse OrderCopying a Dynamic Linked List18.6 - Recursion or Iteration?Problem-Solving Case Study: QuicksortTesting and DebuggingTesting and Debugging HintsSummaryQuick CheckAnswersExam Preparation ExercisesProgramming Warm-Up ExercisesProgramming ProblemsCase Study Follow-Up

Content preview from Programming and Problem Solving with C++, 5th Edition

7	Additional Control Structures

To know how to choose the most appropriate looping statement for a given problem.

To understand the purpose of the Break and Continue statements.

To be familiar with specialized C++ operators and expressions.

To be able to:

Write a Switch statement for a multiway branching problem. ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Start your free trial

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

Nell Dale, Chip Weems

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

Nell Dale, Chip Weems

C++ for Lazy Programmers: Quick, Easy, and Fun C++ for Beginners

Will Briggs

Practical C++ Programming, 2nd Edition

Steve Oualline

Publisher Resources

ISBN: 9780763771560