2016 Computer professional Postgraduate examination: C + + University Tutorial Second Edition directory (top)

2016 Computer professional Postgraduate examination: C + + University Tutorial Second Edition catalogue, this article is the upper part, the review of specialized courses, reading is very important:

• • Chapter 1th Introduction to Computer and C + + programming
    • 1.1 Introduction
    • 1.2 What is a computer
    • 1.3 Computer composition
    • 1.4 Changes of the operating system
    • 1.5 Human computing, distributed computing and client/server computing
    • 1.6 Machine language, assembly language and high-level languages
    • 1.7 C language and the history of C + +
    • 1.8 C + + standard library
    • 1.9 Java, the Internet, and the World Wide Web
    • 1.10 Other high-level languages
    • 1.11 Structured programming
    • 1.12 Typical C + + environmental Fundamentals
    • 1.13 C + + and the general description of this book
    • Introduction to 1.14 C + + programming
    • 1.15 Simple Programs
    • 1.16 Simple program: two integers added
    • 1.17 Concept of memory
    • 1.18 Arithmetic operations
    • 1.19 Judgment: Equality and relational operators
    • 1.20 New header files and namespaces
    • 1.21 thinking about the object
    • Summary
    • Terms
    • Self-Test exercise
    • Self-Test exercise answers
    • Practice
    2nd Chapter Control Structure
    • 2.1 Introduction
    • 2.2 Algorithm
    • 2.3 Pseudo-code
    • 2.4 Control Structure
    • 2.5 If selection structure
    • 2.6 If/else Selection Structure
    • 2.7 While repeating structure
    • 2.8 Construction Algorithm: Case Study 1 (counter control repetition)
    • 2.9 Construction algorithm and progressive improvement from top to bottom: Case Study 2 (tag control repetition)
    • 2.10 Construction algorithm and gradual improvement from top to bottom: Case Study 3 (nested control structure)
    • 2. 11 Assignment operators
    • 2.12 Self-increment and decrement operators
    • 2.13 Key points of the counter control loop
    • 2.14 for repeating structure
    • 2.15 For Structure Use example
    • 2.16 Switch Multiple selection structure
    • 2.17 Do/while Repeating structure
    • 2.18 Break and Continue statements
    • 2.19 logical operators
    • 2.20 confusing equality (= =) with assignment (=) operator
    • 2.21 Summary of Structured programming
    • 2.22 thinking about objects: identifying objects in a problem
    • Summary
    • Terms
    • Self-Test exercise
    • Self-Test exercise answers
    • Practice
    Chapter III Functions
    • 3.1 Introduction
    • 3.2 C + + program components
    • 3.3 Library of Mathematical functions
    • 3.4 Functions
    • 3.5 Function definitions
    • 3.6 Function prototypes
    • 3.7 Header Files
    • 3.8 Random Number generator
    • 3.9 Case: Introduction to Opportunity games and enums
    • 3.10 Storage Classes
    • 3.11 Scope Rules
    • 3.12 Recursion
    • 3.13 Using recursive examples, Fibonacci series
    • 3. 14 Recursion and iteration
    • 3.15 functions with empty parameter tables
    • 3.16 inline functions
    • 3.17 References and reference parameters
    • 3.18 Default Parameters
    • 3.19 Unary scope operators
    • 3.20 function Overloading
    • 3.21 Function Templates
    • 3.22 thinking about objects: determining object Properties
    • Summary
    • Terms
    • Self-Test exercise
    • Self-Test exercise answers
    • Practice
    Fourth Chapter Array
    • 4. 1 Introduction
    • 4. 2 arrays
    • 4. 3 declaring an array
    • 4. 4 Examples of using arrays
    • 4. 5 passing an array to a letter
    • 4. 6 Sorting arrays
    • 4. 7 Example study: Calculating average, median, and modulus with an array
    • 4.8 Finding arrays: linear lookups and binary lookups
    • 4.9 Multiple subscript arrays
    • 4.10 Thinking about objects: Determining the behavior of a class
    • Summary
    • Terms
    • Self-Test exercise
    • Self-Test exercise answers
    • Practice
    The 5th Chapter _ Pointers and strings
    • 5. 1 Introduction
    • 5. 2 Declaration and initialization of pointer variables
    • 5. 3 pointer operator
    • 5. 4 calling functions by reference
    • 5. 5 pointers and Constant qualifiers
    • 5. 6 bubbling Sort by reference call
    • 5. 7 pointer expression and pointer algorithm
    • 5. 8 The relationship of pointers to arrays
    • 5. 9 pointer Array
    • 5. 10 Case Study: Shuffle and licensing
    • 5. 11 Function pointers
    • 5. Introduction to 12 character and string processing
    • 5. 13 Thinking about objects: interaction between objects
    • Summary
    • Self-Test exercise
    • Self-Test exercise answers
    • Practice
    The 6th Chapter _ Class and Data abstraction (I.)
    • 6. 1 Introduction
    • 6. 2 Structure definition
    • 6. 3 Accessing struct members
    • 6. 4 Implementing user-defined types with structs time
    • 6. 5 using classes to implement time abstract data types
    • 6. 6 Class scope and Access class members
    • 6.7 Separation of interface and implementation method
    • 6. 9 Access functions and tool functions
    • 6. 10 Initializing class objects: constructors
    • 6. 11 using default parameters in constructors
    • 6. 12 Using Destructors
    • 6.13 when constructors and destructors are called
    • 6. 14 using data members and member functions
    • 6. 15 Subtle traps: return a reference to private data members
    • 6. 16 assignment By default member replication
    • 6. 17 Software reusability
    • 6. 18 Thinking about the object: writing the elevator simulation program
    • Summary
    • Terms
    • Self-Test exercise
    • Self-Test exercise answers
    • Practice
    The 7th Chapter _ Class and Data abstraction (II.)
    • 7. 1 Introduction
    • 7. 2 const (constant) objects and const member functions
    • 7. 3 Compounding: Taking an object as a class member
    • 7. 4 friend function and friend class
    • 7. 5 using the This pointer
    • 7. 6 dynamic memory allocation with the new and delete operators
    • 7. 7 Static Class members
    • 7. 8 data abstraction and information hiding
    • 7. 9 Container classes and iterations
    • 7.10 Proxy Classes
    • 7. 11 Thinking about objects: using composite and dynamic object management in elevator simulation programs
    • Summary
    • Terms
    • Self-Test exercise
    • Self-Test exercise answers
    • Practice
    • Read MORE:

    • English listening http://www.kyjxy.com/fushi/zhinan/of postgraduate examination
      Graduate Examination of Mathematics review plan http://www.kyjxy.com/shuxue/ziliao/
      Special-Shuo http://www.kyjxy.com/zhuanshuo/

2016 Computer professional Postgraduate examination: C + + University Tutorial Second Edition directory (top)