Starting Out with C++: From Control Structures through Objects (6th Edition)

Cover\0\0\0\0\0\0\0\0\0\0\0\0......Page 1
Title Page......Page 4
Copyright......Page 5
Contents......Page 8
Preface......Page 14
1.1 Why Program?......Page 30
1.2 Computer Systems: Hardware and Software......Page 31
1.3 Programs and Programming Languages......Page 35
1.4 What Is a Program Made of?......Page 41
1.5 Input, Processing, and Output......Page 45
1.6 The Programming Process......Page 46
1.7 Procedural and Object-Oriented Programming......Page 50
2.1 The Parts of a C++ Program......Page 58
2.2 The cout Object......Page 62
2.3 The #include Directive......Page 67
2.4 Variables and Literals......Page 68
2.5 Identifiers......Page 72
2.6 Integer Data Types......Page 73
2.7 The char Data Type......Page 78
2.8 Floating-Point Data Types......Page 83
2.9 The bool Data Type......Page 86
2.10 Determining the Size of a Data Type......Page 87
2.11 Variable Assignments and Initialization......Page 88
2.12 Scope......Page 89
2.13 Arithmetic Operators......Page 90
2.14 Comments......Page 96
2.15 Focus on Software Engineering: Programming Style......Page 98
2.16 If You Plan to Continue in Computer Science: Standard and Prestandard C++......Page 100
3.1 The cin Object......Page 112
3.2 Mathematical Expressions......Page 120
3.3 When You Mix Apples and Oranges: Type Conversion......Page 129
3.4 Overflow and Underflow......Page 131
3.5 Type Casting......Page 133
3.6 Named Constants......Page 136
3.7 Multiple Assignment and Combined Assignment......Page 141
3.8 Formatting Output......Page 145
3.9 Formatted Input......Page 154
3.10 Focus on Object-Oriented Programming: More About Member Functions......Page 159
3.11 More Mathematical Library Functions......Page 160
3.12 Focus on Debugging: Hand Tracing a Program......Page 164
3.13 Focus on Problem Solving: A Case Study......Page 166
3.14 Introduction to File Input and Output......Page 169
4.1 Relational Operators......Page 192
4.2 The if Statement......Page 197
4.3 Flags......Page 205
4.4 Expanding the if Statement......Page 206
4.5 The if/else Statement......Page 210
4.6 Nested if Statements......Page 213
4.7 The if/else if Statement......Page 220
4.8 Menus......Page 224
4.9 Logical Operators......Page 228
4.10 Checking Numeric Ranges with Logical Operators......Page 235
4.11 Focus on Software Engineering: Validating User Input......Page 236
4.12 More About Variable Definitions and Scope......Page 238
4.13 Comparing Strings......Page 242
4.14 The Conditional Operator......Page 247
4.15 The switch Statement......Page 251
4.16 Testing for File Open Errors......Page 260
5.1 The Increment and Decrement Operators......Page 278
5.2 Introduction to Loops: The while Loop......Page 283
5.3 Using the while Loop for Input Validation......Page 290
5.4 Counters......Page 292
5.5 The do-while Loop......Page 294
5.6 The for Loop......Page 299
5.7 Keeping a Running Total......Page 309
5.8 Sentinels......Page 312
5.9 Using a Loop to Read Data from a File......Page 313
5.11 Nested Loops......Page 316
5.12 Breaking Out of a Loop......Page 319
5.13 The continue Statement......Page 321
6.1 Focus on Software Engineering: Modular Programming......Page 336
6.2 Defining and Calling Functions......Page 338
6.3 Function Prototypes......Page 346
6.4 Sending Data into a Function......Page 348
6.5 Passing Data by Value......Page 353
6.6 Focus on Software Engineering: Using Functions in a Menu-Driven Program......Page 355
6.7 The return Statement......Page 359
6.8 Returning a Value from a Function......Page 361
6.9 Returning a Boolean Value......Page 369
6.10 Local and Global Variables......Page 371
6.11 Static Local Variables......Page 379
6.12 Default Arguments......Page 382
6.13 Using Reference Variables as Parameters......Page 385
6.14 Overloading Functions......Page 391
6.15 The exit() Function......Page 395
6.16 Stubs and Drivers......Page 398
7.1 Arrays Hold Multiple Values......Page 416
7.2 Accessing Array Elements......Page 418
7.3 No Bounds Checking in C++......Page 425
7.4 Array Initialization......Page 428
7.5 Processing Array Contents......Page 433
7.6 Focus on Software Engineering: Using Parallel Arrays......Page 441
7.7 Arrays as Function Arguments......Page 444
7.8 Two-Dimensional Arrays......Page 455
7.9 Arrays of Strings......Page 462
7.10 Arrays with Three or More Dimensions......Page 464
7.11 Focus on Problem Solving and Program Design: A Case Study......Page 466
7.12 If You Plan to Continue in Computer Science: Introduction to the STL vector......Page 468
8.1 Focus on Software Engineering: Introduction to Search Algorithms......Page 496
8.2 Focus on Problem Solving and Program Design: A Case Study......Page 503
8.3 Focus on Software Engineering: Introduction to Sorting Algorithms......Page 509
8.4 Focus on Problem Solving and Program Design: A Case Study......Page 517
8.5 If You Plan to Continue in Computer Science: Sorting and Searching vectors (Continued from Section 7.12)......Page 525
9.1 Getting the Address of a Variable......Page 536
9.2 Pointer Variables......Page 538
9.3 The Relationship Between Arrays and Pointers......Page 545
9.4 Pointer Arithmetic......Page 549
9.5 Initializing Pointers......Page 551
9.6 Comparing Pointers......Page 552
9.7 Pointers as Function Parameters......Page 554
9.8 Focus on Software Engineering: Dynamic Memory Allocation......Page 563
9.9 Focus on Software Engineering: Returning Pointers from Functions......Page 567
9.10 Focus on Problem Solving and Program Design: A Case Study......Page 574
10.1 Character Testing......Page 588
10.2 Character Case Conversion......Page 592
10.3 Review of the Internal Storage of C-Strings......Page 595
10.4 Library Functions for Working with C-Strings......Page 598
10.5 String/Numeric Conversion Functions......Page 606
10.6 Focus on Software Engineering: Writing Your Own C-String-Handling Functions......Page 611
10.7 The C++ string Class......Page 617
10.8 Focus on Problem Solving and Program Design: A Case Study......Page 627
11.1 Abstract Data Types......Page 638
11.2 Focus on Software Engineering: Combining Data into Structures......Page 640
11.3 Accessing Structure Members......Page 643
11.4 Initializing a Structure......Page 648
11.5 Arrays of Structures......Page 652
11.6 Focus on Software Engineering: Nested Structures......Page 655
11.7 Structures as Function Arguments......Page 659
11.8 Returning a Structure from a Function......Page 662
11.9 Pointers to Structures......Page 665
11.10 Focus on Software Engineering: When to Use ., When to Use ->, and When to Use *......Page 668
11.11 Unions......Page 670
11.12 Enumerated Data Types......Page 674
12.1 File Operations......Page 702
12.2 File Output Formatting......Page 709
12.3 Passing File Stream Objects to Functions......Page 712
12.4 More Detailed Error Testing......Page 714
12.5 Member Functions for Reading and Writing Files......Page 717
12.6 Focus on Software Engineering: Working with Multiple Files......Page 724
12.7 Binary Files......Page 725
12.8 Creating Records with Structures......Page 731
12.9 Random-Access Files......Page 735
12.10 Opening a File for Both Input and Output......Page 743
13.1 Procedural and Object-Oriented Programming......Page 758
13.2 Introduction to Classes......Page 765
13.3 Defining an Instance of a Class......Page 770
13.4 Why Have Private Members?......Page 781
13.5 Focus on Software Engineering: Separating Class Specification from Implementation......Page 782
13.6 Inline Member Functions......Page 788
13.7 Constructors......Page 791
13.8 Passing Arguments to Constructors......Page 795
13.9 Destructors......Page 803
13.10 Overloading Constructors......Page 807
13.11 Private Member Functions......Page 811
13.12 Arrays of Objects......Page 813
13.13 Focus on Problem Solving and Program Design: An OOP Case Study......Page 817
13.14 Focus on Object-Oriented Programming: Creating an Abstract Array Data Type......Page 824
13.15 Focus on Object-Oriented Design: The Unified Modeling Language (UML)......Page 828
13.16 Focus on Object-Oriented Design: Finding the Classes and Their Responsibilities......Page 831
14.1 Instance and Static Members......Page 854
14.2 Friends of Classes......Page 862
14.3 Memberwise Assignment......Page 867
14.4 Copy Constructors......Page 868
14.5 Operator Overloading......Page 872
14.6 Object Conversion......Page 899
14.7 Aggregation......Page 901
14.8 Focus on Object-Oriented Design: Class Collaborations......Page 907
15.1 What Is Inheritance?......Page 924
15.2 Protected Members and Class Access......Page 933
15.3 Constructors and Destructors in Base and Derived Classes......Page 939
15.4 Redefining Base Class Functions......Page 946
15.5 Class Hierarchies......Page 950
15.6 Polymorphism and Virtual Member Functions......Page 956
15.7 Abstract Base Classes and Pure Virtual Functions......Page 971
15.8 Multiple Inheritance......Page 978
16.1 Exceptions......Page 1000
16.2 Function Templates......Page 1019
16.3 Focus on Software Engineering: Where to Start When Defining Templates......Page 1025
16.4 Class Templates......Page 1026
16.5 Introduction to the Standard Template Library (STL)......Page 1036
17.1 Introduction to the Linked List ADT......Page 1056
17.2 Linked List Operations......Page 1058
17.3 A Linked List Template......Page 1075
17.4 Variations of the Linked List......Page 1087
17.5 The STL list Container......Page 1088
18.1 Introduction to the Stack ADT......Page 1096
18.2 Dynamic Stacks......Page 1107
18.3 The STL stack Container......Page 1112
18.4 Introduction to the Queue ADT......Page 1114
18.5 Dynamic Queues......Page 1122
18.6 The STL deque and queue Containers......Page 1126
19.1 Introduction to Recursion......Page 1136
19.2 Solving Problems with Recursion......Page 1141
19.3 Focus on Problem Solving and Program Design: The Recursive gcd Function......Page 1148
19.4 Focus on Problem Solving and Program Design: Solving Recursively Defined Problems......Page 1149
19.5 Focus on Problem Solving and Program Design: Recursive Linked List Operations......Page 1151
19.6 Focus on Problem Solving and Program Design: A Recursive Binary Search Function......Page 1154
19.7 The Towers of Hanoi......Page 1157
19.8 Focus on Problem Solving and Program Design: The QuickSort Algorithm......Page 1160
19.9 Exhaustive Algorithms......Page 1165
19.10 Focus on Software Engineering: Recursion vs. Iteration......Page 1167
20.1 Definition and Applications of Binary Trees......Page 1174
20.2 Binary Search Tree Operations......Page 1177
20.3 Template Considerations for Binary Search Trees......Page 1194
Appendix A: Getting Started with Alice......Page 1200
Appendix B: The ASCII Character Set......Page 1228
Appendix C: Operator Precedence and Associativity......Page 1232
Appendix D: Introduction to Flowcharting......Page 1234
Appendix E: Using UML in Class Design......Page 1244
Appendix F: Namespaces......Page 1252
Appendix G: Writing Managed C++ Code for the .NET Framework......Page 1256
Appendix H: Passing Command Line Arguments......Page 1266
Appendix I: Header File and Library Function Reference......Page 1268
Appendix J: Binary Numbers and Bitwise Operations......Page 1280
Appendix K: Multi-Source File Programs......Page 1290
Appendix L: Stream Member Functions for Formatting......Page 1294
Appendix M: Introduction to Microsoft Visual C++ 2008 Express Edition......Page 1298
Appendix N: Answers to Checkpoints......Page 1320
Appendix O: Answers to Odd Numbered Review Questions......Page 1354
A......Page 1382
C......Page 1383
E......Page 1385
F......Page 1386
I......Page 1387
L......Page 1388
O......Page 1389
P......Page 1390
S......Page 1391
V......Page 1393
Z......Page 1394