TY - BOOK AU - Hennefeld, Julien. AU - Baker, Laura AU - Burchard, Charles TI - Using C++: an introduction to programming SN - 9780534391461 U1 - 005.133 22 PY - 2003/// CY - Australia PB - The wadsworth group KW - Computer programming KW - Computer applications N1 - Table of content Chapter 1 Overview of computers and problem solving 1.1 Computer and computer science 1.2 A brief history of computing device 1.3 Physical components: Hardware 1.4 Writing programs: A first view 1.5 Writing programs: A broader view etc. Chapter 2 Introduction to C++ 2.1 A first program 2.2 Punctuation and style 2.3 Memory cells and more on assignment 2.4 Interactive programs 2.5 Using text files to print output on paper 2.6 A first look at syntax error Chapter 3 More on elements of C++ 3.1 Integer data types and wraparound 3.2 The float and double data types 3.3 More on numerical operators 3.4 Arithmetical assignment operators as abbreviations 3.5 Named constants etc. Chapter 4 Selection using if AND if ... else 4.1 One way selection 4.2 Selection from alternative using if ..else 4.3 The logical operators: &&(AND),// (OR,) (NOT) 4.4 Linear multiway selection using a nestet if statement etc. Chapter 5 Function and program design 5.1 Some predefined functions the library file cmath 5.2 Writing valve-returning functions 5.3 Program function with valve-returning functions 5.4 Void functions and program design 5.5 Function calling other functions etc. Chapter 6 The string DATA type and more output formatting 6.1 A first look at string variables 6.2 Numerical output in a table form 6.3 Table with strings in the first column 6.4 cin and cout are streams 6.5 Reading strings with embedded white space 6.6 A program design involving strings Chapter 7 The three C++ looping constructs 7.1 Some preliminaries 7.2 While loops and fixed-step lists 7.3 for loops and fix-step list of data values 7.4 More loops to input groups of data 7.5 More design for loops etc. Chapter 8 More general task -controlled loops 8.1 Examples and guidelines 8.2 Using do...while loops to trap input errors 8.3 Multiple reasons for loop exit 8.4 Mid-loop exit using the break statements etc. Chapter 9 Functions with reference parameters 9.1 Reference parameters and data input functions 9.2 Incrementing a variable with a function call 9.3 More general variable updating by using function call 9.4 Global constants 9.5 Hand tracing etc. Chapter 10 More on functions 10.1 Documenting parameters : IN, OUT, or IN-OUT 10.2 Structure charts 10.3 Overloaded functions 10.4 Function with default arguments 10.5 Function templates etc. Chapter 11 Text files and streams 11.1 Creating a text file 11.2 Stream variables are are objects 11.3 Input from a file streams: The header technique 11.4 Input from a file: The end of a file technique etc. Chapter 12 The switch AND enum Stataments 12.1 switch statement syntax 12.2 switch and Menu-driven programs 12.3 The enum statement Chapter 13 Arrays and the vector class 13.1 Arrays 13.2 Short coming of arrays 13.3 Vectors 13.4 Vectors of counting variables 13.5 Parallel variables etc. Chapter 14 Searching and sorting 14.1 Linear search 14.2 Binary search of a sorted vector 14.3 Selection sort 14.4 Bubble sort 14.5 Inserting into a sorted vector etc. Chapter 15 Matrices 15.1 The matrix class 15.2 Program design with matrix and parallel vectors 15.3 Doing matrix using the build in array type 15.4 Mathematical operations on matrices for students familiar with matrix algebra Chapter 16 More advanced string processing 16.1 Accessing individual characters 16.2 Some applications 16.3 Automatic resizing and concatenation 16.4 String search 16.5 Manipulating substrings etc. Chapter 17 Structs 17.1 The basic structs 17.2 Vectors of structs 17.3 Contained structs 17.4 Danger of liberal access to a struct's data 17.5 Overloading the +, >>, and << operators for fractions Chapter 18 Using C++ Classes 18.1 Information hiding, Public interface, and electronic device 18.2 Using time class 18.3 An improved time class with accessor functions 18.4 Using inlist class and a constructor 18.5 Using fractional class: More constructors 18.6 A new class: Big-UIam Chapter 19 Implementing and modifying a class 19.1 Packaging a class 19.2 Defining a member function of the first time class 19.3 Defining accessor functions and improving the time clas 19.4 Implementing the inlist class etc. Chapter 20 More classes for practice and application 20.1 A phone entry class 20.2 A playing card class 20.3 A checking accounting class 20.4 Description of additional classes for exercise Chapter 21 Class template 21.1 Creating a class template 21.2 List: A templated in list class 21.3 Improving list by adding new member function 21.4 A phone -entry list 21.5 Application: Looking up phone extension Chapter 22 Pointers and an implementation of simplified vector class 22.1 Pointer variables 22.2 The & operator 22.3 The this pointer and the assignment operator 22.4 Arrays and pointers 22.5 A simple vector class 22.6 The copy instructor and destructor Chapter 23 Linked lists 23.1 Introduction to linked lists 23.2 Pointer to structs and classes 23.3 Creating a linked list 23.4 Traversing a linked list etc. Chapter 24 Stacks and Queues 24.1 Behavior of stacks and Queues 24.2 Using a stack class 24.3 Stack and postfix expressions 24.4 Using a queue class etc. Chapter 25 Recursive function 25.1 Writing and tracing a recursive function 25.2 Guideline for writing recursive function 25.3 Recursion and vectors 25.4 Recursion and stacks etc. Chapter 26 Advanced sorting and efficiency of algorithms 26.1 Efficiency of sorting algorithm 26.2 Efficiency of searching algorithm 26.3 A step-counting experiment 26.4 Quicksort Chapter 27 Inheritance 27.1 Introduction to Inheritance 27.2 A better time class by Inheritance 27.3 The protected access specification 27.4 Another descendants of the time class 27.5 An ordintlist class ; Index : p. 655-670 ER -