|
Provided by: 123-CBT Computer Based Training Advanced C Programming Set of 6 |
 |
Level 1
- 1.0 C++ Exceptions
- 1.1 C++ Exception Handling Model
- 1.2 C++ Handling Syntax
- 1.3 Standard C++ Exception Classes
- 1.4 C++ Exception: Summary & Exercises
- 2.0 Templates
- 2.1 Templates & the Standard Template Library
- 2.2 Template Classes
- 2.3 C++ Template Functions
- 2.4 Member Function Templates
- 2.5 Default Template Parameters
- 2.6 Template Performance Issues
- 2.7 C++ Template: Summary & Exercises
- 1.0 Standard Template Library
- 1.1 STL Major Components
- 1.2 Section Objectives - What You Need to Know
- 1.3 STL & How It Fits
- 1.4 Generic Programming
- 1.5 Using the STL
- 1.6 STL Concepts
- 1.7 STL Containers
- 1.8 Integrators
- 1.9 Iterator Categories
- 1.10 STL: Summary & Exercises
- 1.0 Function Objects & Adapters
- 1.1 Function Objects
- 1.2 Adapters
- 1.3 Function Objects & Adapters:
- Summary & Exercises
- 2.0 STL Generic Algorithms
- 2.1 STL Algorithm Categories
- 2.2 STL Non- Mutating Algorithms
- 2.3 Non- Mutating Algorithms: adjacent_ find Algorithm
- 2.4 Non-Mutating Algorithms: count & count_ if Algorithm
- 2.5 Non-Mutating Algorithms: for_ each Algorithm
- 2.6 Non-Mutating Algorithms: equal Algorithm
- 2.7 Non-Mutating Algorithms: mismatch Algorithm
- 2.8 Non-Mutating Algorithms: search Algorithm
- 2.9 Non-Mutating Algorithms: Summary & Exercises
- 1.0 STL Mutating Generic Algorithms
- 1.1 STL Mutating Algorithms: copy * copy_ backward
- 1.2 STL Mutating Algorithms: fill & fill_ n
- 1.3 STL Mutating Algorithms: generate
- 1.4 STL Mutating Algorithms: partition & stable_ partition
- 1.5 STL Mutating Algorithms: random_ shuffle
- 1.6 STL Mutating Algorithms: remove
- 1.7 STL Mutating Algorithms: replace
- 1.8 STL Mutating Algorithms: reverse
- 1.9 STL Mutating Algorithms: rotate
- 1.10 STL Mutating Algorithms: swap & swap_ ranges
- 1.11 STL Mutating Algorithms: transform
- 1.12 STL Mutating Algorithms: unique
- 1.13 STL Mutating Algorithms: Summary & Exercises
- 2.0 STL Sorting & Numerical Algorithms
- 2.1 sort algorithm
- 2.2 stable_ sort Algorithm
- 2.3 partial_ sort
- 2.4 nth_ element
- 2.5 binary_ search
- 2.6 lower_ bound & upper_ bound
- 2.7 The merge Algorithms
- 2.8 The set Algorithms
- 2.9 Min & max
- 2.10 Numerical Algorithms
- 2.11 STL Sorting & Numerical Algorithms:Summary & Exerci
- 1.0 Extending the STL
- 1.1 Why Extend?
- 1.2 User Defined Function Objects
- 1.3 Composing Function Objects
- 1.4 User Defined Algorithms
- 1.5 User Defined Containers
- 1.6 Member Function Objects
- 1.7 Objectives Recap
- 2.0 C++ Input Output Features
- 2.1 File Operations
- 2.2 C++ File Output
- 2.3 File Input
- 2.4 File Input & Output
- 2.5 String Streams Operations
- 2.6 Objectives Recap
- 1.0 C++ Techniques
- 1.1 Well Behaved Classes
- 1.2 Handle Body Technique
- 1.3 Counted Pointers Techniques
- 1.4 Separating the Use Count
- 1.5 Envelope Letter Technique
- 1.6 Smart Pointers
- 1.7 auto_ ptr Smart Pointer
- 1.8 Virtual Constructors
- 1.9 C++ Techniques: Summary & Exercise
|
|
||||||
Training
Provided by 123-CBT Computer Based Training
Advanced C Programming Set of 6
--
About The Training Provider: 123-CBT Computer Based Training
123-CBT Computer Based Training - 123-CBT offers discount pricing on top quality eLearning
programs from leading computer based training providers. Many of the training courses are available both online or on CD so that you can study at home at your own pace:
E-Learning available for
- ABAP 6. 10
- Access 2003
- Acrobat 6. 0
- ASP
- ASP. NET
- C
- Captivate 1. 0
- Crystal Reports 8. 5
- Crystal Reports v10
-...
