book

C How to Program, Fifth Edition

Name: C How to Program, Fifth Edition
ISBN: 9780136085881

by P. J. Deitel - Deitel & Associates, Inc., H. M. Deitel - Deitel & Associates, Inc.

August 2006

Intermediate to advanced

1112 pages

34h 18m

English

Pearson

Read now

Unlock full access

Copyright
Dedication
Deitel® Series Page
How to Program SeriesSimply SeriesAlso Available
Preface
Before You BeginInstalling the Microsoft Visual C++ 2005 Express Edition SoftwareC How to Program, 5/e Code ExamplesAdditional Software DownloadsAdditional C and C++ Compilers and IDEsFeatures of C How to Program, Fifth EditionInterior DesignSyntax ShadingCode HighlightingGame Programming with the Allegro C Game Programming LibrarySorting: A Deeper LookIntroduction to C99Updated C++ TreatmentTeaching ApproachLive-Code ApproachWorld Wide Web AccessObjectivesQuotationsOutlineSectionsThousands of Lines of Syntax-Highlighted Code in Hundreds of Example Programs (with Outputs)Illustrations/FiguresProgramming TipsSummary BulletsTerminologySelf-Review Exercises and AnswersExercisesThousands of Index Entries“Double Indexing” of C Live-Code ExamplesSoftware Included with C How to Program, 5/eDIVE-INTO® Series Tutorials for Popular C and C++ EnvironmentsAdditional C and C++ Compilers and IDEsTeaching Resources for C How to Program, 5/eDeitel® Buzz Online Free E-mail NewsletterWhat’s New at DeitelFree Content InitiativeResource Centers and the Deitel Internet Business InitiativeAcknowledgmentsC How to Program, 4/e Post-Publication ReviewersC How to Program, 5/e ReviewersAllegro ReviewersC99 ReviewersAbout the AuthorsAbout Deitel & Associates, Inc.
1. Introduction to Computers, the Internet and the Web
1.1. Introduction1.2. What Is a Computer?1.3. Computer Organization1.4. Early Operating Systems1.5. Personal, Distributed and Client/Server Computing1.6. Machine Languages, Assembly Languages and High-Level Languages1.7. Fortran, COBOL, Pascal and Ada1.8. History of C1.9. C Standard Library1.10. C++1.11. Java1.12. BASIC, Visual Basic, Visual C++, Visual C# and .NET1.13. Key Software Trend: Object Technology1.14. Typical C Program Development EnvironmentPhase 1: Creating a ProgramPhases 2 and 3: Preprocessing and Compiling a C ProgramPhase 4: LinkingPhase 5: LoadingPhase 6: ExecutionProblems That May Occur at Execution Time1.15. Hardware Trends1.16. History of the Internet1.17. History of the World Wide Web1.18. Notes About C and This Book1.19. Web ResourcesC Standard and Working GroupFree C/C++ Compilers and Development ToolsSummarySection 1.1 IntroductionSection 1.2 What Is a Computer?Section 1.3 Computer OrganizationSection 1.4 Early Operating SystemsSection 1.5 Personal, Distributed and Client/Server ComputingSection 1.6 Machine Languages, Assembly Languages and High-Level LanguagesSection 1.7 Fortran, COBOL, Pascal and AdaSection 1.8 History of CSection 1.9 C Standard LibrarySection 1.10 C++Section 1.11 JavaSection 1.12 BASIC, Visual Basic, Visual C++, Visual C# and .NETSection 1.13 Key Software Trend: Object TechnologySection 1.14 Typical C Program Development EnvironmentSection 1.15 Hardware TrendsSection 1.16 History of the InternetSection 1.17 History of the World Wide WebTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
2. Introduction to C Programming
2.1. Introduction2.2. A Simple C Program: Printing a Line of Text2.3. Another Simple C Program: Adding Two Integers2.4. Memory Concepts2.5. Arithmetic in CArithmetic Expressions in Straight-Line FormParentheses for Grouping SubexpressionsRules of Operator PrecedenceSample Algebraic and C ExpressionsEvaluation of a Second-Degree Polynomial2.6. Decision Making: Equality and Relational OperatorsSummarySection 2.1 IntroductionSection 2.2 A Simple C Program: Printing a Line of TextSection 2.3 Another Simple C Program: Adding Two IntegersSection 2.4 Memory ConceptsSection 2.5 Arithmetic in CSection 2.6 Decision Making: Equality and Relational OperatorsTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
3. Structured Program Development in C
3.1. Introduction3.2. Algorithms3.3. Pseudocode3.4. Control Structures3.5. The if Selection Statement3.6. The if...else Selection Statement3.7. The while Repetition Statement3.8. Formulating Algorithms Case Study 1: Counter-Controlled Repetition3.9. Formulating Algorithms with Top-Down, Stepwise Refinement Case Study 2: Sentinel-Controlled Repetition3.10. Formulating Algorithms with Top-Down, Stepwise Refinement Case Study 3: Nested Control Structures3.11. Assignment Operators3.12. Increment and Decrement OperatorsSummarySection 3.1 IntroductionSection 3.2 AlgorithmsSection 3.3 PseudocodeSection 3.4 Control StructuresSection 3.5 The if Selection StatementSection 3.6 The if...else Selection StatementSection 3.7 The while Repetition StatementSection 3.8 Formulating Algorithms Case Study 1: Counter-Controlled RepetitionSection 3.9 Formulating Algorithms with Top-Down, Stepwise Refinement Case Study 2: Sentinel-Controlled RepetitionSection 3.11 Assignment OperatorsSection 3.12 Increment and Decrement OperatorsTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesFor Exercises 3.17 to 3.21, perform each of these steps
4. C Program Control
4.1. Introduction4.2. Repetition Essentials4.3. Counter-Controlled Repetition4.4. for Repetition Statement4.5. for Statement: Notes and Observations4.6. Examples Using the for Statement4.7. switch Multiple-Selection Statement4.8. do...while Repetition Statement4.9. break and continue Statements4.10. Logical Operators4.11. Confusing Equality (==) and Assignment (=) Operators4.12. Structured Programming SummarySummarySection 4.2 Repetition EssentialsSection 4.3 Counter-Controlled RepetitionSection 4.4 for Repetition StatementSection 4.5 for Statement: Notes and ObservationsSection 4.6 Examples Using the for StatementSection 4.7 switch Multiple-Selection StatementSection 4.8 do...while Repetition StatementSection 4.9 break and continue StatementsSection 4.10 Logical OperatorsSection 4.11 Confusing Equality (==) and Assignment (=) OperatorsTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
5. C Functions
5.1. Introduction5.2. Program Modules in C5.3. Math Library Functions5.4. Functions5.5. Function Definitions5.6. Function Prototypes5.7. Function Call Stack and Activation Records5.8. Headers5.9. Calling Functions: Call-by-Value and Call-by-Reference5.10. Random Number Generation5.11. Example: A Game of Chance5.12. Storage Classes5.13. Scope Rules5.14. Recursion5.15. Example Using Recursion: Fibonacci Series5.16. Recursion vs. IterationSummarySection 5.1 IntroductionSection 5.2 Program Modules in CSection 5.3 Math Library FunctionsSection 5.4 FunctionsSection 5.5 Function DefinitionsSection 5.6 Function PrototypesSection 5.7 Function Call Stack and Activation RecordsSection 5.8 HeadersSection 5.9 Calling Functions: Call-by-Value and Call-by-ReferenceSection 5.10 Random Number GenerationSection 5.11 Example: A Game of ChanceSection 5.12 Storage ClassesSection 5.13 Scope RulesSection 5.14 RecursionSection 5.16 Recursion vs. IterationTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
6. C Arrays
6.1. Introduction6.2. Arrays6.3. Defining Arrays6.4. Array ExamplesDefining an Array and Using a Loop to Initialize the Array’s ElementsInitializing an Array in a Definition with an Initializer ListSpecifying an Array’s Size with a Symbolic Constant and Initializing Array Elements with CalculationsSumming the Elements of an ArrayUsing Arrays to Summarize Survey ResultsGraphing Array Element Values with HistogramsRolling a Die 6000 Times and Summarizing the Results in an ArrayUsing Character Arrays to Store and Manipulate StringsStatic Local Arrays and Automatic Local Arrays6.5. Passing Arrays to Functions6.6. Sorting Arrays6.7. Case Study: Computing Mean, Median and Mode Using Arrays6.8. Searching ArraysSearching an Array with Linear SearchSearching an Array with Binary Search6.9. Multiple-Subscripted ArraysSummarySection 6.1 IntroductionSection 6.2 ArraysSection 6.3 Defining ArraysSection 6.4 Array ExamplesSection 6.5 Passing Arrays to FunctionsSection 6.6 Sorting ArraysSection 6.7 Case Study: Computing Mean, Median and Mode Using ArraysSection 6.8 Searching ArraysSection 6.9 Multiple-Subscripted ArraysTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesRecursion ExercisesSpecial Section: Sudoku
7. C Pointers
7.1. Introduction7.2. Pointer Variable Definitions and Initialization7.3. Pointer Operators7.4. Passing Arguments to Functions by Reference7.5. Using the const Qualifier with PointersConverting a String to Uppercase Using a Non-Constant Pointer to Non-Constant DataPrinting a String One Character at a Time Using a Non-Constant Pointer to Constant DataAttempting to Modify a Constant Pointer to Non-Constant DataAttempting to Modify a Constant Pointer to Constant Data7.6. Bubble Sort Using Call-by-Reference7.7. sizeof Operator7.8. Pointer Expressions and Pointer Arithmetic7.9. Relationship between Pointers and Arrays7.10. Arrays of Pointers7.11. Case Study: Card Shuffling and Dealing Simulation7.12. Pointers to FunctionsUsing Function Pointers to Create a Menu-Driven SystemSummarySection 7.2 Pointer Variable Definitions and InitializationSection 7.3 Pointer OperatorsSection 7.4 Passing Arguments to Functions by ReferenceSection 7.5 Using the const Qualifier with PointersSection 7.7 sizeof OperatorSection 7.8 Pointer Expressions and Pointer ArithmeticSection 7.9 Relationship between Pointers and ArraysSection 7.10 Arrays of PointersSection 7.12 Pointers to FunctionsTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesSpecial Section: Building Your Own Computer

8. C Characters and Strings
8.1. Introduction8.2. Fundamentals of Strings and Characters8.3. Character-Handling Library8.4. String-Conversion Functions8.5. Standard Input/Output Library Functions8.6. String-Manipulation Functions of the String-Handling Library8.7. Comparison Functions of the String-Handling Library8.8. Search Functions of the String-Handling Library8.9. Memory Functions of the String-Handling Library8.10. Other Functions of the String-Handling LibrarySummarySection 8.2 Fundamentals of Strings and CharactersSection 8.3 Character-Handling LibrarySection 8.4 String-Conversion FunctionsSection 8.5 Standard Input/Output Library FunctionsSection 8.6 String-Manipulation Functions of the String-Handling LibrarySection 8.7 Comparison Functions of the String-Handling LibrarySection 8.8 Search Functions of the String-Handling LibrarySection 8.9 Memory Functions of the String-Handling LibrarySection 8.10 Other Functions of the String-Handling LibraryTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesSpecial Section: Advanced String-Manipulation ExercisesA Challenging String-Manipulation Project
9. C Formatted Input/Output
9.1. Introduction9.2. Streams9.3. Formatting Output with printf9.4. Printing Integers9.5. Printing Floating-Point Numbers9.6. Printing Strings and Characters9.7. Other Conversion Specifiers9.8. Printing with Field Widths and Precision9.9. Using Flags in the printf Format Control String9.10. Printing Literals and Escape Sequences9.11. Reading Formatted Input with scanfSummarySection 9.2 StreamsSection 9.3 Formatting Output with printfSection 9.4 Printing IntegersSection 9.5 Printing Floating-Point NumbersSection 9.6 Printing Strings and CharactersSection 9.7 Other Conversion SpecifiersSection 9.8 Printing with Field Widths and PrecisionSection 9.9 Using Flags in the printf Format Control StringSection 9.10 Printing Literals and Escape SequencesSection 9.11 Formatting Input with scanfTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
10. C Structures, Unions, Bit Manipulations and Enumerations
10.1. Introduction10.2. Structure Definitions10.3. Initializing Structures10.4. Accessing Members of Structures10.5. Using Structures with Functions10.6. typedef10.7. Example: High-Performance Card Shuffling and Dealing Simulation10.8. Unions10.9. Bitwise OperatorsDisplaying an Unsigned Integer in BitsMaking Function displayBits More Scalable and PortableUsing the Bitwise AND, Inclusive OR, Exclusive OR and Complement OperatorsUsing the Bitwise Left- and Right-Shift OperatorsBitwise Assignment Operators10.10. Bit Fields10.11. Enumeration ConstantsSummarySection 10.1 IntroductionSection 10.2 Structure DefinitionsSection 10.3 Initializing StructuresSection 10.4 Accessing Members of StructuresSection 10.5 Using Structures with FunctionsSection 10.6 typedefSection 10.8 UnionsSection 10.9 Bitwise OperatorsSection 10.10 Bit FieldsSection 10.11 Enumeration ConstantsTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
11. C File Processing
11.1. Introduction11.2. Data Hierarchy11.3. Files and Streams11.4. Creating a Sequential-Access File11.5. Reading Data from a Sequential-Access File11.6. Random-Access Files11.7. Creating a Random-Access File11.8. Writing Data Randomly to a Random-Access File11.9. Reading Data from a Random-Access File11.10. Case Study: Transaction-Processing ProgramSummarySection 11.1 IntroductionSection 11.2 Data HierarchySection 11.3 Files and StreamsSection 11.4 Creating a Sequential-Access FileSection 11.5 Reading Data from a Sequential-Access FileSection 11.6 Random-Access FilesSection 11.7 Creating a Random-Access FileSection 11.8 Writing Data Randomly to a Random-Access FileSection 11.9 Reading Data from a Random-Access FileTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
12. C Data Structures
12.1. Introduction12.2. Self-Referential Structures12.3. Dynamic Memory Allocation12.4. Linked ListsFunction insertFunction deleteFunction printList12.5. StacksFunction pushFunction popApplications of Stacks12.6. QueuesFunction enqueueFunction dequeue12.7. TreesSummarySection 12.1 IntroductionSection 12.2 Self-Referential StructuresSection 12.3 Dynamic Memory AllocationSection 12.4 Linked ListsSection 12.5 StacksSection 12.6 QueuesSection 12.7 TreesTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesSpecial Section: Building Your Own CompilerFirst PassSecond PassA Complete ExampleStep-by-Step View of the Compilation Process
13. C Preprocessor
13.1. Introduction13.2. #include Preprocessor Directive13.3. #define Preprocessor Directive: Symbolic Constants13.4. #define Preprocessor Directive: Macros13.5. Conditional Compilation13.6. #error and #pragma Preprocessor Directives13.7. # and ## Operators13.8. Line Numbers13.9. Predefined Symbolic Constants13.10. AssertionsSummarySection 13.1 IntroductionSection 13.2 #include Preprocessor DirectiveSection 13.3 #define Preprocessor Directive: Symbolic ConstantsSection 13.4 #define Preprocessor Directive: MacrosSection 13.5 Conditional CompilationSection 13.6 #error and #pragma Preprocessor DirectivesSection 13.7 # and ## OperatorsSection 13.8 Line NumbersSection 13.9 Predefined Symbolic ConstantsSection 13.10 AssertionsTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
14. Other C Topics
14.1. Introduction14.2. Redirecting Input/Output on Linux/UNIX and Windows Systems14.3. Variable-Length Argument Lists14.4. Using Command-Line Arguments14.5. Notes on Compiling Multiple-Source-File Programs14.6. Program Termination with exit and atexit14.7. volatile Type Qualifier14.8. Suffixes for Integer and Floating-Point Constants14.9. More on Files14.10. Signal Handling14.11. Dynamic Memory Allocation: Functions calloc and realloc14.12. Unconditional Branching with gotoSummarySection 14.2 Redirecting Input/Output on Linux/UNIX and Windows SystemsSection 14.3 Variable-Length Argument ListsSection 14.4 Using Command-Line ArgumentsSection 14.5 Notes on Compiling Multiple-Source-File ProgramsSection 14.6 Program Termination with exit and atexitSection 14.7 volatile Type QualifierSection 14.8 Suffixes for Integer and Floating-Point ConstantsSection 14.9 More on FilesSection 14.10 Signal HandlingSection 14.11 Dynamic Memory Allocation: Functions calloc and reallocSection 14.12 Unconditional Branching with gotoTerminologySelf-Review ExerciseAnswers to Self-Review ExerciseExercises
15. Game Programming with the Allegro C Library
15.1. Introduction15.2. Installing Allegro15.3. A Simple Allegro Program15.4. Simple Graphics: Importing Bitmaps and Blitting15.5. Animation with Double BufferingDouble Buffering for Smooth Animation15.6. Importing and Playing Sounds15.7. Keyboard Input15.8. Fonts and Displaying Text15.9. Implementing the Game of Pong15.10. Timers in Allegro15.11. The Grabber and Allegro Datafiles15.12. Other Allegro Capabilities15.13. Allegro Internet and Web ResourcesBooksGroupsForumsBlog postingsSummarySection 15.3 A Simple Allegro ProgramSection 15.4 Simple Graphics: Importing Bitmaps and BlittingSection 15.5 Animation with Double BufferingSection 15.6 Importing and Playing SoundsSection 15.7 Keyboard InputSection 15.8 Fonts and Displaying TextSection 15.10 Timers in AllegroSection 15.11 The Grabber and Allegro DatafilesTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
16. Sorting: A Deeper Look
16.1. Introduction16.2. Big O Notation16.3. Selection SortEfficiency of Selection Sort16.4. Insertion SortEfficiency of Insertion Sort16.5. Merge SortEfficiency of Merge SortSummarySection 16.1 IntroductionSection 16.2 Big O NotationSection 16.3 Selection SortSection 16.4 Insertion SortSection 16.5 Merge SortTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
17. Introduction to C99
17.1. Introduction17.2. Support for C9917.3. New C99 Headers17.4. // Comments17.5. Mixing Declarations and Executable Code17.6. Declaring a Variable in a for Statement Header17.7. Designated Initializers and Compound Literals17.8. Type bool17.9. Implicit int in Function Declarations17.10. Complex Numbers17.11. Variable-Length Arrays17.12. Other C99 FeaturesExtended IdentifiersThe restrict KeywordReliable Integer DivisionFlexible Array Memberslong long int TypeType Generic MathInline FunctionsReturn Without ExpressionThe snprinf Function: Helping Avoid Hacker Attacks17.13. Internet and Web ResourcesSummarySection 17.1 IntroductionSection 17.2 Support for C99Section 17.4 // CommentsSection 17.5 Mixing Declarations and Executable CodeSection 17.6 Declaring a Variable in a for Statement HeaderSection 17.7 Designated Initializers and Compound LiteralsSection 17.8 Type boolSection 17.9 Implicit int Function DeclarationsSection 17.10 Complex NumbersSection 17.11 Variable-Length ArraysSection 17.12 Other C99 FeaturesTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
18. C++ as a Better C; Introducing Object Technology
18.1. Introduction18.2. C++18.3. A Simple Program: Adding Two Integers18.4. C++ Standard Library18.5. Header Files18.6. Inline Functions18.7. References and Reference ParametersReference ParametersPassing Arguments by Value and by ReferenceReferences as Aliases within a FunctionReturning a Reference from a FunctionError Messages for Uninitialized References18.8. Empty Parameter Lists18.9. Default Arguments18.10. Unary Scope Resolution Operator18.11. Function OverloadingOverloaded square FunctionsHow the Compiler Differentiates Overloaded FunctionsOverloaded Operators18.12. Function Templates18.13. Introduction to Object Technology and the UMLBasic Object Technology ConceptsClasses, Data Members and Member FunctionsIntroduction to Object-Oriented Analysis and Design (OOAD)History of the UMLWhat Is the UML?Internet and Web UML ResourcesRecommended Readings18.14. Wrap-UpSummarySection 18.2 C++Section 18.3 A Simple Program: Adding Two IntegersSection 18.4 C++ Standard LibrarySection 18.5 Header FilesSection 18.6 Inline FunctionsSection 18.7 References and Reference ParametersSection 18.8 Empty Parameter ListsSection 18.9 Default ArgumentsSection 18.10 Unary Scope Resolution OperatorSection 18.11 Function OverloadingSection 18.12 Function TemplatesSection 18.13 Introduction to Object Technology and the UMLTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
19. Introduction to Classes and Objects
19.1. Introduction19.2. Classes, Objects, Member Functions and Data Members19.3. Overview of the Chapter Examples19.4. Defining a Class with a Member FunctionClass GradeBookTesting Class GradeBookUML Class Diagram for Class GradeBook19.5. Defining a Member Function with a ParameterDefining and Testing Class GradeBookMore on Arguments and ParametersUpdated UML Class Diagram for Class GradeBook19.6. Data Members, set Functions and get FunctionsGradeBook Class with a Data Member, a set Function and a get FunctionAccess Specifiers public and privateMember Functions setCourseName and getCourseNameMember Function displayMessageTesting Class GradeBookSoftware Engineering with set and get FunctionsGradeBook’s UML Class Diagram with a Data Member and set and get Functions19.7. Initializing Objects with ConstructorsDefining a ConstructorTesting Class GradeBookTwo Ways to Provide a Default Constructor for a ClassAdding the Constructor to Class GradeBook’s UML Class Diagram19.8. Placing a Class in a Separate File for ReusabilityHeader FilesIncluding a Header File That Contains a User-Defined ClassHow Header Files Are LocatedAdditional Software Engineering Issues19.9. Separating Interface from ImplementationInterface of a ClassSeparating the Interface from the ImplementationGradeBook.h: Defining a Class’s Interface with Function PrototypesGradeBook.cpp: Defining Member Functions in a Separate Source-Code FileTesting Class GradeBookThe Compilation and Linking Process19.10. Validating Data with set FunctionsGradeBook Class DefinitionValidating the Course Name with GradeBook Member Function setCourseNameTesting Class GradeBookAdditional Notes on set Functions19.11. Wrap-UpSummarySection 19.2 Classes, Objects, Member Functions and Data MembersSection 19.4 Defining a Class with a Member FunctionSection 19.5 Defining a Member Function with a ParameterSection 19.6 Data Members, set Functions and get FunctionsSection 19.7 Initializing Objects with ConstructorsSection 19.8 Placing a Class in a Separate File for ReusabilitySection 19.9 Separating Interface from ImplementationSection 19.10 Validating Data with set FunctionsTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
20. Classes: A Deeper Look, Part 1
20.1. Introduction20.2. Time Class Case StudyTime Class DefinitionTime Class Member FunctionsDefining Member Functions Outside the Class Definition; Class ScopeMember Functions vs. Global FunctionsUsing Class TimeLooking Ahead to Composition and InheritanceObject Size20.3. Class Scope and Accessing Class Members20.4. Separating Interface from Implementation20.5. Access Functions and Utility Functions20.6. Time Class Case Study: Constructors with Default ArgumentsNotes Regarding Class Time’s set and get Functions and Constructor20.7. Destructors20.8. When Constructors and Destructors Are Called20.9. Time Class Case Study: A Subtle Trap—Returning a Reference to a private Data Member20.10. Default Memberwise Assignment20.11. Software Reusability20.12. Wrap-UpSummarySection 20.2 Time Class Case StudySection 20.3 Class Scope and Accessing Class MembersSection 20.4 Separating Interface from ImplementationSection 20.5 Access Functions and Utility FunctionsSection 20.6 Time Class Case Study: Constructors with Default ArgumentsSection 20.7 DestructorsSection 20.8 When Constructors and Destructors Are CalledSection 20.9 Time Class Case Study: A Subtle Trap—Returning a Reference to a private Data MemberSection 20.8 When Constructors and Destructors Are CalledSection 20.11 Software ReusabilityTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
21. Classes: A Deeper Look, Part 2
21.1. Introduction21.2. const (Constant) Objects and const Member FunctionsDefining and Using const Member FunctionsInitializing a const Data Member with a Member InitializerErroneously Attempting to Initialize a const Data Member with an Assignment21.3. Composition: Objects as Members of Classes21.4. friend Functions and friend ClassesModifying a Class’s private Data with a Friend FunctionErroneously Attempting to Modify a private Member with a Non-friend Function21.5. Using the this PointerImplicitly and Explicitly Using the this Pointer to Access an Object’s Data MembersUsing the this Pointer to Enable Cascaded Function Calls21.6. Dynamic Memory Management with Operators new and delete21.7. static Class Members21.8. Data Abstraction and Information Hiding21.8.1. Example: Array Abstract Data Type21.8.2. Example: String Abstract Data Type21.8.3. Example: Queue Abstract Data Type21.9. Container Classes and Iterators21.10. Proxy Classes21.11. Wrap-UpSummarySection 21.2 const (Constant) Objects and const Member FunctionsSection 21.3 Composition: Objects as Members of ClassesSection 21.4 friend Functions and friend ClassesSection 21.5 Using the this PointerSection 21.6 Dynamic Memory Management with Operators new and deleteSection 21.7 static Class MembersSection 21.8 Data Abstraction and Information HidingSection 21.9 Container Classes and IteratorsSection 21.10 Proxy ClassesTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
22. Operator Overloading
22.1. Introduction22.2. Fundamentals of Operator Overloading22.3. Restrictions on Operator OverloadingPrecedence, Associativity and Number of OperandsCreating New OperatorsOperators for Fundamental TypesRelated Operators22.4. Operator Functions as Class Members vs. Global FunctionsOperators That Must Be Overloaded as Member FunctionsOperators as Member Functions and Global FunctionsWhy Overloaded Stream Insertion and Stream Extraction Operators Are Overloaded as Global FunctionsCommutative Operators22.5. Overloading Stream Insertion and Stream Extraction Operators22.6. Overloading Unary Operators22.7. Overloading Binary Operators22.8. Case Study: Array ClassCreating Arrays, Outputting Their Size and Displaying Their ContentsUsing the Overloaded Stream Insertion Operator to Fill an ArrayUsing the Overloaded Inequality OperatorInitializing a New Array with a Copy of an Existing Array’s ContentsUsing the Overloaded Assignment OperatorUsing the Overloaded Equality OperatorUsing the Overloaded Subscript OperatorArray Class DefinitionOverloading the Stream Insertion and Stream Extraction Operators as friendsArray Default ConstructorArray Copy ConstructorArray DestructorgetSize Member FunctionOverloaded Assignment OperatorOverloaded Equality and Inequality OperatorsOverloaded Subscript Operators22.9. Converting between Types22.10. Overloading ++ and −−Overloading the Prefix Increment OperatorOverloading the Postfix Increment Operator22.11. explicit ConstructorsAccidentally Using a Single-Argument Constructor as a Conversion ConstructorPreventing Accidental Use of a Single-Argument Constructor as a Conversion Constructor22.12. Wrap-UpSummarySection 22.2 Fundamentals of Operator OverloadingSection 22.3 Restrictions on Operator OverloadingSection 22.4 Operator Functions as Class Members vs. Global FunctionsSection 22.5 Overloading Stream Insertion and Stream Extraction OperatorsSection 22.6 Overloading Unary OperatorsSection 22.7 Overloading Binary OperatorsSection 22.8 Case Study: Array ClassSection 22.9 Converting between TypesSection 22.10 Overloading ++ and −−Section 22.11 explicit ConstructorsTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
23. Object-Oriented Programming: Inheritance
23.1. Introduction23.2. Base Classes and Derived Classes23.3. protected Members23.4. Relationship between Base Classes and Derived Classes23.4.1. Creating and Using a CommissionEmployee Class23.4.2. Creating a BasePlusCommissionEmployee Class Without Using InheritanceDefining Class BasePlusCommissionEmployeeTesting Class BasePlusCommissionEmployeeExploring the Similarities Between Class BasePlusCommissionEmployee and Class CommissionEmployee23.4.3. Creating a CommissionEmployee–BasePlusCommissionEmployee Inheritance HierarchyIncluding the Base Class Header File in the Derived Class Header File with #includeLinking Process in an Inheritance Hierarchy23.4.4. CommissionEmployee–BasePlusCommissionEmployee Inheritance Hierarchy Using protected DataDefining Base Class CommissionEmployee with protected DataModifying Derived Class BasePlusCommissionEmployeeTesting the Modified BasePlusCommissionEmployee ClassNotes on Using protected Data23.4.5. CommissionEmployee–BasePlusCommissionEmployee Inheritance Hierarchy Using private Data23.5. Constructors and Destructors in Derived Classes23.6. public, protected and private Inheritance23.7. Software Engineering with Inheritance23.8. Wrap-UpSummarySection 23.1 IntroductionSection 23.2 Base Classes and Derived ClassesSection 23.3 protected MembersSection 23.4 Relationship between Base Classes and Derived ClassesSection 23.5 Constructors and Destructors in Derived ClassesSection 23.6 public, protected and private InheritanceTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
24. Object-Oriented Programming: Polymorphism
24.1. Introduction24.2. Polymorphism Examples24.3. Relationships Among Objects in an Inheritance Hierarchy24.3.1. Invoking Base-Class Functions from Derived-Class Objects24.3.2. Aiming Derived-Class Pointers at Base-Class Objects24.3.3. Derived-Class Member-Function Calls via Base-Class Pointers24.3.4. Virtual Functions24.3.5. Summary of the Allowed Assignments Between Base-Class and Derived-Class Objects and Pointers24.4. Type Fields and switch Statements24.5. Abstract Classes and Pure virtual Functions24.6. Case Study: Payroll System Using Polymorphism24.6.1. Creating Abstract Base Class Employee24.6.2. Creating Concrete Derived Class SalariedEmployee24.6.3. Creating Concrete Derived Class HourlyEmployee24.6.4. Creating Concrete Derived Class CommissionEmployee24.6.5. Creating Indirect Concrete Derived Class BasePlusCommissionEmployee24.6.6. Demonstrating Polymorphic Processing24.7. (Optional) Polymorphism, Virtual Functions and Dynamic Binding “Under the Hood”24.8. Case Study: Payroll System Using Polymorphism and Runtime Type Information with Downcasting, dynamic_cast, typeid and type_info24.9. Virtual Destructors24.10. Wrap-UpSummarySection 24.1 IntroductionSection 24.3 Relationships Among Objects in an Inheritance HierarchySection 24.5 Abstract Classes and Pure virtual FunctionsSection 24.7 (Optional) Polymorphism, Virtual Functions and Dynamic Binding “Under the Hood”Section 24.8 Case Study: Payroll System Using Polymorphism and Runtime Type Information with Downcasting, dynamic_cast, typeid and type_infoSection 24.9 Virtual DestructorsTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
25. Templates
25.1. Introduction25.2. Function TemplatesExample: Function Template printArray25.3. Overloading Function Templates25.4. Class TemplatesCreating Class Template Stack< T >Creating a Driver to Test Class Template Stack< T >Creating Function Templates to Test Class Template Stack< T >25.5. Nontype Parameters and Default Types for Class Templates25.6. Notes on Templates and Inheritance25.7. Notes on Templates and Friends25.8. Notes on Templates and static Members25.9. Wrap-UpSummarySection 25.1 IntroductionSection 25.2 Function TemplatesSection 25.3 Overloading Function TemplatesSection 25.4 Class TemplatesSection 25.5 Nontype Parameters and Default Types for Class TemplatesSection 25.6 Notes on Templates and InheritanceSection 25.7 Notes on Templates and FriendsSection 25.8 Notes on Templates and static MembersTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
26. Stream Input/Output
26.1. Introduction26.2. Streams26.2.1. Classic Streams vs. Standard Streams26.2.2. iostream Library Header Files26.2.3. Stream Input/Output Classes and ObjectsStream-I/O Template Hierarchy and Operator OverloadingStandard Stream Objects cin, cout, cerr and clogFile-Processing Templates26.3. Stream Output26.3.1. Output of char * Variables26.3.2. Character Output Using Member Function put26.4. Stream Input26.4.1. get and getline Member FunctionsUsing Member Functions eof, get and putComparing cin and cin.getUsing Member Function getline26.4.2. istream Member Functions peek, putback and ignore26.4.3. Type-Safe I/O26.5. Unformatted I/O Using read, write and gcount26.6. Introduction to Stream Manipulators26.6.1. Integral Stream Base: dec, oct, hex and setbase26.6.2. Floating-Point Precision (precision, setprecision)26.6.3. Field Width (width, setw)26.6.4. User-Defined Output Stream Manipulators26.7. Stream Format States and Stream Manipulators26.7.1. Trailing Zeros and Decimal Points (showpoint)26.7.2. Justification (left, right and internal)26.7.3. Padding (fill, setfill)26.7.4. Integral Stream Base (dec, oct, hex, showbase)26.7.5. Floating-Point Numbers; Scientific and Fixed Notation (scientific, fixed)26.7.6. Uppercase/Lowercase Control (uppercase)26.7.7. Specifying Boolean Format (boolalpha)26.7.8. Setting and Resetting the Format State via Member Function flags26.8. Stream Error States26.9. Tying an Output Stream to an Input Stream26.10. Wrap-UpSummarySection 26.1 IntroductionSection 26.2 StreamsSection 26.3 Stream OutputSection 26.4 Stream InputSection 26.5 Unformatted I/O Using read, write and gcountSection 26.6 Introduction to Stream ManipulatorsSection 26.7 Stream Format States and Stream ManipulatorsSection 26.8 Stream Error StatesSection 26.9 Tying an Output Stream to an Input StreamTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
27. Exception Handling
27.1. Introduction27.2. Exception-Handling Overview27.3. Example: Handling an Attempt to Divide by ZeroDefining an Exception Class to Represent the Type of Problem That Might OccurDemonstrating Exception HandlingEnclosing Code in a try BlockDefining a catch Handler to Process a DivideByZeroExceptionTermination Model of Exception HandlingFlow of Program Control When the User Enters a Nonzero DenominatorFlow of Program Control When the User Enters a Denominator of Zero27.4. When to Use Exception Handling27.5. Rethrowing an Exception27.6. Exception Specifications27.7. Processing Unexpected Exceptions27.8. Stack Unwinding27.9. Constructors, Destructors and Exception Handling27.10. Exceptions and Inheritance27.11. Processing new Failuresnew Returning 0 on Failurenew Throwing bad_alloc on FailureHandling new Failures Using Function set_new_handler27.12. Class auto_ptr and Dynamic Memory Allocation27.13. Standard Library Exception Hierarchy27.14. Other Error-Handling Techniques27.15. Wrap-UpSummarySection 27.1 IntroductionSection 27.2 Exception-Handling OverviewSection 27.3 Example: Handling an Attempt to Divide by ZeroSection 27.4 When to Use Exception HandlingSection 27.5 Rethrowing an ExceptionSection 27.6 Exception SpecificationsSection 27.7 Processing Unexpected ExceptionsSection 27.8 Stack UnwindingSection 27.9 Constructors, Destructors and Exception HandlingSection 27.10 Exceptions and InheritanceSection 27.11 Processing new FailuresSection 27.12 Class auto_ptr and Dynamic Memory AllocationSection 27.13 Standard Library Exception HierarchyTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
A. Internet and Web Resources
A.1. Free C/C++ Compilers and Development ToolsA.2. C Resource SitesA.3. C99A.4. C Projects, Freeware and SharewareA.5. C Source CodeA.6. C Articles and WhitepapersA.7. C Tutorials and WebcastsA.8. GNOME and GLibA.9. SWIGA.10. Objective-CA.11. C Sample Chapters and eBooksA.12. C WikisA.13. C FAQsA.14. C NewsgroupsA.15. C BlogsA.16. C Downloads from Download.comA.17. C Game ProgrammingA.18. Allegro Game Programming ResourcesA.19. Jobs for C ProgrammersA.20. Deitel C Training
B. Operator Precedence Charts
C. ASCII Character Set
D. Number Systems
D.1. IntroductionD.2. Abbreviating Binary Numbers as Octal and Hexadecimal NumbersD.3. Converting Octal and Hexadecimal Numbers to Binary NumbersD.4. Converting from Binary, Octal or Hexadecimal to DecimalD.5. Converting from Decimal to Binary, Octal or HexadecimalD.6. Negative Binary Numbers: Two’s Complement NotationSummaryTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercises
E. Game Programming: Solving Sudoku
E.1. IntroductionE.2. Deitel Sudoku Resource CenterE.3. Solution StrategiesSingletonsDoublesTriplesOther Sudoku Solution StrategiesE.4. Programming Sudoku Puzzle SolversProgramming a Solution for “Easy” SudokusProgramming a Solution for Harder SudokusE.5. Generating New Sudoku PuzzlesBrute Force ApproachesAn Exhaustive Brute Force ApproachBrute Force Approach with Randomly Selected Row PermutationsHeuristic Solution StrategiesA “Keep Your Options Open” Sudoku Solving HeuristicLookahead HeuristicForming Sudoku Puzzles with Empty CellsA Programming ChallengeE.6. Conclusion

Content preview from C How to Program, Fifth Edition

Appendix D. Number Systems

	Here are only numbers ratified.
	--William Shakespeare

Nature has some sort of arithmetic-geometrical coordinate system, because nature has all kinds of models. What we experience of nature is in models, and all of nature’s models are so beautiful.

It struck me that nature’s system must be a real beauty, because in chemistry we find that the associations are always in beautiful whole numbers—there are no fractions.

--Richard Buckminster Fuller

<feature><title>Objectives</title>

In this appendix, you will learn:

To understand basic number systems concepts such as base, positional value and symbol value.

</objective> <objective>

To understand how to work with numbers represented in the binary, octal and hexadecimal ...

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.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Publisher Resources

ISBN: 9780136085881Purchase book

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

C How to Program, Fifth Edition

by P. J. Deitel - Deitel & Associates, Inc., H. M. Deitel - Deitel & Associates, Inc.

Appendix D. Number Systems

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.