About the Book
This book is designed to teach beginning
C++ to those who are not necessarily going to work in a technical discipline
where a strong math background is needed. To that end, C++ Coach: Essentials
for Introductory Programming is ideal for students in the Information Systems
or Business areas who will use programming for information acquisition
and processing rather than high-level computations.
The text is thoughtfully divided into
three sections. The first section provides a basic understanding of programming
constructs such as variables, operators, conditional statements, loops,
and functions. The second section concentrates on introducing additional
features of C++ such as arrays, structures, classes, pointers, and files.
The third section of the book describes the benefits and implementations
of some simple C++ data structures, helping students appreciate the issues
of performance that they'll see when dealing with real-world problems.
The approach of this book is to focus
more on C++ syntax than on the large number of C++ language constructs,
and teaches the student through extensive practice and "skill and drill"
type exercises. As the basic building blocks of the C++ language are presented,
students repeatedly practice with programming drills until they understand
both the fundamentals and subtleties of the C++ language. These programming
drills are supplemented with a variety of real world examples of programming
problems that build upon the knowledge gained from the drills.
Features
-
Provides a solid introduction to C++ syntax
for students who aren't necessarily going to be “hardcore” computer programmers.
-
Case studies in each chapter based on a real-world
payroll problem.
-
Develops students' proficiency with C++ fundamentals
with a series of repetitive "skill and drill" exercises.
-
Enhances the fundamental skills with numerous
real-world example problems.
Related
Books
Introduction to Computer Programming Courses
(Intro
to Computer Programming)
Table of Contents
I. FUNDAMENTALS.
1. Introduction.
What is a Programming Language?
Earliest Computer Languages.
Early Attempts at New Languages.
Next Generation Languages.
Object Oriented Languages.
Basic Algorithms.
2. Fundamental C++ Programming.
Our First Program.
Simple Operators.
Variables.
Comments.
Simple Input.
Constants.
Types of Errors.
Characters.
Type Conversions.
Complex Operators.
Order of Precedence Chart.
Case Study.
3. Conditional Statements.
If Statements.
Else and Else If Statements.
Compound Conditional Statements.
Nested Conditional Statements.
Subtle Expression Evaluation.
Short Circuit Conditional Evaluation.
Switch Statements.
Bool Data Type.
Case Study.
4. Loops.
For Loops.
While Loops.
Do Loops.
Nested Loops.
Early Loop Termination - Break and
Continue Keywords.
Case Study.
5. Functions.
Defining a Function.
Parameters and Return Values.
Local Variables.
Scope.
Extending the Language.
Pass By Reference.
Decision-Making Functions.
Case Study.
II. ADVANCED CONSTRUCTS.
6. Simple Arrays.
Declaring an Array.
Array Shortcuts.
Character Arrays.
Multidimensional Arrays.
Multidimensional Arrays of Characters.
Case Study.
7. Simple Arrays Applications.
String Functions.
Linear Search.
Bubble Sort.
Insertion Sort.
Files.
Case Study.
8. Advanced Application of Arrays.
Recursive Functions.
Binary Search.
Quick Sort.
Case Study.
9. Pointers.
Pointers - Why Do We Need Them?
Declaring Pointers.
Arrays as Pointers.
String Functions Rewritten as Pointers.
Dynamic Memory and Pointers.
Deleting Memory.
Case Study.
10. Structures and Basic Classes.
Defining a Structure.
Arrays of Structures.
Concepts of a Class.
Defining a Class.
Case Study.
11. More on Classes.
Other Benefits of Classes.
Dynamic Memory and Classes.
Vector Class.
String Class.
Code Reuse via Composition and Inheritance.
Case Study.
III. DATA STRUCTURES.
12. Stacks.
Why Do We Need Stacks?
How Does a Stack Operate?
Stack Class Implementation.
Case Study.
13. Queues.
Why Do We Need Queues?
How Does a Queue Operate?
Queue Class Implementation.
Case Studies.
14. Linked Lists.
What is a Linked List?
Linked List Class Implementation.
Header Node Linked List Implementation.
Case Study.
15. TREES.
What is a Binary Search Tree?
Binary Tree Class Implementation.
Case Study.
16. Hash Tables.
What Is a Hash Table?
How Does a Hash Table Operate?
Hash Table Class Implementation.
Case Study.
Appendix A. Quality Programming.
Appendix B.ASCII Character Set.
Appendix C. Commonly Used C++ Input/Output
Techniques.
Bibliography.
Index. |
