Computer science : a structured approach using C++

목차 (Table of Contents)

• CONTENTS
• CHAPTER 1 INTRODUCTION TO COMPUTERS = 1
• 1-1 COMPUTER SYSTEMS = 2
• 1-2 COMPUTER HARDWARE = 2
• 1-3 COMPUTER SOFTWARE = 3
• System Software = 3
• Application Software = 4
• 1-4 COMPUTING ENVIRONMENTS = 4
• Personal Computing Environment = 4
• Time-Sharing Environment = 5
• Client／Server Environment = 6
• Distributed Computing = 6
• 1-5 COMPUTER LANGUAGES = 7
• Machine Languages = 7
• Symbolic Languages = 8
• High-Level Languages = 9
• Natural Languages = 10
• 1-6 WRITING, EDITING, COMPILING, AND LINKING PROGRAM = 10
• Writing and Editing Programs = 10
• Compiling Programs = 10
• Linking Programs = 11
• 1-7 PROGRAM EXECUTION = 11
• 1-8 SYSTEM DEVELOPMENT = 12
• System Development Life Cycle = 12
• Program Development = 13
• 1-9 SOFTWARE ENGINEERING AND PROGRAMMING STYLE = 20
• 1-10 TIPS AND COMMON PROGRAMMING ERRORS = 21
• 1-11 KEY TERMS = 22
• 1-12 SUMMARY = 22
• 1-13 PRACTICE SETS = 23
• Review Questions = 23
• Exercises = 24
• Problems = 24
• CHAPTER 2 INTRODUCTION TO THE C++ LANGUAGE = 25
• 2-1 BACKGROUND = 26
• 2-2 C++ PROGRAMS = 27
• Structure of a C++ Program = 27
• A Simple Program = 28
• Your First Program = 28
• Comments = 31
• 2-3 IDENTIFIERS = 32
• 2-4 DATA TYPES = 33
• Void = 34
• Integer = 34
• Char = 35
• Floating point = 36
• Logical Data in C++ = 37
• 2-5 VARIABLES = 38
• Variable Declaration and Definition = 38
• Variable Initialization = 39
• 2-6 CONSTANTS = 41
• Integer Constants = 41
• Float Constants = 41
• Character Constants = 42
• String Constants = 43
• Boolean Constants = 43
• 2-7 CODING CONSTANTS = 44
• Literal Constants = 44
• Defined Constants = 44
• Memory Constants = 44
• Summary = 45
• 2-8 READING AND WRITING DATA = 45
• Data Sources and Destinations = 46
• Standard Streams = 46
• Writing Data to Standard Out(cout) = 47
• Writing Errors(cerr and clog) = 49
• Formatting Output = 49
• Reading Data from Standard Input(cin) = 58
• 2-9 PROGRAMMING EXAMPLES = 60
• Print "Nothing!" = 60
• Print Character Values = 60
• Calculatre Area and Circumference = 62
• 2-10 SOFTWARE ENGINEERING AND PROGRAMMING STYLE = 65
• Program Documentation = 65
• Data Names = 66
• Data Hiding = 68
• 2-11 TIPS AND COMMON PROGRAMMING ERRORS = 68
• 2-12 KEY TERMS = 69
• 2-13 SUMMARY = 70
• 2-14 PRACTICE SETS = 70
• Review Questions = 70
• Exercises = 71
• Problems = 72
• Projects = 73
• CHAPTER 3 STRUCTURE OF A C++ PROGRAM = 74
• 3-1 EXPRESSIONS = 75
• Primary Expressions = 76
• Binary Expressions = 77
• Assignment Expressions = 79
• Postfix Expressions = 82
• Unary Expressions = 84
• 3-2 PRECEDENCE AND ASSOCIATIVITY = 87
• Precedence = 87
• Associativity = 88
• 3-3 SIDE EFFECTS = 90
• 3-4 EVALUATING EXPRESSIONS = 91
• Expressions without Side Effects = 91
• Expressions with Side Effects = 92
• Warning = 93
• 3-5 MIXED TYPE EXPRESSIONS = 94
• Implicit Type Conversion = 94
• Explicit Type Conversion(Cast) = 97
• 3-6 STATEMENTS = 98
• Expression Statements = 99
• Compound Statements = 100
• Statements and Defined Constants = 101
• 3-7 SAMPLE PROGRAMS = 101
• Example：Calculate Quotient and Remainder = 101
• Example：Print Right Digit = 102
• Example：Calcualte Average = 103
• Example：Degrees to Radians = 104
• Example：Fahrenheit to Celsius = 105
• Example：Calculate Sales Total = 106
• Example：Calculate Student Score = 108
• 3-8 SOFTWARE ENGINEERING AND PROGRAMMING STYLE = 111
• KISS = 111
• Parentheses = 111
• User Communication = 112
• 3-9 TIPS AND COMMON PROGRAMMING ERRORS = 113
• 3-10 KEY TERMS = 113
• 3-11 SUMMARY = 114
• 3-12 PRACTICE SETS = 114
• Review Questions = 114
• Exercises = 115
• Problems = 116
• Projects = 117
• CHAPTER 4 FUNCTIONS = 118
• 4-1 DESIGNING STRUCTURED PROGRAMS = 119
• 4-2 FUNCTIONS IN C++ = 120
• 4-3 USER-DEFINED FUNCTIONS = 123
• Void Functions with No Parameters = 124
• Void Functions with Parameters = 124
• Functions That Return Values = 126
• Function Definition = 128
• Prototype Declaration = 131
• The Function Call = 132
• Function Examples = 133
• Parameter Passing = 140
• 4-4 DEFAULT PARAMETER ARGUMENTS = 146
• 4-5 STANDARD LIBRARY FUNCTIONS = 147
• Standard Functions for Mathematical Manipulation = 148
• General Library Functions = 150
• Scaling Random Numbers = 152
• 4-6 SCOPE = 154
• General Rule = 154
• Global Scope = 155
• Local Scope = 155
• 4-7 A PROGRAMMING EXAMPLE - CALCULATOR PROGRAM = 157
• 4-8 SOFTWARE ENGINEERING AND PROGRAMMING STYLE = 159
• Structure Charts = 159
• Structure Chart Rules and Symbols = 159
• Functional Cohesion = 162
• Top-Down Development = 164
• 4-9 TIPS AND COMMON PROGRAMMING ERRORS = 166
• 4-10 KEY TERMS = 167
• 4-11 SUMMARY = 167
• 4-12 PRACTICE SETS = 168
• Review Questions = 168
• Exercises = 169
• Problems = 171
• Projects = 171
• CHAPTER 5 SELECTION - MAKING DECISIONS = 174
• 5-1 LOGICAL DATA AND OPERATORS = 175
• Logical Data in C++ = 175
• Logical Operators = 175
• Evaluating Logical Expressions = 176
• Relational Operators = 179
• 5-2 TWO-WAY SELECTION = 181
• if...else Statement = 182
• Null else Statement = 184
• Nested if Statements = 186
• Dangling else Problem = 187
• Simplifying if Statements = 188
• Conditional Expressions = 189
• Handling Major Errors = 190
• Two-Way Selection Example = 191
• 5-3 MULTIWAY SELECTION = 196
• The switch Statement = 196
• The else-if Statement = 202
• 5-4 MORE STANDARD LIBRARY FUNCTIONS = 209
• Standard Characters Functions = 207
• 5-5 A MENU PROGRAM = 207
• 5-6 SOFTWARE ENGINEERING AND PROGRAMMING STYLE = 212
• Dependent Statements = 212
• Negative Logic = 213
• Rules for Selection Statements = 214
• Selection in Structure Charts = 214
• 5-7 TIPS AND COMMON PROGRAMMING ERRORS = 216
• 5-8 KEY TERMS = 217
• 5-9 SUMMARY = 218
• 5-10 PRACTICE SETS = 218
• Review Questions = 218
• Exercises = 219
• Problems = 221
• Projects = 222
• CHAPTER 6 REPETITION = 226
• 6-1 CONCEPT OF A LOOP = 227
• 6-2 PRETEST AND POST-TEST LOOPS = 227
• 6-3 INITIALIZATION AND UPDATING = 229
• Loop Initialization = 229
• Loop Update = 230
• 6-4 EVENT-CONTROLLED AND COUNTER-CONTROLLED LOOPS = 230
• Event-Controlled loops = 230
• Counter-Controlled Loops = 231
• Loop Comparison = 231
• 6-5 LOOPS IN C++ = 232
• The while Loop = 232
• The for Loop = 236
• The do...while Loop = 241
• The Comma Expression = 244
• 6-6 LOOP EXAMPLES = 246
• for Loops = 246
• while Loops = 252
• do...while Loops = 254
• 6-7 OTHER STATEMENTS RELATED TO LOOPING = 257
• break Statement = 257
• continue Statement = 258
• 6-8 LOOPING APPLICATIONS = 260
• Summation = 260
• Product = 262
• Smallest and Largest = 262
• Inquiries = 263
• 6-9 RECURSION = 265
• Iterative Definition = 265
• Recursive Definition = 266
• Factorial-Iterative Solution = 266
• Factorial-Recursive Solution = 267
• Designing Recursive Functions = 267
• Fibonacci Numbers = 269
• Limitations of Recursion = 272
• The Towers of Hanoi = 272
• Recursive Solution of the Towers of Hanoi = 273
• 6-10 A PROGRAMMING EXAMPLE - THE CALCULATOR PROGRAM = 276
• 6-11 SOFTWARE ENGINEERING AND PROGRAMMING STYLE = 280
• Loops in Structure Charts = 280
• Determining Algorithm Efficiency = 281
• Linear Loops = 281
• Logarithmic Loops = 282
• Nested Loop = 283
• Big-O Notation = 284
• Standard Measures of Efficiency = 285
• 6-12 TIPS AND COMMON PROGRAMMING ERRORS = 286
• 6-13 KEY TERMS = 288
• 6-14 SUMMARY = 288
• 6-15 PRACTICE SETS = 289
• Review Questions = 289
• Exercises = 290
• Problems = 292
• Projects = 294
• CHAPTER 7 TEXT I／O = 298
• 7-1 INPUT AND OUTPUT ENTITIES = 299
• Files = 299
• Standard Input = 299
• Standard Output = 300
• Standard Error = 300
• 7-2 STREAMS = 300
• Creating and Connecting Streams = 301
• Standard Streams = 301
• File Streams = 302
• 7-3 STANDARD LIBRARY INPUT／OUTPUT FUNCTIONS = 303
• File Open and Close = 303
• 7-4 FORMATTING INPUT AND OUTPUT = 306
• Input／Output Operators = 306
• Formatting Data = 307
• Summary = 318
• 7-5 FILE EXAMPLE = 320
• 7-6 CHARACTER INPUT／OUTPUT FUNCTIONS = 323
• get = 323
• put = 324
• 7-7 CHARACTER INPUT／OUTPUT EXAMPLES = 324
• Create Text File = 324
• Copy Text File = 325
• Count Characters and Lines = 326
• Count Words in File = 327
• 7-8 DETECTING FILE ERRORS = 329
• Stream Status = 329
• Error Recovery = 331
• 7-9 SOFTWARE ENGINEERING AND PROGRAMMING STYLE = 335
• Testing Files = 335
• 7-10 TIPS AND COMMON PROGRAMMING ERRORS = 338
• 7-11 KEY TERMS = 339
• 7-12 SUMMARY = 339
• 7-13 PRACTICE SETS = 340
• Review Questions = 340
• Exercises = 341
• Problems = 341
• Projects = 342
• CHAPTER 8 ARRAYS = 344
• 8-1 CONCEPTS = 345
• 8-2 USING ARRAYS IN C++ = 348
• Declaration and Definition = 348
• Accessing Elements in Arrays = 348
• Storing Values in Arrays = 349
• Precedence of Index Operators = 353
• Index Range Checking = 353
• 8-3 ARRAYS AND FUNCTIONS = 356
• Passing Individual Elements = 356
• Passing the Whole Array = 357
• 8-4 ARRAY APPLICATIONS = 359
• Frequency Arrays = 359
• Histograms = 360
• Random Number Permutations = 364
• 8-5 SORTING = 367
• Selection Sort = 367
• Selection Sort Algorithm = 368
• Bubble Sort = 369
• Bubble Sort Algorithm = 371
• Insertion Sort = 372
• Insertion Sort Algorithm = 373
• Insertion Sort Reprogrammed = 374
• Sort Conclusions = 376
• 8-6 SEARCHING = 376
• Sequential Search = 377
• Binary Search = 379
• 8-7 TWO-DIMENSIONAL ARRAYS = 382
• Declaring and Defining Two-Dimensional Arrays = 384
• Passing a Two-Dimensional Array to a Function = 388
• Array Example = 389
• 8-8 MULTIDIMENSIONAL ARRAYS = 391
• Declaring and Defining Multi-Dimensional Arrays = 393
• 8-9 PROGRAMMING EXAMPLE-CALCULATE ROW AND COLUMN AVERAGES = 394
• 8-10 SOFTWARE ENGINEERING AND PROGRAMMING STYLE = 398
• Testing Sorts = 398
• Testing Searches = 398
• Analyzing Sort Algorithms = 399
• Analyzing Search Algorithms = 401
• 8-11 TIPS AND COMMON PROGRAMMING ERRORS = 402
• 8-12 KEY TERMS = 403
• 8-13 SUMMARY = 403
• 8-14 PRACTICE SETS = 404
• Review Questions = 404
• Exercises = 405
• Problems = 407
• Projects = 408
• CHAPTER 9 POINTES = 412
• 9-1 CONCEPTS = 413
• Pointer Constants = 413
• Pointer Values = 414
• 9-2 POINTER VARIABLES = 416
• 9-3 ACCESSING VARIABLES THROUGH POINTERS = 417
• The Indirection Operator = 417
• 9-4 POINTER DECLARATION AND DEFINITION = 418
• 9-5 INITIALIZATION OF POINTER VARIABLES = 420
• Example：Fun with Pointers = 421
• Example：Add Two Numbers = 423
• Example：Pointer Flexibility = 424
• Example：Multiple Pointers for One Variable = 425
• 9-6 POINTERS AND FUNCTIONS = 425
• Pointers as Formal Parameters = 426
• Functions Returning Pointers = 427
• 9-7 POINTERS TO POINTERS = 425
• Pointer-to-Pointer Example = 429
• 9-8 COMPATIBILITY = 430
• Compatibility and the void Pointer = 431
• Casting Pointers = 432
• 9-9 READING AND WRITING POINTER VALUES = 433
• 9-10 LVALUE AND RVALUE = 434
• 9-11 POINTER APPLICATIONS = 436
• Convert Seconds to Hours = 436
• Quadratic Equations = 437
• 9-12 ARRAYS AND POINTERS = 442
• 9-13 POINTER ARITHMETIC AND ARRAYS = 445
• Pointers and One-Dimensional Arrays = 445
• Pointers and Other Operators = 448
• Pointers and Two-Dimensional Arrays = 450
• 9-14 PASSING AN ARRAY TO A FUNCTION = 451
• 9-15 MEMORY ALLOCATION FUNCTIONS = 453
• Memory Allocation = 455
• 9-16 ARRAY OF POINTERS = 460
• 9-17 PROGRAMMING APPLICATION = 461
• Selection Sort Revisited = 461
• Dynamic Array = 465
• 9-18 SOFTWARE ENGINEERING AND PROGRAMMING STYLE = 471
• Pointers and Function Calls = 471
• Pointers and Arrays = 471
• Array Index Commutativity = 472
• Dynamic Memory：Theory Versus Practice = 472
• 9-19 TIPS AND COMMON PROGRAMMING ERRORS = 473
• 9-20 KEY TERMS = 475
• 9-21 SUMMARY = 475
• 9-22 PRACTICE SETS = 476
• Review Questions = 476
• Exercises = 478
• Problems = 483
• Projects = 485
• CHAPTER 10 CLASSES = 488
• 10-1 BASIC CLASS CONCEPTS = 489
• Access Specifiers = 489
• Creating a Class = 490
• 10-2 CLASS OBJECTS = 494
• Instantiation = 494
• Accessing Object Members = 494
• Using Classes = 495
• The this Pointer = 498
• 10-3 MANAGER FUNCTIONS = 499
• Constructors = 495
• Copy Constructor = 506
• Destructors = 509
• 10-4 MUTATORS AND ACCESSORS = 510
• Mutator Functions = 510
• Accessor Functions = 510
• 10-5 CLASS INVARIANTS = 511
• Greatest Common Divisor = 512
• Constructor = 512
• Changing Store Function = 513
• Revised Fractin Class = 513
• 10-6 COMPLEX CLASS FUNCTIONS = 517
• Unary Class Functions = 517
• Binary Class Functions = 518
• Comparing Fractions = 523
• 10-7 PROGRAMMING APPLICATIONS = 524
• Account Class = 524
• Time Class = 526
• 10-8 SOFTWARE ENGINEERING AND PROGRAMMING STYLE = 530
• UML：Class Diagrams = 530
• Relationships Between Classes = 532
• UML：Objects = 534
• 10-9 TIPS AND COMMON PROGRAMMING ERRORS = 535
• 10-10 KEY TERMS = 536
• 10-11 SUMMARY = 536
• 10-12 PRACTICE SETS = 537
• Review Questions = 537
• Exercises = 538
• Problems = 539
• Projects = 539
• CHAPTER 11 MORE CLASS FEATURES AND OTHER TYPES = 541
• 11-1 INLINE FUNCTIONS = 542
• Nonmember Inline Functions = 542
• Inline Member Functions = 543
• 11-2 INITIALIZATION LIST = 544
• 11-3 OVERLOADING = 545
• Operator Overloading = 545
• Final Fraction Class Header = 551
• 11-4 STATIC MEMBERS = 556
• Static Data Members = 557
• Static Function Members = 558
• Static Member Demonstration = 558
• 11-5 FRIEND CLASSES = 560
• 11-6 CLASSES AND POINTERS = 561
• Class Containing Pointers = 561
• Pointers to Objects = 563
• 11-7 ARRAY OF OBJECTS = 564
• Initialization of Objects = 564
• Accessing Objects = 565
• 11-8 STRUCTURE = 567
• Structure Application = 568
• Initialization = 568
• Summary = 569
• 11-9 UNIONS = 569
• Referencing Unions = 570
• Initializers = 570
• 11-10 ENUMERATED TYPES = 571
• Declaring an Enumerated Type = 571
• Assigning Values to Enumerated Types = 572
• Enumeration Type Conversion = 572
• Initializing Enumerated Constants = 573
• Anonymous Enumeration：Constants = 573
• 11-11 THE TYPE DEFINITION(typedef) = 574
• typedef and Portable Programs = 574
• typedef and Array Declarations = 575
• 11-12 PROGRAMMING APPLICATIONS = 575
• Elevator Design = 575
• Elevator Class = 577
• 11-13 SOFTWARE ENGINEERING AND PROGRAMMING STYLE = 585
• Coupling = 585
• Data Hiding = 588
• Summary = 589
• 11-14 TIPS AND COMMON PROGRAMMING ERRORS = 589
• 11-15 KEY TERMS = 590
• 11-16 SUMMARY = 590
• 11-17 PRACTICE SETS = 591
• Review Questions = 591
• Exercises = 592
• Problems = 594
• Projects = 594
• CHAPTER 12 INHERITANCE AND AGGREGATION = 596
• 12-1 INHERITANCE = 597
• Basic Concepts = 597
• 12-2 PRIVATE, PROTECTED, PUBLIC = 601
• Private Inheritance Type = 601
• Protected Inheritance Type = 601
• Public Inheritance Type = 602
• Inheritance Example = 602
• Polygon-Triangle Implementation = 602
• Overriding Inherited Access Specifiers = 606
• 12-3 MANAGER FUNCTIONS UNDER INHERITANCE = 607
• Constructors = 607
• Copy Constructors = 608
• Destructors = 608
• Employee Class Example = 608
• Employee Class Program = 611
• 12-4 OVERRIDING MEMBER FUNCTIONS = 612
• Overridden Method Example = 612
• Overriding Versus Overloading = 614
• 12-5 POLYMORPHISM = 615
• Static Binding = 615
• Dynamic Binding and Virtual Functions = 616
• 12-6 PURE VIRTUAL FUNCTIONS：ABSTRACT CLASSES = 619
• Pure Virtual Function = 619
• Abstract Classes = 619
• 12-7 TYPE CONVERSION IN HIERARCHICAL CLASSES = 625
• Casting Objects = 626
• Catsing Pointers to Objects = 628
• 12-8 MULTIPLE INHERITANCE = 629
• 12-9 AGGREGATION = 632
• Example：Student Class = 632
• Aggregation Versus Composition = 636
• 12-10 SOFTWARE ENGINEERING AND PROGRAMMING STYLE = 637
• Program Design Concepts = 637
• Information Hiding = 637
• Cohesion = 637
• Summary = 641
• 12-11 TIPS AND COMMON PROGRAMMING ERRORS = 641
• 12-12 KEY TERMS = 642
• 12-13 SUMMARY = 642
• 12-14 PRACTICE SETS = 643
• Review Questions = 643
• Exercises = 644
• Problems = 645
• Projects = 646
• CHAPTER 13 TEMPLATES = 648
• 13-1 FUNCTION TEMPLATES = 649
• Template Format = 652
• Overloading Function Templates = 653
• Mixed Argument Types = 654
• Multiple Generic Argument Types = 655
• Function Templates versus Other Solutions = 657
• 13-2 CLASS TEMPLATES = 658
• Class Template Syntax = 658
• Defining the Class = 659
• Instantiation of Objects = 661
• Array Class = 661
• Specialized Member Functions = 666
• Class Template Inheritance = 666
• 13-3 SOFTWARE ENGINEERING AND PROGRAMMING STYLE = 670
• Atomic and Composite Data = 670
• Data Structure = 670
• Abstract Data Type = 671
• A Model for an Abstract Data Type = 672
• ADTs and Templates = 673
• 13-4 TIPS AND COMMON PROGRAMMING ERRORS = 673
• 13-5 KEY TERMS = 674
• 13-6 SUMMARY = 674
• 13-7 PRACTICE SETS = 675
• Review Questions = 675
• Exercises = 675
• Problems = 676
• Projects = 676
• CHAPTER 14 STRINGS = 677
• 14-1 STRING CONCEPTS = 678
• Fixed-Length Strings = 678
• Variable-Length Strings = 678
• 14-2 C++ STRINGS = 679
• The String Class = 679
• 14-3 C++ STRING INPUT／OUTPUT = 682
• String Output(＜＜) = 682
• String Input(＞＞) = 682
• Assignment Operator = 684
• C++ String Examples = 685
• 14-4 ARRAYS OF STRINGS = 689
• 14-5 STRING MANIPULATION FUNCTIONS = 690
• String Length(length and size) = 691
• String Compare = 691
• Concatenating and Appending = 694
• Extracting a Substring = 696
• Searching for a Substring = 697
• Searching for Characters = 699
• Access and Modify Characters = 701
• String Insertion = 702
• Replace String = 704
• Erase String = 705
• Swap Strings = 706
• Convert to C String = 707
• 14-6 A PROGRAMMING EXAMPLE：MORSE CODE = 707
• 14-7 C STRINGS = 715
• Basic C-String Concepts = 715
• C String Input／Output = 716
• The C-String Function Library = 717
• Converting C Strings to C++ Strings = 721
• 14-8 COMPARISON BETWEEN C AND C++ STRINGS = 721
• 14-9 SOFTWARE ENGINEERING AND PROGRAMMING STYLE = 723
• Payroll Case Study = 7223
• Program Design Steps = 724
• Structure Chart Design = 724
• 14-10 TIPS AND COMMON PROGRAMMING ERRORS = 729
• 14-11 KEY TERMS = 730
• 14-12 SUMMARY = 730
• 14-13 PRACTICE SETS = 731
• Review Questions = 731
• Exercises = 732
• Problems = 734
• Projects = 734
• CHAPTER 15 EXCEPTION HANDLING = 737
• 15-1 HANDLING ERRORS = 738
• Traditional Error Handling = 738
• Using The Exception Handling Mechanism = 739
• Multiple Errors = 743
• Generic Handler = 745
• 15-2 EXCEPTION HANDLING CLASSES = 745
• Class Hierarchy = 746
• 15-3 EXCEPTION SPECIFICATION = 749
• Throw Specified Exceptions = 750
• Throw No Exceptions = 750
• Throw Any Exception = 751
• The unexpected Exception = 751
• 15-4 EXCEPTIONS IN CLASSES = 751
• Exceptions in Constructors = 752
• Exceptions in Destructors = 752
• 15-5 STANDARD EXCEPTIONS = 753
• Logic Errors = 754
• Memory Allocation Failure = 755
• I／O(File) Exceptions = 756
• Adding New Classes to the Standard Exception Class = 757
• 15-6 SOFTWARE ENGINEERING AND PROGRAMMING STYLE = 761
• Correcting Program Failures = 761
• Manual Debugging = 762
• Test Drivers = 765
• Correcting Invalid Output = 765
• 15-7 TIPS AND COMMON PROGRAMMING ERRORS = 766
• 15-8 KEY TERMS = 767
• 15-9 SUMMARY = 767
• 15-10 PRACTICE SETS = 768
• Review Questions = 768
• Exercises = 768
• Problems = 769
• Projects = 769
• CHAPTER 16 ADVANCED I／O CONCEPTS = 770
• 16-1 INPUT／OUTPUT CLASSES = 771
• 16-2 FILE STATES = 772
• Opening Files in Read State = 773
• Opening Files in Write Sate = 773
• I／O System Flags = 774
• Testing If a File Is Open = 775
• Open and Overloaded Constructors = 775
• 16-3 TEXT AND BINARY FILES = 776
• 16-4 STANDARD LIBRARY FUNCTIONS FOR FILES = 777
• Block Input／Output Functions = 777
• Positioning Functions = 782
• Block I／O Example：Append Files = 785
• 16-5 CONVERTING FILE TYPES = 787
• Creating a Binary File from a Text File = 787
• Creating a Text File from a Binary File = 790
• 16-6 STRING STREAMS = 794
• Writing to a String = 795
• Reading from a String = 796
• 16-7 FILE PROGRAM EXAMPLES = 796
• Random File Accessing = 797
• Merge Files = 800
• 16-8 SOFTWARE ENGINEERING AND PROGRAMMING STYLE = 804
• Update Files = 804
• Sequential File Update = 804
• The Update Program Design = 805
• Update Errors = 807
• Update Structure Chart = 807
• Update Logic = 807
• Summary = 809
• 16-9 TIPS AND COMMON PROGRAMMING ERRORS = 810
• 16-10 KEY TERMS = 811
• 16-11 SUMMARY = 811
• 16-12 PRACTICE SETS = 812
• Review Questions = 812
• Exercises = 812
• Problems = 815
• Projects = 816
• CHAPTER 17 LINKED LISTS = 818
• 17-1 LINKED LIST STRUCTURE = 819
• Nodes = 819
• Declarations for a Linked List = 820
• Link List Order = 820
• Pointers to Linked Lists = 821
• 17-2 BASIC LINKED LIST FUNCTIONS = 821
• Add a Node = 821
• Delete a Node = 826
• Search Linked List = 828
• Traversing Linked Lists = 830
• 17-3 LINKED LIST DESIGN = 832
• The Node Class = 832
• The List Class = 833
• The Class Interator = 839
• 17-4 PROGRAMMING EXAMPLE - LINKED LIST AVERAGE = 842
• Build Linked List = 843
• Print List = 844
• Print List Average = 845
• 17-5 SOFTWARE ENGINEERING AND PROGRAMMING STYLE = 848
• Quality Defined = 848
• Quality Factors = 849
• The Quality Circle = 851
• Conclusion = 852
• 17-6 TIPS AND COMMON PROGRAMMING ERRORS = 852
• 17-7 KEY TERMS = 853
• 17-8 SUMMARY = 854
• 17-9 PRACTICE SETS = 854
• Review Questions = 854
• Exercises = 855
• Problems = 856
• Projects = 857
• APPENDIX A ASCII TABLES = 860
• APPENDIX B RESERVED WORDS = 865
• APPENDIX C FLOWCHARTING = 866
• C-1 AUXILIARY SYMBOLS = 867
• Flow lines = 867
• Connectors = 867
• C-2 MAIN SYMBOLS = 868
• Sequence = 868
• Selection Statements = 871
• Looping Statements = 873
• APPENDIX D NUMBERING SYSTEMS = 878
• D-1 COMPUTER NUMBERING SYSTEMS = 879
• Decimal Numbers = 879
• Binary Numbers = 879
• Octal Numbers = 880
• Hexadecimal Numbers = 880
• D-2 INTEGER TRANSFORMATIONS = 882
• Binary to Decimal = 882
• Decimal to Binary = 882
• Binary to Octal or Hexadecimal = 882
• D-3 STORING INTEGERS = 883
• Unsigned Integers = 883
• Signed Integers = 885
• D-4 EXCESS SYSTEM = 889
• Representation = 889
• Interpretation = 889
• D-5 FLOATING-POINT REPRESENTATION = 889
• Converting to Binary = 890
• Normalization = 891
• Sign, Exponent, and Mantissa = 891
• IEEE Standards = 891
• APPENDIX E STANDARD LIBRARIES = 894
• E-1 HEADER FILES = 895
• E-2 CLIMITS = 895
• E-3 CFLOAT = 896
• APPENDIX F FUNCTION PROTOTYPES = 899
• F-1 FUNCTION INDEX = 899
• F-2 CHARACTER LIBRARY = 901
• F-3 CMATH LIBRARY = 901
• F-4 TRADITIONAL C I／O LIBRARY = 902
• General I／O = 902
• Formatted I／O = 902
• Character I／O = 902
• File I／O = 902
• cstring I／O = 903
• System File Control = 903
• F-5 C++ I／O LIBRARY = 903
• General = 903
• File Status = 903
• Output Formatting = 903
• Block I／O = 903
• Character I／O = 904
• Line I／O = 904
• Miscellaneous I／O = 904
• Manipulators = 904
• F-6 STANDARD LIBRARY = 905
• cmath Functions = 905
• Memory Functions = 905
• Program Control = 905
• System Communication = 905
• Conversion Functions = 905
• F-7 CSTRING LIBRARY = 905
• Copying Data = 905
• Comparing Data = 906
• cstring Lengths = 906
• F-8 TIME = 906
• APPENDIX G PREPROCESSOR DIRECTIVES = 907
• G-1 FILE INCLUSION = 908
• G-2 MACRO DEFINITION = 909
• Simple Commands = 909
• Parameterized Macro = 911
• Nested Macros = 913
• Macro Statement Continuation = 914
• String Command(#) = 915
• Merge Command(##) = 915
• Undefine Command = 915
• G-3 CONDITIONAL COMPILATION = 916
• if...else Commands = 916
• Conditional Multiway Selection = 917
• Excluding Code = 918
• If Defined(ifdef／ifndef) = 918
• G-4 PREVENTING DUPLICATE LIBRARY INCLUDES = 919
• APPENDIX H BITWISE OPERATORS = 921
• H-1 LOGICAL BITWISE OPERATORS = 922
• Bitwise and Operator = 922
• Forcing to Zero = 922
• Bitwise Inclusive or Operator = 923
• Forcing to One = 923
• Bitwise Exclusive or Operator = 923
• Forcing a Change = 923
• One's Complement Operator = 924
• H-2 SHIFT OPERATORS = 924
• Bitwise Shift Left Operator = 924
• Multiplying by Two = 925
• Bitwise Shift Right Operator = 925
• Dividing by Two = 926
• APPENDIX I MANIPULATORS = 927
• I-1 INTRODUCTION = 928
• I-2 MANIPULATORS WITH NO ARGUMENTS = 929
• I-3 MANIPULATORS WITH ONE ARGUMENT = 930
• APPENDIX J CLASSES RELATED TO INPUT AND OUTPUT = 932
• J-1 IOS CLASS = 933
• Error-State Flags = 933
• IOS Flags = 933
• Seek Flags = 933
• Format Flags = 934
• Format Parameters = 934
• J-2 CLASSES INHERITED FROM IOS = 935
• Input Stream = 935
• Output Stream = 935
• J-3 CLASSES INHERITED FROM ISTREAM AND OSTREAM = 935
• Input File Stream = 936
• Input／Output Stream = 936
• Output File Stream = 936
• I／O String Streams = 936
• J-4 CLASSED INHERITED FROM IOSTREAM = 936
• File Stream = 936
• String Stream = 936
• APPENDIX K C LANGUAGE I／O = 937
• K-1 STANDARD LIBRARY INPUT／OUTPUT FUNCTIONS = 938
• Files and Streams in C = 938
• File Table = 938
• Standard C Files = 938
• User Files = 939
• K-2 FILE OPEN AND CLOSE = 940
• File Open(fopen) = 940
• File Mode = 940
• File Close(fclose) = 941
• K-3 FORMATTED INPUT／OUTPUT FUNCTIONS = 941
• Input Formatting = 941
• Output Formatting = 942
• Format String = 942
• K-4 CHARACTER INPUT／OUTPUT FUNCTIONS = 948
• getchar = 948
• putchar = 948
• getc AND fgetc = 948
• putc AND fputc = 948
• K-5 STRING INPUT／OUTPUT FUNCTIONS = 949
• Read String(gets／fgets) = 949
• Write String(puts／fputs) = 950
• K-6 BLOCK INPUT／OUTPUT FUNCTIONS = 951
• File Read(fread) = 951
• File Write(fwrite) = 951
• K-7 FILE STATUS FUNCTIONS = 952
• Test EOF(feof) = 952
• Test Error(ferror) = 952
• Clear Error(clearerr) = 952
• K-8 POSITIONING FUNCTIONS = 952
• Current Location(ftell) = 953
• Set Position(fseek) = 953
• K-9 SUMMARY OF C I／O FUNCTIONS = 953
• APPENDIX L COMMAND-LINE ARGUMENTS = 955
• APPENDIX M POINTERS TO FUNCTIONS = 959
• APPENDIX N NAMESPACE = 963
• N-1 BACKGROUND = 964
• N-2 USING NAMES FROM NAMESPACES = 966
• Full Names = 966
• Using Directive = 966
• Using Declaration = 967
• Difference between Directive and Declaration = 968
• N-3 DECLARING NAMESPACES = 969
• Declaration = 969
• Extension = 969
• Nesting = 969
• N-4 NAMESPACE TYPES = 971
• Named Namespace = 971
• Global Namespace = 972
• Unnamed Namespace = 972
• APPENDIX O STANDARD TEMPLATE LIBRARY = 973
• O-1 CONTAINERS = 974
• Sequence Containers = 974
• List = 977
• Associative Containers = 979
• O-2 CONTAINER ADAPTORS = 986
• Stack = 986
• Queue = 987
• Priority Queue = 987
• O-3 ITERATORS = 988
• Input Iterators = 989
• Output Iterators = 989
• Forward Iterators = 990
• Bidirectional Iterators = 990
• Random Access Iterators = 991
• Hierarchical Relation = 991
• Opeators Supported by Interators = 992
• O-4 GENERIC ALGORITHMS = 992
• O-5 FUNCTION OBJECTS = 992
• GLOSSARY = 994
• INDEX = 1009