did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

We're the #1 textbook rental company. Let us show you why.

9781418836405

C++ Programming

by
  • ISBN13:

    9781418836405

  • ISBN10:

    1418836400

  • Edition: 3rd
  • Format: Paperback
  • Copyright: 2006-05-02
  • Publisher: Cengage Learning Ptr
  • View Upgraded Edition
  • Purchase Benefits
  • Free Shipping Icon Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • eCampus.com Logo Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $181.95

Summary

Now in its third edition, D.S. Malik's C++ Programming: Program Design Including Data Structures contains sufficient material to satisfy a two-semester CS1/CS2 sequence in C++ Programming. Beginning with core computer science concepts and later moving into data structures, each chapter employs the author's proven pedagogy, including accurate, full-color code, extensive exercises sets, and clear visual diagrams. In addition, the book offers at least one complete Programming Example at the end of each chapter displaying the stages of Input/Output, Program Analysis, and Algorithm Design. Book jacket.

Author Biography

D.S. Malik is a Professor of Mathematics and Computer Science at Creighton University

Table of Contents

Preface xxxiii
An Overview of Computers and Programming Languages
1(28)
Introduction
2(1)
A Brief Overview of the History of Computers
2(1)
Elements of a Computer System
3(3)
Hardware
3(1)
Central Processing Unit
3(1)
Main Memory
4(1)
Secondary Storage
5(1)
Input/Output Devices
5(1)
Software
6(1)
The Language of a Computer
6(2)
The Evolution of Programming Languages
8(1)
A C++ Program
9(3)
Processing a C++ Program
12(2)
Programming with the Problem Analysis-Coding-Execution Cycle
14(8)
Programming Methodologies
22(2)
Structured Programming
22(1)
Object-Oriented Programming
22(2)
ANSI/ISO Standard C++
24(1)
Quick Review
24(2)
Exercises
26(3)
Basic Elements of C++
29(86)
The Basics of a C++ Program
30(4)
Special Symbols
32(1)
Word Symbols
32(1)
Identifiers
32(2)
Data Types
34(5)
Simple Data Types
34(3)
Floating-Point Data Types
37(2)
Arithmetic Operators and Operator Precedence
39(5)
Order of Precedence
43(1)
Expressions
44(3)
Mixed Expressions
45(2)
Type Conversion (Casting)
47(4)
string Type
50(1)
Input
51(17)
Allocating Memory with Constants and Variables
51(3)
Putting Data into Variables
54(1)
Assignment Statement
54(2)
Saving and Using the Value of an Expression
56(1)
Declaring and Initializing Variables
57(1)
Input (Read) Statement
58(4)
Variable Initialization
62(6)
Increment and Decrement Operators
68(2)
Output
70(8)
Preprocessor Directives
78(2)
namespace and Using cin and cout in a Program
79(1)
Using the string Data Type in a Program
79(1)
Creating a C++ Program
80(4)
Program Style and Form
84(5)
Syntax
84(1)
Use of Blanks
85(1)
Use of Semicolons, Brackets, and Commas
85(1)
Semantics
85(1)
Naming Identifiers
85(1)
Prompt Lines
86(1)
Documentation
87(1)
Comments
87(1)
Form and Style
87(2)
More on Assignment Statements
89(2)
Programming Example: Convert Length
91(4)
Programming Example: Make Change
95(3)
Quick Review
98(2)
Exercises
100(9)
Programming Exercises
109(6)
Input/Output
115(52)
I/O Streams and Standard I/O Devices
116(7)
cin and the Extraction Operator >>
117(6)
Using Predefined Functions in a Program
123(8)
cin and the get Function
125(1)
cin and the ignore Function
126(2)
The putback and peek Functions
128(2)
The Dot Notation Between I/O Stream Variables and I/O Functions: A Precaution
130(1)
Input Failure
131(4)
The clear Function
133(2)
Output and Formatting Output
135(6)
setprecision Manipulator
135(1)
fixed Manipulator
136(1)
showpoint Manipulator
136(2)
setw
138(3)
flush Manipulator
141(1)
Additional Output Formatting Tools
141(5)
setfill Manipulator
142(1)
left and right Manipulators
143(3)
Input/Output and the string Type
146(1)
File Input/Output
147(3)
Programming Example: Movie Ticket Sale and Donation to Charity
150(6)
Programming Example: Student Grade
156(3)
Quick Review
159(2)
Exercises
161(3)
Programming Exercises
164(3)
Control Structures I (Selection)
167(64)
Control Structures
168(1)
Relational Operators
169(6)
Relational Operators and Simple Data Types
171(2)
Relational Operators and the string Type
173(2)
Logical (Boolean) Operators and Logical Expressions
175(9)
Order of Precedence
177(4)
Short-Circuit Evaluation
181(1)
int Data Type and Logical (Boolean) Expressions
182(1)
bool Data Type and Logical (Boolean) Expressions
183(1)
Selection: if and if...else
184(20)
One-Way Selection
185(2)
Two-Way Selection
187(4)
Compound (Block of) Statements
191(1)
Multiple Selections: Nested if
192(3)
Comparing if...else Statements with a Series of if Statements
195(1)
Using Pseudocode to Develop, Test, and Debug a Program
196(3)
Input Failure and the if Statement
199(3)
Confusion Between the Equality Operator (==) and the Assignment Operator (=)
202(1)
Conditional Operator (? :)
203(1)
switch Structures
204(7)
Terminating a Program with the assert Function
211(3)
Programming Example: Cable Company Billing
214(5)
Quick Review
219(2)
Exercises
221(5)
Programming Exercises
226(5)
Control Structures II (Repetition)
231(78)
Why Is Repetition Needed?
232(1)
while Looping (Repetition) Structure
233(17)
Case 1: Counter-Controlled while Loops
236(2)
Case 2: Sentinel-Controlled while Loops
238(5)
Case 3: Flag-Controlled while Loops
243(4)
Case 4: EOF-Controlled while Loops
247(1)
eof Function
248(1)
More on Expressions in while Statements
249(1)
Programming Example: Checking Account Balance
250(9)
Programming Example: Fibonacci Number
259(5)
for Looping (Repetition) Structure
264(6)
Programming Example: Classifying Numbers
270(4)
do...while Looping (Repetition) Structure
274(5)
break and continue Statements
279(2)
Nested Control Structures
281(8)
Quick Review
289(2)
Exercises
291(11)
Programming Exercises
302(7)
User-Defined Functions I
309(36)
Predefined Functions
310(3)
User-Defined Functions
313(1)
Value-Returning Functions
314(14)
Syntax: Value-Returning function
316(1)
Syntax: Formal Parameter List
316(1)
Function Call
316(1)
Syntax: Actual Parameter List
316(1)
return Statement
317(1)
Syntax: return Statement
317(3)
Function Prototype
320(1)
Syntax: Function Prototype
321(6)
Flow of Execution
327(1)
Programming Example: Largest Number
328(1)
Programming Example: Cable Company
329(6)
Quick Review
335(2)
Exercises
337(4)
Programming Exercises
341(4)
User-Defined Functions II
345(74)
Void Functions
346(9)
Void Functions Without Parameters
346(3)
Void Functions with Parameters
349(5)
Value Parameters
354(1)
Reference Variables as Parameters
355(5)
Value and Reference Parameters and Memory Allocation
360(15)
Reference Parameters and Value-Returning Functions
375(1)
Scope of an Identifier
375(4)
Global Variables, Named Constants, and Side Effects
379(1)
Static and Automatic Variables
380(2)
Function Overloading: An Introduction
382(2)
Functions with Default Parameters
384(3)
Programming Example: Classify Numbers
387(5)
Programming Example: Data Comparison
392(10)
Quick Review
402(2)
Exercises
404(7)
Programming Exercises
411(8)
User-Defined Simple Data Types, Namespaces, and the string Type
419(54)
Enumeration Type
420(10)
Declaring Variables
422(1)
Assignment
422(1)
Operations on Enumeration Types
423(1)
Relational Operators
423(1)
Input/Output of Enumeration Types
424(2)
Functions and Enumeration Types
426(2)
Declaring Variables When Defining the Enumeration Type
428(1)
Anonymous Data Types
428(1)
typedef Statement
429(1)
Programming Example: The Game of Rock, Paper, and Scissors
430(11)
Namespaces
441(5)
string Type
446(12)
Additional string Operations
450(1)
length Function
450(2)
size Function
452(1)
find Function
453(3)
substr Function
456(2)
swap Function
458(1)
Programming Example: Pig Latin Strings
458(6)
Quick Review
464(3)
Exercises
467(3)
Programming Exercises
470(3)
Arrays and Strings
473(78)
Arrays
475(21)
Accessing Array Components
476(3)
Processing One-Dimensional Arrays
479(4)
Array Index Out of Bounds
483(1)
Array Initialization During Declaration
484(1)
Partial Initialization of Arrays During Declaration
484(1)
Some Restrictions on Array Processing
485(1)
Arrays as Parameters to Functions
486(1)
Constant Arrays as Formal Parameters
487(2)
Base Address of an Array and Array in Computer Memory
489(3)
Functions Cannot Return a Value of the Type array
492(3)
Integral Data Type and Array Indices
495(1)
Other Ways to Declare Arrays
495(1)
c-strings (Character Arrays)
496(7)
String Comparison
498(2)
Reading and Writing Strings
500(1)
String Input
500(1)
String Output
501(1)
Specifying Input/Output Files at Execution Time
502(1)
string Type and Input/Output Files
502(1)
Parallel Arrays
503(1)
Two- and Multidimensional Arrays
504(18)
Accessing Array Components
506(1)
Two-Dimensional Array Initialization During Declaration
507(1)
Two-Dimensional Arrays and Enumeration Types
507(4)
Initialization
511(1)
Print
511(1)
Input
511(1)
Sum by Row
512(1)
Sum by Column
512(1)
Largest Element in Each Row and Each Column
512(1)
Reversing Diagonal
513(2)
Passing Two-Dimensional Arrays as Parameters to Functions
515(3)
Arrays of Strings
518(1)
Arrays of Strings and the string Type
518(1)
Arrays of Strings and c-Strings (Character Arrays)
519(1)
Another Way to Declare a Two-Dimensional Array
520(1)
Multidimensional Arrays
521(1)
Programming Example: Code Detection
522(7)
Programming Example: Text Processing
529(7)
Quick Review
536(2)
Exercises
538(5)
Programming Exercises
543(8)
Records (structS)
551(40)
Records (structs)
552(17)
Accessing struct Members
554(2)
Assignment
556(1)
Comparison (Relational Operators)
557(1)
Input/Output
558(1)
struct Variables and Functions
558(1)
Arrays versus structs
559(1)
Arrays in structs
560(2)
structs in Arrays
562(3)
structs within a struct
565(4)
Programming Example: Sales Data Analysis
569(16)
Quick Review
585(1)
Exercises
586(2)
Programming Exercises
588(3)
Classes and Data Abstraction
591(76)
Classes
592(34)
Unified Modeling Language Class Diagrams
595(1)
Variable (Object) Declaration
596(1)
Accessing Class Members
597(1)
Built-in Operations on Classes
598(1)
Assignment Operator and Classes
599(1)
Class Scope
600(1)
Functions and Classes
600(1)
Reference Parameters and Class Objects (Variables)
601(1)
Implementation of Member Functions
601(5)
Accessor and Mutator Functions
606(6)
Order of public and private Members of a Class
612(2)
Constructors
614(2)
Invoking a Constructor
616(1)
Invoking the Default Constructor
616(1)
Invoking a Constructor with Parameters
617(3)
Constructors and Default Parameters
620(2)
Classes and Constructors: A Precaution
622(1)
Arrays of Class Objects (Variables) and Constructors
623(2)
Destructors
625(1)
Data Abstraction, Classes, and Abstract Data Types
626(3)
A struct Versus a class
628(1)
Information Hiding
629(4)
Executable Code
633(3)
Static Members of a Class
636(6)
Programming Example: Candy Machine
642(15)
Quick Review
657(2)
Exercises
659(5)
Programming Exercises
664(3)
Inheritance and Composition
667(66)
Inheritance
668(25)
Redefining (Overriding) Member Functions of the Base Class
671(7)
Constructors of Derived and Base Classes
678(8)
Multiple Inclusions of a Header File
686(2)
C++ Stream Classes
688(1)
Protected Members of a Class
689(1)
Inheritance as public, protected, or private
689(4)
Composition
693(5)
Object-Oriented Design (OOD) and Object-Oriented Programming (OOP)
698(3)
Identifying Classes, Objects, and Operations
700(1)
Programming Example: Grade Report
701(20)
Quick Review
721(1)
Exercises
722(6)
Programming Exercises
728(5)
Pointers, Classes, Virtual Functions, Abstract Classes, and Lists
733(84)
Pointer Data Type and Pointer Variables
734(1)
Declaring Pointer Variables
734(1)
Address of Operator (&)
735(1)
Dereferencing Operator (*)
736(6)
Classes, Structs, and Pointer Variables
742(3)
Initializing Pointer Variables
745(1)
Dynamic Variables
745(4)
Operator new
746(1)
Operator delete
747(2)
Operations on Pointer Variables
749(2)
Dynamic Arrays
751(7)
Functions and Pointers
754(1)
Pointers and Function Return Values
754(1)
Dynamic Two-Dimensional Arrays
755(3)
Shallow versus Deep Copy and Pointers
758(2)
Classes and Pointers: Some Peculiarities
760(11)
Destructor
761(1)
Assignment Operator
762(2)
Copy Constructor
764(7)
Inheritance, Pointers, and Virtual Functions
771(7)
Classes and Virtual Destructors
778(1)
Abstract Classes and Pure Virtual Functions
778(8)
Array-Based Lists
786(8)
Unordered Lists
794(6)
Ordered Lists
800(1)
Address of Operator and Classes
801(3)
Quick Review
804(3)
Exercises
807(7)
Programming Exercises
814(3)
Overloading and Templates
817(90)
Why Operator Overloading Is Needed
818(1)
Operator Overloading
819(39)
Syntax for Operator Functions
820(1)
Overloading an Operator: Some Restrictions
820(1)
Pointer this
821(5)
Friend Functions of Classes
826(3)
Operator Functions as Member Functions and Nonmember Functions
829(3)
Overloading Binary Operators
832(6)
Overloading the Stream Insertion (<<) and Extraction (>>) Operators
838(5)
Overloading the Assignment Operator (=)
843(8)
Overloading Unary Operators
851(6)
Operator Overloading: Member versus Nonmember
857(1)
Classes and Pointer Member Variables (Revisited)
858(1)
Operator Overloading: One Final Word
858(1)
Programming Example: clockType
858(8)
Programming Example: Complex Numbers
866(6)
Overloading the Array Index (Subscript) Operator
872(2)
Programming Example: newString
874(6)
Function Overloading
880(1)
Templates
881(11)
Function Templates
881(2)
Class Templates
883(3)
Array-Based Lists (Revisited)
886(6)
Quick Review
892(3)
Exercises
895(4)
Programming Exercises
899(8)
Exception Handling
907(38)
Handling Exceptions within a Program
908(15)
C++ Mechanisms of Exception Handling
912(1)
try/catch Block
912(7)
Using C++ Exception Classes
919(4)
Creating Your Own Exception Classes
923(10)
Rethrowing and Throwing an Exception
929(4)
Exception Handling Techniques
933(2)
Terminate the Program
933(1)
Fix the Error and Continue
934(1)
Log the Error and Continue
935(1)
Stack Unwinding
935(4)
Quick Review
939(2)
Exercises
941(3)
Programming Exercises
944(1)
Recursion
945(36)
Recursive Definitions
946(4)
Direct and Indirect Recursion
949(1)
Infinite Recursion
949(1)
Problem Solving Using Recursion
950(12)
Tower of Hanoi: Analysis
961(1)
Recursion or Iteration?
962(1)
Programming Example: Converting a Number from Binary to Decimal
963(5)
Programming Example: Converting a Number from Decimal to Binary
968(4)
Quick Review
972(1)
Exercises
973(3)
Programming Exercises
976(5)
Linked Lists
981(94)
Linked Lists
982(14)
Linked Lists: Some Properties
983(9)
Building a Linked List
992(4)
Linked List as an ADT
996(13)
Structure of Linked List Nodes
998(1)
Member Variables of the class linkedListType
998(1)
Linked List Iterators
998(7)
Print the List
1005(1)
Length of a List
1005(1)
Retrieve the Data of the First Node
1006(1)
Retrieve the Data of the Last Node
1006(1)
Begin and End
1006(1)
Copy the List
1007(1)
Destructor
1008(1)
Copy Constructor
1008(1)
Overloading the Assignment Operator
1009(1)
Unordered Linked Lists
1009(9)
Search the List
1010(1)
Insert the First Node
1011(1)
Insert the Last Node
1012(5)
Header File of the Unordered Linked List
1017(1)
Ordered Linked Lists
1018(12)
Search the List
1020(1)
Insert a Node
1020(5)
Insert First and Insert Last
1025(1)
Delete a Node
1026(1)
Header File of the Ordered Linked List
1027(3)
Print a Linked List in Reverse Order (Recursion Revisited)
1030(3)
printListReverse
1032(1)
Doubly Linked Lists
1033(11)
Default Constructor
1036(1)
isEmptyList
1036(1)
Destroy the List
1036(1)
Initialize the List
1037(1)
Length of the List
1037(1)
Print the List
1037(1)
Reverse Print the List
1037(1)
Search the List
1038(1)
First and Last Elements
1038(6)
Circular Linked Lists
1044(1)
Programming Example: Video Store
1045(19)
Quick Review
1064(1)
Exercises
1065(4)
Programming Exercises
1069(6)
Stacks and Queues
1075(108)
Stacks
1076(4)
Stack Operations
1078(2)
Implementation of Stacks as Arrays
1080(14)
Initialize Stack
1083(1)
Empty Stack
1084(1)
Full Stack
1084(1)
Push
1084(2)
Return the Top Element
1086(1)
Pop
1086(2)
Copy Stack
1088(1)
Constructor and Destructor
1088(1)
Copy Constructor
1089(1)
Overloading the Assignment Operator (=)
1089(1)
Stack Header File
1090(4)
Programming Example: Highest GPA
1094(4)
Linked Implementation of Stacks
1098(14)
Default Constructor
1101(1)
Empty Stack and Full Stack
1102(1)
Initialize Stack
1102(1)
Push
1103(2)
Return the Top Element
1105(1)
Pop
1105(2)
Copy Stack
1107(1)
Constructors and Destructors
1108(1)
Overloading the Assignment Operator (=)
1108(2)
Stack as Derived from the class unorderedLinkedList
1110(2)
Application of Stacks: Postfix Expressions Calculator
1112(12)
Main Algorithm
1117(1)
Function evaluateExpression
1117(2)
Function evaluateOpr
1119(2)
Function discardExp
1121(1)
Function printResult
1121(3)
Removing Recursion: Nonrecursive Algorithm to Print a Linked List Backward
1124(7)
Queues
1131(19)
Queue Operations
1131(2)
Implementation of Queues as Arrays
1133(11)
Linked Implementation of Queues
1144(5)
Queue Derived from the class unorderedLinkedListType
1149(1)
Application of Queues: Simulation
1150(20)
Designing a Queuing System
1151(1)
Customer
1152(3)
Server
1155(3)
Server List
1158(5)
Waiting Customers Queue
1163(2)
Main Program
1165(5)
Quick Review
1170(1)
Exercises
1171(6)
Programming Exercises
1177(6)
Searching and Sorting Algorithms
1183(90)
Searching and Sorting Algorithms
1184(1)
Search Algorithms
1184(11)
Sequential Search
1185(2)
Binary Search
1187(5)
Performance of Binary Search
1192(3)
Binary Search Algorithm and the class orderedArrayListType
1195(1)
Asymptotic Notation: Big-O Notation
1195(9)
Lower Bound on Comparison-Based Search Algorithms
1204(1)
Sorting Algorithms
1204(1)
Sorting a List: Bubble Sort
1205(6)
Analysis: Bubble Sort
1209(1)
Bubble Sort Algorithm and the class unorderedArrayListType
1210(1)
Selection Sort: Array-Based Lists
1211(4)
Analysis: Selection Sort
1215(1)
Insertion Sort: Array-Based Lists
1215(8)
Analysis: Insertion Sort
1222(1)
Lower Bound on Comparison-Based Sort Algorithms
1223(1)
Quick Sort: Array-Based Lists
1224(8)
Analysis: Quick Sort
1231(1)
Merge Sort: Linked List-Based Lists
1232(10)
Divide
1234(2)
Merge
1236(4)
Analysis: Merge Sort
1240(2)
Programming Example: Election Results
1242(22)
Quick Review
1264(1)
Exercises
1265(3)
Programming Exercises
1268(5)
Binary Trees
1273(60)
Binary Trees
1274(12)
Copy Tree
1281(1)
Binary Tree Traversal
1282(4)
Implementing Binary Trees
1286(9)
Binary Search Trees
1295(15)
Binary Search Tree: Analysis
1309(1)
Nonrecursive Binary Tree Traversal Algorithms
1310(4)
Nonrecursive Inorder Traversal
1310(2)
Nonrecursive Preorder Traversal
1312(1)
Nonrecursive Postorder Traversal
1313(1)
Binary Tree Traversal and Functions as Parameters
1314(4)
Programming Example: Video Store (Revisited)
1318(9)
Quick Review
1327(1)
Exercises
1328(3)
Programming Exercises
1331(2)
Graphs
1333(40)
Introduction
1334(1)
Graph Definitions and Notations
1335(3)
Graph Representation
1338(2)
Adjacency Matrix
1338(1)
Adjacency Lists
1339(1)
Operations on Graphs
1340(1)
Graphs as ADTs
1341(4)
Graph Traversals
1345(4)
Depth First Traversal
1345(2)
Breadth First Traversal
1347(2)
Shortest Path Algorithm
1349(8)
Shortest Path
1351(6)
Minimal Spanning Tree
1357(10)
Quick Review
1367(2)
Exercises
1369(2)
Programming Exercises
1371(2)
Standard Template Library (STL)
1373(116)
Components of the STL
1374(28)
Container Types
1375(1)
Sequence Containers
1375(1)
Sequence Container: vector
1375(9)
Member Functions Common to All Containers
1384(2)
Member Functions Common to Sequence Containers
1386(1)
The copy Algorithm
1387(4)
Sequence Container: deque
1391(4)
Sequence Container: list
1395(7)
Iterators
1402(6)
Types of Iterators
1402(6)
Stream Iterators
1408(1)
Associative Containers
1408(7)
Associative Containers: set and multiset
1409(1)
Declaring set or multiset Associative Containers
1409(2)
Item Insertion and Deletion from set/multiset
1411(4)
Container Adapters
1415(3)
Stack
1415(2)
Queue
1417(1)
Containers, Associated Header Files, and Iterator Support
1418(1)
Algorithms
1419(61)
STL Algorithm Classification
1420(2)
Function Objects
1422(6)
Insert Iterator
1428(2)
STL Algorithms
1430(1)
The Functions fill and fill_n
1430(2)
The Functions generate and generate_n
1432(2)
The Functions find, find_if, find_end, and find_first_of
1434(5)
The Functions remove, remove_if, remove_copy, and remove_copy_if
1439(3)
The Functions replace, replace_if, replace_copy, and replace_copy_if
1442(4)
The Functions swap, iter_swap, and swap_ranges
1446(3)
The Functions search, search_n, sort, and binary_search
1449(4)
The Functions adjacent_find, merge, and inplace_merge
1453(4)
The Functions reverse, reverse_copy, rotate, and rotate_copy
1457(3)
The Functions count, count_if, max, max_element, min, min_element, and random_shuffle
1460(4)
The Functions for_each and transform
1464(3)
The Functions includes, set_intersection, set_union, set_difference, and set_symmetric_difference
1467(8)
The Functions accumulate, adjacent_difference, inner_product, and partial_sum
1475(5)
Quick Review
1480(4)
Exercises
1484(2)
Programming Exercises
1486(3)
APPENDIX A: RESERVED WORDS
1489(2)
APPENDIX B: OPERATOR PRECEDENCE
1491(2)
APPENDIX C: CHARACTER SETS
1493(4)
ASCII (American Standard Code for Information Interchange)
1493(1)
EBCDIC (Extended Binary Coded Decimal Interchange Code)
1494(3)
APPENDIX D: OPERATOR OVERLOADING
1497(2)
APPENDIX E: ADDITIONAL C++ TOPICS
1499(20)
Binary (Base 2) Representation of a Non-Negative Integer
1499(3)
Converting a Base 10 Number to a Binary Number (Base 2)
1499(2)
Converting a Binary Number (Base 2) to Base 10
1501(1)
More on File Input/Output
1502(17)
Binary Files
1502(6)
Random File Access
1508(11)
APPENDIX F: HEADER FILES
1519(10)
Header File cassert (assert . h)
1519(1)
Header File cctype (ctype . h)
1520(1)
Header File cfloat (float.h)
1521(1)
Header File climits (limits . h)
1522(2)
Header File cmath (math. h)
1524(5)
Header File cstddef (stddef . h)
1525(1)
Header File cstring (string . h)
1525(4)
APPENDIX G: MEMORY SIZE ON A SYSTEM AND RANDOM NUMBER GENERATOR
1529(2)
Random Number Generator
1530(1)
APPENDIX H: REFERENCES
1531(2)
APPENDIX I: ANSWERS TO ODD NUMBERED EXERCISES
1533(26)
Chapter 1
1533(2)
Chapter 2
1535(2)
Chapter 3
1537(1)
Chapter 4
1538(1)
Chapter 5
1539(1)
Chapter 6
1540(1)
Chapter 7
1541(1)
Chapter 8
1542(1)
Chapter 9
1542(1)
Chapter 10
1543(1)
Chapter 11
1544(2)
Chapter 12
1546(1)
Chapter 13
1547(1)
Chapter 14
1548(1)
Chapter 15
1549(1)
Chapter 16
1550(1)
Chapter 17
1551(1)
Chapter 18
1551(2)
Chapter 19
1553(2)
Chapter 20
1555(2)
Chapter 21
1557(1)
Chapter 22
1558(1)
Index 1559

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program