MARC details
| 000 -LEADER |
|---|
| fixed length control field |
17099cam a2200361 i 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
15659380 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20201224144504.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
090313s2010 maua 001 0 eng |
| 010 ## - LIBRARY OF CONGRESS CONTROL NUMBER |
|---|
| LC control number |
2009011040 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780763771560 (pbk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
0763771562 (pbk.) |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
DLC |
| Transcribing agency |
DLC |
| Modifying agency |
C#P |
| -- |
YDXCP |
| -- |
BWX |
| -- |
CDX |
| -- |
DLC |
| -- |
EG-NcFUE |
| Description conventions |
rda |
| 050 00 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA76.73.C153 |
| Item number |
D34 2010 |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005.133 |
| Edition number |
22 |
| Item number |
D.N.P |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Dale, Nell B. |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Programming and problem solving with C++ : |
| Remainder of title |
comprehensive edition / |
| Statement of responsibility, etc |
Nell Dale, Chip Weems. |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
Fifth edition. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
Sudbury, Mass. : |
| Name of publisher, distributor, etc |
Jones and Bartlett Publishers, |
| Date of publication, distribution, etc |
c2010. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xxvi, 1020 pages. : |
| Other physical details |
illustration ; |
| Dimensions |
24 cm. |
| 336 ## - CONTENT TYPE |
|---|
| Source |
rdacontent |
| Content type term |
text |
| 337 ## - MEDIA TYPE |
|---|
| Source |
rdamedia |
| Media type term |
unmediated |
| 338 ## - CARRIER TYPE |
|---|
| Source |
rdacarrier |
| Carrier type term |
volume |
| 500 ## - GENERAL NOTE |
|---|
| General note |
Includes index. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
1.1 - Overview of Programming<br/>What is Programming?<br/>How do we Write a Program?<br/>What is an Algorithm?<br/>What is a Programming Language?<br/>1.2 - How does a Computer Run a Program?<br/>What Kinds of Instructions Can be Written in a Programming Language?<br/>What is Software Maintenance?<br/>Software Maintenance Case Study: An Introduction to Software Maintenance<br/>1.3 - What's Inside the Computer?<br/>1.4 - Ethics and Responsibilities in the Computing Profession<br/>Software Piracy<br/>Privacy of Data<br/>Use of Computer Resources<br/>Software Engineering<br/>1.5 - Problem-Solving Techniques<br/>Ask Questions<br/>Look for Things that are Familiar<br/>Solve by Analogy<br/>Means-Ends Analysis<br/>Divide and Conquer<br/>The Building-Block Approach<br/>Merging Solutions<br/>Mental Blocks: The Fear of Starting<br/>Algorithmic Problem Solving<br/>Problem-Solving Case Study: Leap Year Algorithm<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Case Study Follow-Up<br/>Line Number<br/>2 -C++ Syntax and Semantics, and the Program Development Process<br/>2.1 - The Elements of C++ Programs<br/>C++ Program Structure<br/>Syntax and Semantics<br/>Syntax Templates<br/>Naming Program Elements: Identifiers<br/>Data and Data Types<br/>Naming Elements: Declarations<br/>Taking Action: Executable Statements<br/>Beyond Minimalism: Adding Comments to a Program<br/>2.2 - Program Construction<br/>Blocks (Compound Statements)<br/>The C++ Preprocessor<br/>Software Maintenance Case Study: Adding Titles to Names<br/>2.3 - More About Output<br/>Creating Blank Lines<br/>Inserting Blanks within a Line<br/>Special Characters<br/>2.4 - Program Entry, Correction, and Execution<br/>Entering a Program<br/>Compiling and Running a Program<br/>Problem-Solving Case Study: Printing a Chessboard<br/>Testing and Debugging<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Programming Problems<br/>Case Study Follow-Up |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Case Study Follow-Up<br/>3 -Numeric Types, Expressions, and Output<br/>3.1 - Overview of C++ Data Types<br/>3.2 - Numeric Data Types<br/>Integral Types<br/>Floating-Point Types<br/>3.3 - Declarations for Numeric Types<br/>Named Constant Declarations<br/>Variable Declarations<br/>3.4 - Simple Arithmetic Expressions<br/>Arithmetic Operators<br/>Increment and Decrement Operators<br/>3.5 - Compound Arithmetic Expressions<br/>Precedence Rules<br/>Type Coercion and Type Casting<br/>Software Maintenance Case Study: Precedence Error<br/>3.6 - Function Calls and Library Functions<br/>Value-Returning Functions<br/>Library Functions<br/>Void Functions<br/>3.7 - Formatting Output<br/>Integers and Strings<br/>Floating-Point Numbers<br/>3.8 - Additional string Operations<br/>The length and size Functions<br/>The find Function<br/>The substr Function<br/>Accessing Characters within a String: The at Function<br/>Converting to Lowercase and Uppercase<br/>Problem-Solving Case Study: Mortgage Payment Calculator<br/>Testing and Debugging<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Programming Problems<br/>Case Study Follow-Up<br/>4 -Program Input and the Software Design Process<br/>4.1 - Getting Data into Programs<br/>Input Streams and the Extraction Operator (>>)<br/>The Reading Marker and the Newline Character<br/>Reading Character Data with the get Function<br/>Skipping Characters with the ignore Function<br/>Reading String Data<br/>4.2 - Interactive Input/Output<br/>4.3 - Noninteractive Input/Output<br/>4.4 - File Input and Output<br/>Files<br/>Using Files<br/>Software Maintenance Case Study: Adding File Input/Output to a Program<br/>Run-Time Input of File Names<br/>4.5 - Input Failure<br/>4.6 - Software Design Methodologies<br/>4.7 - Functional Decomposition<br/>Modules<br/>Implementing the Design<br/>A Perspective on Design<br/>Problem-Solving Case Study: Displaying a Name in Multiple Formats<br/>Testing and Debugging<br/>Testing and Debugging Hints<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Programming Problems<br/>Case Study Follow-Up<br/>5 -Conditions, Logical Expressions, and Selection Control Structures<br/>5.1 - Flow of Control<br/>Selection<br/>5.2 - Conditions and Logical Expressions<br/>The bool Data Type<br/>Logical Expressions<br/>5.3 - The If Statement<br/>The If-Then-Else Form<br/>Blocks (Compound Statements)<br/>The If-Then Form<br/>A Common Mistake<br/>Software Maintenance Case Study: Incorrect Output<br/>5.4 - Nested if Statements<br/>The Dangling else<br/>5.5 - Logical Operators<br/>Precedence of Operators<br/>Relational Operators with Floating-Point Types<br/>5.6 - Testing the State of an I/O Stream<br/>Problem-Solving Case Study: BMI Calculator<br/>Testing and Debugging<br/>Testing in the Problem-Solving Phase: The Algorithm Walk-Through<br/>Testing in the Implementation Phase<br/>The Test Plan<br/>Tests Performed Automatically During Compilation and Execution<br/>Testing and Debugging Hints<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Programming Problems<br/>Case Study Follow-Up<br/>6 -Looping<br/>6.1 - The While Statement<br/>6.2 - Phases of Loop Execution<br/>6.3 - Loops Using the While Statement<br/>Count-Controlled Loops<br/>Event-Controlled Loops<br/>Looping Subtasks<br/>Software Maintenance Case Study: Make a Program General<br/>6.4 - How to Design Loops<br/>Designing the Flow of Control<br/>Designing the Process within the Loop<br/>The Loop Exit<br/>6.5 - Nested Logic<br/>Designing Nested Loops<br/>Problem-Solving Case Study: Recording Studio Design<br/>Testing and Debugging<br/>Loop-Testing Strategy<br/>Test Plans Involving Loops<br/>Testing and Debugging Hints<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Programming Problems<br/>Case Study Follow-Up<br/>7 -Additional Control Structures<br/>7.1 - The Switch Statement<br/>7.2 - The Do-While Statement<br/>7.3 - The For Statement<br/>Software Maintenance Case Study: Changing a Loop Implementation<br/>7.4 - The Break and Continue Statements<br/>7.5 - Guidelines for Choosing a Looping Statement<br/>7.6 - Additional C++ Operators<br/>Assignment Operators and Assignment Expressions<br/>Increment and Decrement Operators<br/>Bitwise Operators<br/>The Cast Operation<br/>The sizeof Operator<br/>The ?: Operator<br/>Operator Precedence<br/>Type Coercion in Arithmetic and Relational Expressions<br/>Problem-Solving Case Study: The Rich Uncle<br/>Testing and Debugging<br/>Testing and Debugging Hints<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Programming Problems<br/>Case Study Follow-Up<br/> |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
8.1 - Functional Decomposition with Void Functions<br/>When to Use Functions<br/>Why Do Modules Need an Interface Design?<br/>Designing Interfaces<br/>Writing Modules as Void Functions<br/>8.2 - An Overview of User-Defined Functions<br/>Flow of Control in Function Calls<br/>Function Parameters<br/>8.3 - Syntax and Semantics of Void Functions<br/>Function Call (Invocation)<br/>Function Declarations and Definitions<br/>Local Variables<br/>The Return Statement<br/>8.4 - Parameters<br/>Value Parameters<br/>Reference Parameters<br/>Software Maintenance Case Study: Refactoring a Program<br/>Using Expressions with Parameters<br/>A Last Word of Caution About Argument and Parameter Lists<br/>Writing Assertions as Function Documentation<br/>Problem-Solving Case Study: Lawn Care Company Billing<br/>Testing and Debugging<br/>The assert Library Function<br/>Testing and Debugging Hints<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Programming Problems<br/>Case Study Follow-Up<br/>9 -Scope, Lifetime, and More on Functions<br/>9.1 - Scope of Identifiers<br/>Scope Rules<br/>Variable Declarations and Definitions<br/>Namespaces<br/>9.2 - Lifetime of a Variable<br/>Initializations in Declarations<br/>Software Maintenance Case Study: Debug a Simple Program<br/>9.3 - Interface Design<br/>Side Effects<br/>Global Constants<br/>9.4 - Value-Returning Functions<br/>Complete Example<br/>Boolean Functions<br/>Interface Design and Side Effects<br/>When to Use Value-Returning Functions<br/>9.5 - Type Coercion in Assignments, Argument Passing, and Return of a Function Value<br/>Problem-Solving Case Study: Health Profile<br/>Testing and Debugging<br/>Stubs and Drivers<br/>Testing and Debugging Hints<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Programming Problems<br/>Case Study Follow-Up<br/>10 -User-Defined Data Types<br/>10.1 - Built-In Simple Types<br/>Numeric Types<br/>Characters<br/>10.2 - User-Defined Simple Types<br/>The Typedef Statement<br/>Enumeration Types<br/>Named and Anonymous Data Types<br/>10.3 - Simple Versus Structured Data Types<br/>10.4 - Records (Structs)<br/>Accessing Individual Components<br/>Aggregate Operations on Structs<br/>More About Struct Declarations<br/>Binding Like Items<br/>Software Maintenance Case Study: Changing a Loop Implementation<br/>10.5 - Hierarchical Records<br/>10.6 - Unions<br/>Problem-Solving Case Study: Stylistical Analysis of Text<br/>Testing and Debugging<br/>Coping with Input Errors<br/>Testing and Debugging Hints<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Programming Problems<br/>Case Study Follow-Up<br/>11 -Arrays<br/>11.1 - One-Dimensional Arrays<br/>Declaring Arrays<br/>Accessing Individual Components of an Array<br/>Out-of-Bounds Array Indexes<br/>Initializing Arrays in Declarations<br/>(Lack of) Aggregate Array Operations<br/>Examples of Declaring and Accessing Arrays<br/>Passing Arrays as Arguments<br/>Commenting Arrays<br/>Software Maintenance Case Study: Modularizing a Program<br/>Using Typedef with Arrays<br/>11.2 - Arrays of Records<br/>Arrays of Records<br/>11.3 - Special Kinds of Array Processing<br/>Subarray Processing<br/>Indexes with Semantic Content<br/>11.4 - Two-Dimensional Arrays<br/>11.5 - Passing Two-Dimensional Arrays as Arguments<br/>11.6 - Processing Two-Dimensional Arrays<br/>Sum the Rows<br/>Sum the Columns Revised<br/>Sum the Columns<br/>Initialize the Array<br/>Print the Array<br/>11.7 - Another way of Defining Two-Dimensional Arrays<br/>11.8 - Multidimensional Arrays<br/>Problem-Solving Case Study: Calculating Exam Statistics<br/>Problem-Solving Case Study: Favorite Rock Group<br/>Testing and Debugging<br/>One-Dimensional Arrays<br/>Complex Structures<br/>Multidimensional Arrays<br/>Testing and Debugging Hints<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Programming Problems<br/>Case Study Follow-Up<br/>12 -Classes and Abstraction<br/>12.1 - Abstract Data Types<br/>12.2 - C++ Classes<br/>Implementing the Member Functions<br/>Classes, Objects, and Members<br/>Built-in Operations on Objects<br/>Class Scope<br/>12.3 - Information Hiding<br/>User-Written Header Files<br/>Specification and Implementation Files<br/>Compiling and Linking a Multifile Program<br/>12.4 - What is an Object?<br/>12.5 - Class Design Principles<br/>Encapsulation<br/>Abstraction<br/>Designing for Modifiability and Reuse<br/>Mutability<br/>Software Maintenance Case Study: Comparing Two TimeOfDay Objects<br/>12.6 - The Name ADT<br/>Specification of the ADT<br/>Implementation File<br/>12.7 - Composition<br/>Design of an Entry Class<br/>12.8 - UML Diagrams<br/>Diagramming a Class<br/>Diagramming Composition of Classes<br/>Problem-Solving Case Study: Create an Array of Name Objects<br/>Testing and Debugging<br/>Testing and Debugging Hints<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Programming Problems<br/>Case Study Follow-Up<br/>13 -Array-Based Lists<br/>13.1 - What is a List?<br/>13.2 - The List as an Abstract Data Type<br/>Refining Responsibilities<br/>Data Representation<br/>Example Program<br/>13.3 - Implementation of List ADT<br/>Basic Operations<br/>Insertion and Deletion<br/>Sequential Search<br/>Iterators<br/>Software Maintenance Case Study: Enhancing Class List with a Sort<br/>13.4 - Sorted Lists<br/>Basic Operations<br/>Insertion<br/>Sequential Search<br/>Binary Search<br/>Deletion<br/>13.5 - Sorted List of Classes<br/>IsThere<br/>Insert and Delete<br/>13.6 - More on UML Diagrams<br/>Problem-Solving Case Study: Calculating Exam Statistics Revisited<br/>Testing and Debugging<br/>Testing and Debugging Hints<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Programming Problems<br/>Case Study Follow-Up<br/>14 -Pointers and Linked Lists<br/>14.1 - Pointers<br/>Pointer Variables<br/>Pointer Expressions<br/>14.2 - Reference Types<br/>14.3 - Dynamic Data<br/>Allocating Dynamic Data<br/>Deleting Dynamic Data<br/>Constants and Dynamic Data<br/>14.4 - Sequential Versus Linked Structures<br/>14.5 - Creating a Dynamic Linked List: A Walk-Through Example<br/>14.6 - Dynamic Implementation of ADT List<br/>Creating an Empty Linked List<br/>Inserting into a Linked List<br/>Traversals of a Linked List<br/>Deleting from a Linked List<br/>Resetting the List<br/>Getting the Next Item<br/>Testing for the Full Linked List<br/>Searching the List<br/> |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
14.7 - Destructors and Copy Constructors<br/>Destructor<br/>Shallow Versus Deep Copying<br/>Copy-Constructor<br/>14.8 - Sorted Linked List<br/>Insert(20)<br/>Insert(60) (pick up with loop)<br/>Insert(100)<br/>Deleting from a Linked List<br/>Delete(30)<br/>Delete(50)<br/>Problem-Solving Case Study: Creating a Sorted List of Entry Objects<br/>Testing and Debugging<br/>Testing and Debugging Hints<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Programming Problems<br/>Case Study Follow-Up<br/>15 -Inheritance, Polymorphism, and Object-Oriented Design<br/>15.1 - Object-Oriented Programming<br/>15.2 - Inheritance<br/>An Analogy<br/>Inheritance and the Object-Oriented Design Process<br/>Deriving One Class from Another Class<br/>Specification of the ExpandedEntry Class<br/>Implementation of the ExpandedEntry Class<br/>Constructor Execution Order<br/>Software Maintenance Case Study: Extending TimeOfDay with Support for a Time Zone<br/>15.3 - Dynamic Binding and Virtual Functions<br/>The Slicing Problem<br/>Virtual Functions<br/>15.4 - Object-Oriented Design<br/>Brainstorming<br/>Filtering<br/>Scenario Exploration<br/>Responsibility Algorithms<br/>A Final Word<br/>15.5 - Implementing a Design<br/>Problem-Solving Case Study: Creating an Appointment Calendar<br/>Testing and Debugging<br/>Testing and Debugging Hints<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Programming Problems<br/>Case Study Follow-Up<br/>16 -Templates, Operator Overloading, and Exceptions<br/>16.1 - Template Classes<br/>Defining a Class Template<br/>Instantiating a Class Template<br/>Another Way of Implementing Incoming Parameters: const References<br/>Organization of Program Code<br/>A Word of Caution<br/>16.2 - Generic Functions<br/>Function Overloading<br/>Defining a Function Template Outside a Class<br/>Instantiating a Function Template<br/>16.3 - Operator Overloading<br/>Using *this<br/>16.4 - Exceptions<br/>The throw Statement<br/>The try-catch Statement<br/>Nonlocal Exception Handlers<br/>Rethrowing an Exception<br/>Standard Exceptions<br/>Software Maintenance Case Study: Adding Exceptions to the Date Class<br/>Problem-Solving Case Study: Starship Weight and Balance<br/>Testing and Debugging<br/>Testing and Debugging Hints<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Programming Problems<br/>Case Study Follow-Up<br/>17 -Introduction to Data Structures Using the Standard Template Library<br/>17.1 - Abstract Data Structures versus Implementations<br/>17.2 - Additional Linear Structures<br/>Stacks<br/>Queues<br/>Priority Queues<br/>17.3 - Bidirectional Linear Structures<br/>Bidirectional Lists<br/>Deques<br/>17.4 - An Introduction to the STL<br/>Iterators<br/>The vector Template<br/>The list Template<br/>The stack Template<br/>The queue Template<br/>The priority_queue Template<br/>The deque Template<br/>Software Maintenance Case Study: Appointment Calendar Using STL List<br/>17.5 - Nonlinear Structures<br/>Binary Trees<br/>Hash Tables<br/>17.6 - Associative Containers<br/>The set Template<br/>The map Template<br/>Problem-Solving Case Study: Creating a Deck of Cards<br/>Testing and Debugging<br/>Testing and Debugging Hints<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Programming Problems<br/>Case Study Follow-Up<br/>18 -Recursion<br/>18.1 - What is Recursion?<br/>18.2 - Recursive Algorithms with Simple Variables<br/>18.3 - Towers of Hanoi<br/>18.4 - Recursive Algorithms with Structured Variables<br/>Software Maintenance Case Study: Substituting Binary Search for Linear Search<br/>18.5 - Recursion Using Pointer Variables<br/>Printing a Dynamic Linked List in Reverse Order<br/>Copying a Dynamic Linked List<br/>18.6 - Recursion or Iteration?<br/>Problem-Solving Case Study: Quicksort<br/>Testing and Debugging<br/>Testing and Debugging Hints<br/>Summary<br/>Quick Check<br/>Answers<br/>Exam Preparation Exercises<br/>Programming Warm-Up Exercises<br/>Programming Problems<br/>Case Study Follow-Up<br/>Appendices<br/>Index |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
C++ (Computer program language) |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Weems, Chip. |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
Books |
| Source of classification or shelving scheme |
Dewey Decimal Classification |