Add NoteAdd Note

HighlightHighlight

CopyCopy

ZoomZoom

PrintPrint

HelpHelp

PreviousPrevious

NextNext

« Back to My CourseSmart

C How to Program, Fifth Edition

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

eTextbook digital rental: 180 days

Our Price: $71.99

Regular Price: $123.00

You save: $51.01

Available Online Only

Add to Cart

View Student Resources

Free Trial

Access sample pages from your bookshelf. Take notes, highlight, print and more!

Start Free Trial

Tabs for Contents, notes, highlights

Contents
Notes
Highlights

Detailed Table of Contents

Hide Contents, Notes, and Highlights

Search TermsShow Hide

« Back to eTextbook

Copyright, iv
Deitel® Series Page, ii
Preface, xxi
1. Introduction to Computers, the Internet and the Web, 1
1.1. Introduction, 2
1.2. What Is a Computer?, 4
1.3. Computer Organization, 4
1.4. Early Operating Systems, 5
1.5. Personal, Distributed and Client/Server Computing, 6
1.6. Machine Languages, Assembly Languages and High-Level Languages, 6
1.7. Fortran, COBOL, Pascal and Ada, 8
1.8. History of C, 8
1.9. C Standard Library, 9
1.10. C++, 10
1.11. Java, 11
1.12. BASIC, Visual Basic, Visual C++, Visual C# and .NET, 11
1.13. Key Software Trend: Object Technology, 12
1.14. Typical C Program Development Environment, 13
1.15. Hardware Trends, 16
1.16. History of the Internet, 16
1.17. History of the World Wide Web, 18
1.18. Notes About C and This Book, 18
1.19. Web Resources, 19
Summary, 20
Terminology, 28
Self-Review Exercises, 29
Answers to Self-Review Exercises, 30
Exercises, 30
2. Introduction to C Programming, 32
2.1. Introduction, 33
2.2. A Simple C Program: Printing a Line of Text, 33
2.4. Memory Concepts, 42
2.5. Arithmetic in C, 43
2.6. Decision Making: Equality and Relational Operators, 47
Summary, 51
Terminology, 54
Self-Review Exercises, 55
Answers to Self-Review Exercises, 56
Exercises, 58
3. Structured Program Development in C, 62
3.1. Introduction, 63
3.2. Algorithms, 63
3.3. Pseudocode, 64
3.4. Control Structures, 64
3.5. The if Selection Statement, 66
3.6. The if...else Selection Statement, 68
3.7. The while Repetition Statement, 71
3.8. Formulating Algorithms Case Study 1: Counter-Controlled Repetition, 72
3.9. Formulating Algorithms with Top-Down, Stepwise Refinement Case Study 2: Sentinel-Controlled Repetition, 75
3.10. Formulating Algorithms with Top-Down, Stepwise Refinement Case Study 3: Nested Control Structures, 81
3.11. Assignment Operators, 85
3.12. Increment and Decrement Operators, 85
Summary, 89
Terminology, 93
Self-Review Exercises, 94
Answers to Self-Review Exercises, 95
Exercises, 97
4. C Program Control, 107
4.1. Introduction, 108
4.2. Repetition Essentials, 108
4.3. Counter-Controlled Repetition, 109
4.4. for Repetition Statement, 111
4.5. for Statement: Notes and Observations, 113
4.6. Examples Using the for Statement, 114
4.7. switch Multiple-Selection Statement, 118
4.8. do...while Repetition Statement, 124
4.9. break and continue Statements, 126
4.10. Logical Operators, 128
4.11. Confusing Equality (==) and Assignment (=) Operators, 130
4.12. Structured Programming Summary, 132
Summary, 137
Terminology, 141
Self-Review Exercises, 142
Answers to Self-Review Exercises, 143
Exercises, 144
5. C Functions, 151
5.1. Introduction, 152
5.2. Program Modules in C, 152
5.3. Math Library Functions, 153
5.4. Functions, 155
5.5. Function Definitions, 156
5.7. Function Call Stack and Activation Records, 162
5.8. Headers, 163
5.9. Calling Functions: Call-by-Value and Call-by-Reference, 164
5.10. Random Number Generation, 165
5.11. Example: A Game of Chance, 170
5.12. Storage Classes, 174
5.13. Scope Rules, 176
5.15. Example Using Recursion: Fibonacci Series, 183
5.16. Recursion vs. Iteration, 186
Summary, 188
Terminology, 193
Self-Review Exercises, 193
Answers to Self-Review Exercises, 196
Exercises, 198
6. C Arrays, 208
6.1. Introduction, 209
6.2. Arrays, 209
6.3. Defining Arrays, 211
6.4. Array Examples, 211
6.5. Passing Arrays to Functions, 225
6.6. Sorting Arrays, 229
6.7. Case Study: Computing Mean, Median and Mode Using Arrays, 232
6.9. Multiple-Subscripted Arrays, 242
Terminology, 252
Self-Review Exercises, 253
Answers to Self-Review Exercises, 254
Exercises, 255
Recursion Exercises, 265
Special Section: Sudoku, 266
7. C Pointers, 267
7.1. Introduction, 268
7.2. Pointer Variable Definitions and Initialization, 268
7.3. Pointer Operators, 269
7.4. Passing Arguments to Functions by Reference, 272
7.5. Using the const Qualifier with Pointers, 276
7.6. Bubble Sort Using Call-by-Reference, 282
7.7. sizeof Operator, 285
7.8. Pointer Expressions and Pointer Arithmetic, 288
7.9. Relationship between Pointers and Arrays, 290
7.10. Arrays of Pointers, 295
7.11. Case Study: Card Shuffling and Dealing Simulation, 295
Summary, 306
Terminology, 309
Self-Review Exercises, 309
Answers to Self-Review Exercises, 311
Exercises, 312
Special Section: Building Your Own Computer, 315
8. C Characters and Strings, 325
8.1. Introduction, 326
8.2. Fundamentals of Strings and Characters, 326
8.3. Character-Handling Library, 328
8.5. Standard Input/Output Library Functions, 338
8.6. String-Manipulation Functions of the String-Handling Library, 343
8.7. Comparison Functions of the String-Handling Library, 345
8.8. Search Functions of the String-Handling Library, 347
8.9. Memory Functions of the String-Handling Library, 354
8.10. Other Functions of the String-Handling Library, 358
Summary, 359
Terminology, 362
Self-Review Exercises, 363
Answers to Self-Review Exercises, 364
Exercises, 365
Special Section: Advanced String-Manipulation Exercises, 368
A Challenging String-Manipulation Project, 371
9. C Formatted Input/Output, 372
9.1. Introduction, 373
9.2. Streams, 373
9.3. Formatting Output with printf, 373
9.4. Printing Integers, 374
9.5. Printing Floating-Point Numbers, 376
9.6. Printing Strings and Characters, 377
9.7. Other Conversion Specifiers, 379
9.9. Using Flags in the printf Format Control String, 383
9.10. Printing Literals and Escape Sequences, 385
9.11. Reading Formatted Input with scanf, 386
Terminology, 395
Self-Review Exercises, 396
Answers to Self-Review Exercises, 397
Exercises, 398
10. C Structures, Unions, Bit Manipulations and Enumerations, 401
10.1. Introduction, 402
10.2. Structure Definitions, 402
10.3. Initializing Structures, 405
10.4. Accessing Members of Structures, 405
10.7. Example: High-Performance Card Shuffling and Dealing Simulation, 408
10.8. Unions, 411
10.10. Bit Fields, 422
10.11. Enumeration Constants, 426
Terminology, 430
Self-Review Exercises, 431
Answers to Self-Review Exercises, 433
Exercises, 433
11. C File Processing, 438
11.1. Introduction, 439
11.2. Data Hierarchy, 439
11.3. Files and Streams, 441
11.4. Creating a Sequential-Access File, 442
11.5. Reading Data from a Sequential-Access File, 447
11.6. Random-Access Files, 452
11.7. Creating a Random-Access File, 453
11.8. Writing Data Randomly to a Random-Access File, 455
11.9. Reading Data from a Random-Access File, 458
Terminology, 469
Self-Review Exercises, 469
Answers to Self-Review Exercises, 471
Exercises, 471
12. C Data Structures, 477
12.1. Introduction, 478
12.2. Self-Referential Structures, 479
12.3. Dynamic Memory Allocation, 479
12.4. Linked Lists, 481
12.5. Stacks, 490
12.6. Queues, 496
12.7. Trees, 502
Summary, 508
Terminology, 511
Self-Review Exercises, 511
Answers to Self-Review Exercises, 513
Exercises, 514
Special Section: Building Your Own Compiler, 520
13. C Preprocessor, 533
13.1. Introduction, 534
13.2. #include Preprocessor Directive, 534
13.3. #define Preprocessor Directive: Symbolic Constants, 535
13.4. #define Preprocessor Directive: Macros, 535
13.5. Conditional Compilation, 537
13.6. #error and #pragma Preprocessor Directives, 538
13.7. # and ## Operators, 538
13.10. Assertions, 540
Summary, 540
Terminology, 542
Self-Review Exercises, 542
Answers to Self-Review Exercises, 543
Exercises, 544
14. Other C Topics, 545
14.1. Introduction, 546
14.2. Redirecting Input/Output on Linux/UNIX and Windows Systems, 546
14.3. Variable-Length Argument Lists, 547
14.5. Notes on Compiling Multiple-Source-File Programs, 551
14.6. Program Termination with exit and atexit, 552
14.7. volatile Type Qualifier, 554
14.8. Suffixes for Integer and Floating-Point Constants, 554
14.9. More on Files, 554
14.10. Signal Handling, 557
14.12. Unconditional Branching with goto, 560
Summary, 561
Terminology, 564
Self-Review Exercise, 564
Answers to Self-Review Exercise, 565
Exercises, 565
15. Game Programming with the Allegro C Library, 566
15.1. Introduction, 567
15.2. Installing Allegro, 567
15.3. A Simple Allegro Program, 568
15.4. Simple Graphics: Importing Bitmaps and Blitting, 569
15.5. Animation with Double Buffering, 574
15.6. Importing and Playing Sounds, 581
15.7. Keyboard Input, 585
15.8. Fonts and Displaying Text, 590
15.9. Implementing the Game of Pong, 596
15.10. Timers in Allegro, 602
15.11. The Grabber and Allegro Datafiles, 608
15.12. Other Allegro Capabilities, 616
15.13. Allegro Internet and Web Resources, 617
Summary, 618
Terminology, 621
Self-Review Exercises, 621
Answers to Self-Review Exercises, 622
Exercises, 623
16. Sorting: A Deeper Look, 624
16.1. Introduction, 625
16.2. Big O Notation, 625
16.3. Selection Sort, 626
16.4. Insertion Sort, 630
16.5. Merge Sort, 633
Summary, 639
Terminology, 641
Self-Review Exercises, 641
Answers to Self-Review Exercises, 641
Exercises, 641
17. Introduction to C99, 644
17.1. Introduction, 645
17.2. Support for C99, 645
17.3. New C99 Headers, 646
17.4. // Comments, 647
17.6. Declaring a Variable in a for Statement Header, 649
17.9. Implicit int in Function Declarations, 655
17.10. Complex Numbers, 656
17.11. Variable-Length Arrays, 657
17.12. Other C99 Features, 659
17.13. Internet and Web Resources, 661
Summary, 662
Terminology, 664
Self-Review Exercises, 664
Answers to Self-Review Exercises, 665
Exercises, 665
18. C++ as a Better C; Introducing Object Technology, 666
18.1. Introduction, 667
18.2. C++, 667
18.3. A Simple Program: Adding Two Integers, 668
18.4. C++ Standard Library, 670
18.5. Header Files, 671
18.6. Inline Functions, 673
18.7. References and Reference Parameters, 676
18.8. Empty Parameter Lists, 680
18.10. Unary Scope Resolution Operator, 683
18.11. Function Overloading, 684
18.12. Function Templates, 687
18.13. Introduction to Object Technology and the UML, 690
18.14. Wrap-Up, 694
Summary, 695
Terminology, 697
Self-Review Exercises, 698
Answers to Self-Review Exercises, 699
Exercises, 700
19. Introduction to Classes and Objects, 701
19.1. Introduction, 702
19.2. Classes, Objects, Member Functions and Data Members, 702
19.3. Overview of the Chapter Examples, 703
19.4. Defining a Class with a Member Function, 704
19.5. Defining a Member Function with a Parameter, 708
19.6. Data Members, set Functions and get Functions, 711
19.7. Initializing Objects with Constructors, 718
19.8. Placing a Class in a Separate File for Reusability, 722
19.9. Separating Interface from Implementation, 726
19.10. Validating Data with set Functions, 732
19.11. Wrap-Up, 737
Summary, 737
Terminology, 740
Self-Review Exercises, 741
Answers to Self-Review Exercises, 742
Exercises, 742
20. Classes: A Deeper Look, Part 1, 744
20.1. Introduction, 745
20.2. Time Class Case Study, 746
20.3. Class Scope and Accessing Class Members, 751
20.4. Separating Interface from Implementation, 754
20.5. Access Functions and Utility Functions, 755
20.6. Time Class Case Study: Constructors with Default Arguments, 758
20.7. Destructors, 763
20.8. When Constructors and Destructors Are Called, 764
20.9. Time Class Case Study: A Subtle Trap—Returning a Reference to a private Data Member, 767
20.10. Default Memberwise Assignment, 770
20.11. Software Reusability, 772
20.12. Wrap-Up, 773
Summary, 773
Terminology, 776
Self-Review Exercises, 776
Answers to Self-Review Exercises, 777
Exercises, 777
21. Classes: A Deeper Look, Part 2, 779
21.1. Introduction, 780
21.2. const (Constant) Objects and const Member Functions, 780
21.4. friend Functions and friend Classes, 797
21.5. Using the this Pointer, 801
21.6. Dynamic Memory Management with Operators new and delete, 806
21.8. Data Abstraction and Information Hiding, 814
21.9. Container Classes and Iterators, 817
21.10. Proxy Classes, 817
Terminology, 823
Self-Review Exercises, 824
Answers to Self-Review Exercises, 825
Exercises, 825
22. Operator Overloading, 827
22.1. Introduction, 828
22.2. Fundamentals of Operator Overloading, 829
22.3. Restrictions on Operator Overloading, 830
22.4. Operator Functions as Class Members vs. Global Functions, 832
22.5. Overloading Stream Insertion and Stream Extraction Operators, 833
22.6. Overloading Unary Operators, 837
22.7. Overloading Binary Operators, 837
22.8. Case Study: Array Class, 838
22.10. Overloading ++ and −−, 851
22.11. explicit Constructors, 852
Terminology, 859
Self-Review Exercises, 859
Answers to Self-Review Exercises, 860
Exercises, 860
23. Object-Oriented Programming: Inheritance, 868
23.1. Introduction, 869
23.2. Base Classes and Derived Classes, 870
23.3. protected Members, 873
23.4. Relationship between Base Classes and Derived Classes, 873
23.5. Constructors and Destructors in Derived Classes, 905
23.6. public, protected and private Inheritance, 913
23.7. Software Engineering with Inheritance, 913
23.8. Wrap-Up, 915
Summary, 916
Terminology, 917
Self-Review Exercises, 918
Answers to Self-Review Exercises, 918
Exercises, 918
24. Object-Oriented Programming: Polymorphism, 921
24.1. Introduction, 922
24.2. Polymorphism Examples, 924
24.3. Relationships Among Objects in an Inheritance Hierarchy, 925
24.4. Type Fields and switch Statements, 942
24.5. Abstract Classes and Pure virtual Functions, 943
24.6. Case Study: Payroll System Using Polymorphism, 945
24.7. (Optional) Polymorphism, Virtual Functions and Dynamic Binding “Under the Hood”, 963
24.8. Case Study: Payroll System Using Polymorphism and Runtime Type Information with Downcasting, dynamic_cast, typeid and type_info, 967
24.9. Virtual Destructors, 970
24.10. Wrap-Up, 971
Summary, 971
Terminology, 973
Self-Review Exercises, 974
Answers to Self-Review Exercises, 974
Exercises, 974
25. Templates, 976
25.1. Introduction, 977
25.2. Function Templates, 978
25.3. Overloading Function Templates, 981
25.4. Class Templates, 981
25.5. Nontype Parameters and Default Types for Class Templates, 988
25.6. Notes on Templates and Inheritance, 989
25.7. Notes on Templates and Friends, 989
25.9. Wrap-Up, 991
Summary, 991
Terminology, 992
Self-Review Exercises, 993
Answers to Self-Review Exercises, 993
Exercises, 994
26. Stream Input/Output, 996
26.1. Introduction, 997
26.2. Streams, 998
26.3. Stream Output, 1002
26.4. Stream Input, 1003
26.6. Introduction to Stream Manipulators, 1008
26.9. Tying an Output Stream to an Input Stream, 1027
26.10. Wrap-Up, 1027
Summary, 1027
Terminology, 1030
Self-Review Exercises, 1031
Answers to Self-Review Exercises, 1034
Exercises, 1035
27. Exception Handling, 1038
27.1. Introduction, 1039
27.2. Exception-Handling Overview, 1040
27.3. Example: Handling an Attempt to Divide by Zero, 1040
27.4. When to Use Exception Handling, 1047
27.5. Rethrowing an Exception, 1048
27.7. Processing Unexpected Exceptions, 1050
27.8. Stack Unwinding, 1051
27.10. Exceptions and Inheritance, 1053
27.11. Processing new Failures, 1053
27.12. Class auto_ptr and Dynamic Memory Allocation, 1057
27.14. Other Error-Handling Techniques, 1062
27.15. Wrap-Up, 1062
Summary, 1063
Terminology, 1066
Self-Review Exercises, 1066
Answers to Self-Review Exercises, 1067
Exercises, 1068
A. Internet and Web Resources, 1070
A.1. Free C/C++ Compilers and Development Tools, 1070
A.2. C Resource Sites, 1071
A.3. C99, 1071
A.4. C Projects, Freeware and Shareware, 1073
A.5. C Source Code, 1073
A.6. C Articles and Whitepapers, 1073
A.7. C Tutorials and Webcasts, 1074
A.8. GNOME and GLib, 1075
A.9. SWIG, 1076
A.10. Objective-C, 1076
A.11. C Sample Chapters and eBooks, 1077
A.12. C Wikis, 1077
A.13. C FAQs, 1077
A.14. C Newsgroups, 1078
A.15. C Blogs, 1078
A.16. C Downloads from Download.com, 1078
A.17. C Game Programming, 1078
A.18. Allegro Game Programming Resources, 1079
A.19. Jobs for C Programmers, 1081
A.20. Deitel C Training, 1081
B. Operator Precedence Charts, 1082
C. ASCII Character Set, 1086
D. Number Systems, 1087
D.1. Introduction, 1088
D.2. Abbreviating Binary Numbers as Octal and Hexadecimal Numbers, 1091
D.3. Converting Octal and Hexadecimal Numbers to Binary Numbers, 1092
D.4. Converting from Binary, Octal or Hexadecimal to Decimal, 1092
D.5. Converting from Decimal to Binary, Octal or Hexadecimal, 1093
D.6. Negative Binary Numbers: Two’s Complement Notation, 1095
Summary, 1096
Terminology, 1097
Self-Review Exercises, 1097
Answers to Self-Review Exercises, 1098
Exercises, 1099
E. Game Programming: Solving Sudoku, 1100
E.1. Introduction, 1100
E.2. Deitel Sudoku Resource Center, 1101
E.3. Solution Strategies, 1101
E.4. Programming Sudoku Puzzle Solvers, 1105
E.5. Generating New Sudoku Puzzles, 1106
E.6. Conclusion, 1108
Index, I-1-1

Search Results

« Back to eTextbook


PAGE	Description

118	...