Revel for Introduction to C++ Programming and Data Structures -- Access Card
Pearson (Hersteller)
978-0-13-466985-4 (ISBN)
A fundamentals first approach to programming helps students create efficient, elegant code
RevelTM Introduction to Programming with C++ introduces students to basic programming concepts using a fundamentals-first approach that prepares them for learning object-oriented and advanced C++ programming. This approach presents programming concepts and techniques that include control statements, loops, functions, and arrays before discussing object-oriented programming. Students learn to approach programming as a method for problem solving with interesting and practical examples that illustrate syntax. The content incorporates a wide variety of problems with various levels of difficulty and covers many application areas to engage and motivate students.
Revel is Pearson’s newest way of delivering our respected content. Fully digital and highly engaging, Revel replaces the textbook and gives students everything they need for the course. Informed by extensive research on how people read, think, and learn, Revel is an interactive learning environment that enables students to read, practice, and study in one continuous experience – for less than the cost of a traditional textbook.
NOTE: Revel is a fully digital delivery of Pearson content. This ISBN is for the standalone Revel access card. In addition to this access card, you will need a course invite link, provided by your instructor, to register for and use Revel.
Dr. Daniel Liang earned his Ph.D. in Computer Science from the University of Oklahoma in 1991, and his M.S. and B.S. in Computer Science from Fudan University in Shanghai, China in 1986 and 1983. Prior to joining Armstrong State University (now merged with Georgia Southern University), he was an Associate Professor in computer science at Purdue University in Fort Wayne, Indiana, where he twice received the Excellence in Research award. Dr. Liang is currently a Professor of Computer Science at Georgia Southern University and has given lectures on programming internationally. He was trained in theoretical computer science. He has published in the SIAM Journal on Computing, Discrete Applied Mathematics, Acta Informatics, and Information Processing Letters. He is the author of more than thirty books and his popular computer science texts are widely used throughout the world.
1: Introduction to Computers, Programs, and C++
1: Objectives
1.1: Introduction
1.2: What Is a Computer?
1.3: Programming Languages
1.4: Operating Systems
1.5: History of C++
1.6: A Simple C++ Program
1.7: C++ Program-Development Cycle
1.8: Programming Style and Documentation
1.9: Programming Errors
Key Terms: Chapter 1
Chapter Summary: Chapter 1
Programming Exercises From the Book: Chapter 1
2: Elementary Programming
2: Objectives
2.1: Introduction
2.2: Writing a Simple Program
2.3: Reading Input from the Keyboard
2.4: Identifiers
2.5: Variables
2.6: Assignment Statements and Assignment Expressions
2.7: Named Constants
2.8: Numeric Data Types and Operations
2.9: Evaluating Expressions and Operator Precedence
2.10: Case Study: Displaying the Current Time
2.11: Augmented Assignment Operators
2.12: Increment and Decrement Operators
2.13: Numeric Type Conversions
2.14: Software Development Process
2.15: Case Study: Counting Monetary Units
2.16: Common Errors
Key Terms: Chapter 2
Chapter Summary: Chapter 2
Programming Exercises From the Book: Chapter 2
3: Selections
3: Objectives
3.1: Introduction
3.2: The bool Data Type
3.3: if Statements
3.4: Two-Way if-else Statements
3.5: Nested if and Multi-Way if-else Statements
3.6: Common Errors and Pitfalls
3.7: Case Study: Computing Body Mass Index
3.8: Case Study: Computing Taxes
3.9: Generating Random Numbers
3.10: Logical Operators
3.11: Case Study: Determining Leap Year
3.12: Case Study: Lottery
3.13: switch Statements
3.14: Conditional Operators
3.15: Operator Precedence and Associativity
3.16: Debugging
Key Terms: Chapter 3
Chapter Summary: Chapter 3
Programming Exercises From the Book: Chapter 3
4: Mathematical Functions, Characters, and Strings
4: Objectives
4.1: Introduction
4.2: Mathematical Functions
4.3: Character Data Type and Operations
4.4: Case Study: Generating Random Characters
4.5: Case Study: Guessing Birthdays
4.6: Character Functions
4.7: Case Study: Converting a Hexadecimal Digit to a Decimal Value
4.8: The string Type
4.9: Case Study: Revising the Lottery Program Using Strings
4.10: Formatting Console Output
4.11: Simple File Input and Output
Key Terms: Chapter 4
Chapter Summary: Chapter 4
Programming Exercises From the Book: Chapter 4
5: Loops
5: Objectives
5.1: Introduction
5.2: The while Loop
5.3: Case Study: Guessing Numbers
5.4: Loop Design Strategies
5.5: Controlling a Loop with User Confirmation
5.6: Input and Output Redirections and Read All Data from a File
5.7: The do-while Loop
5.8: The for Loop
5.9: Which Loop to Use?
5.10: Nested Loops
5.11: Minimizing Numeric Errors
5.12: Case Studies
5.13: Keywords break and continue
5.14: Case Study: Checking Palindromes
5.15: Case Study: Displaying Prime Numbers
Key Terms: Chapter 5
Chapter Summary: Chapter 5
Programming Exercises From the Book: Chapter 5
6: Functions
6: Objectives
6.1: Introduction
6.2: Defining a Function
6.3: Calling a Function
6.4: void Functions
6.5: Passing Arguments by Value
6.6: Modularizing Code
6.7: Overloading Functions
6.8: Function Prototypes
6.9: Default Arguments
6.10: Inline Functions
6.11: Local, Global, and Static Local Variables
6.12: Passing Arguments by Reference
6.13: Constant Reference Parameters
6.14: Case Study: Converting Hexadecimals to Decimals
6.15: Function Abstraction and Stepwise Refinement
Key Terms: Chapter 6
Chapter Summary: Chapter 6
Programming Exercises From the Book: Chapter 6
7: Single-Dimensional Arrays and C-Strings
7: Objectives
7.1: Introduction
7.2: Array Basics
7.3: Case Study: Analyzing Numbers
7.4: Case Study: Deck of Cards
7.5: Passing Arrays to Functions
7.6: Preventing Changes of Array Arguments in Functions
7.7: Returning Arrays from Functions
7.8: Case Study: Counting the Occurrences of Each Letter
7.9: Searching Arrays
7.10: Sorting Arrays
7.11: C-Strings
7.12: Converting Numbers to Strings
Key Terms: Chapter 7
Chapter Summary: Chapter 7
Programming Exercises From the Book: Chapter 7
8: Multidimensional Arrays
8: Objectives
8.1: Introduction
8.2: Declaring Two-Dimensional Arrays
8.3: Processing Two-Dimensional Arrays
8.4: Passing Two-Dimensional Arrays to Functions
8.5: Case Study: Grading a Multiple-Choice Test
8.6: Case Study: Finding a Closest Pair
8.7: Case Study: Sudoku
8.8: Multidimensional Arrays
Key Terms: Chapter 8
Chapter Summary: Chapter 8
Programming Exercises From the Book: Chapter 8
9: Objects and Classes
9: Objectives
9.1: Introduction
9.2: Defining Classes for Objects
9.3: Example: Defining Classes and Creating Objects
9.4: Constructors
9.5: Constructing and Using Objects
9.6: Separating Class Definition from Implementation
9.7: Preventing Multiple Inclusions
9.8: Inline Functions in Classes
9.9: Data Field Encapsulation
9.10: The Scope of Variables
9.11: Class Abstraction and Encapsulation
Key Terms: Chapter 9
Chapter Summary: Chapter 9
Programming Exercises From the Book: Chapter 9
10: Object-Oriented Thinking
10: Objectives
10.1: Introduction
10.2: The string Class
10.3: Passing Objects to Functions
10.4: Array of Objects
10.5: Instance and Static Members
10.6: Constant Member Functions
10.7: Thinking in Objects
10.8: Class Relationships
10.9: Case Study: The StackOfIntegers Class
10.10: Constructor Initializer Lists
10.11: Class Design Guidelines
Key Terms: Chapter 10
Chapter Summary: Chapter 10
Programming Exercises From the Book: Chapter 10
11: Pointers and Dynamic Memory Management
11: Objectives
11.1: Introduction
11.2: Pointer Basics
11.3: Defining Synonymous Types Using the typedef Keyword
11.4: Using const with Pointers
11.5: Arrays and Pointers
11.6: Passing Pointer Arguments in a Function Call
11.7: Returning a Pointer from Functions
11.8: Useful Array Functions
11.9: Dynamic Persistent Memory Allocation
11.10: Creating and Accessing Dynamic Objects
11.11: The this Pointer
11.12: Destructors
11.13: Case Study: The Course Class
11.14: Copy Constructors
11.15: Customizing Copy Constructors
Key Terms: Chapter 11
Chapter Summary: Chapter 11
Chapter 11 Programming Project
Programming Exercises From the Book: Chapter 11
12: Templates, Vectors, and Stacks
12: Objectives
12.1: Introduction
12.2: Templates Basics
12.3: Example: A Generic Sort
12.4: Class Templates
12.5: Improving the Stack Class
12.6: The C++ vector Class
12.7: Insertion and Deletion and Other Functions for a Vector
12.8: Replacing Arrays Using the vector Class
12.9: Case Study: Evaluating Expressions
12.10: Using Smart Pointers for Automatic Object Destruction
Key Terms: Chapter 12
Chapter Summary: Chapter 12
Programming Exercises From the Book: Chapter 12
13: File Input and Output
13: Objectives
13.1: Introduction
13.2: Text I/O
13.3: Formatting Output
13.4: Functions: getline, get, and put
13.5: fstream and File Open Modes
13.6: Testing Stream States
13.7: Binary I/O
13.8: Random Access File
13.9: Updating Files
Key Terms: Chapter 13
Chapter Summary: Chapter 13
Programming Exercises From the Book: Chapter 13
14: Operator Overloading
14: Objectives
14.1: Introduction
14.2: The Rational Class
14.3: Operator Functions
14.4: Overloading the Subscript Operator []
14.5: Overloading Augmented Assignment Operators
14.6: Overloading the Unary Operators
14.7: Overloading the ++ and —— Operators
14.8: friend Functions and friend Classes
14.9: Overloading the << and >> Operators
14.10: Automatic Type Conversions
14.11: Defining Nonmember Functions for Overloading Operators
14.12: The Rational Class with Overloaded Function Operators
14.13: Overloading the = Operators
Key Terms: Chapter 14
Chapter Summary: Chapter 14
Chapter 14 Programming Project
Programming Exercises From the Book: Chapter 14
15: Inheritance and Polymorphism
15: Objectives
15.1: Introduction
15.2: Base Classes and Derived Classes
15.3: Generic Programming
15.4: Constructors and Destructors
15.5: Redefining Functions
15.6: Polymorphism
15.7: Virtual Functions and Dynamic Binding
15.8: The C+11 override and final Keywords
15.9: The protected Keyword
15.10: Abstract Classes and Pure Virtual Functions
15.11: Casting: static_cast versus dynamic_cast
Key Terms: Chapter 15
Chapter Summary: Chapter 15
Chapter 15: Programing Project
Programming Exercises From the Book: Chapter 15
16: Exception Handling
16: Objectives
16.1: Introduction
16.2: Exception-Handling Overview
16.3: Exception Classes
16.4: Custom Exception Classes
16.5: Multiple Catches
16.6: Exception Propagation
16.7: Rethrowin
| Sprache | englisch |
|---|---|
| Maße | 216 x 279 mm |
| Gewicht | 14 g |
| Themenwelt | Informatik ► Programmiersprachen / -werkzeuge ► C / C++ |
| Sozialwissenschaften ► Pädagogik | |
| ISBN-10 | 0-13-466985-1 / 0134669851 |
| ISBN-13 | 978-0-13-466985-4 / 9780134669854 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
