HALLOGRAM PUBLISHING
SHOPPING CARTSITE MAPCONTACT USPRODUCTS
HOMEBARCODESDEVELOPER TOOLSUSER TOOLSTRAINING
C++ Advanced Programming: Level 6 Training by Keystone

C++ Advanced Programming: 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

C++ Advanced Programming: Level 2

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

C++ Advanced Programming: Level 3

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

C++ Advanced Programming: Level 4

1.0 STL Mutating Generic Algorithms
1.1 STL Mutating Algorithms: Copy * Copy backward
1.2 STL Mutating Algorithms: Fill & Fill in
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 & Exercises

C++ Advanced Programming: Level 5

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

C++ Advanced Programming: Level 6

1.0 C++ Techniquess
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


Return to the Core C++ Training Videos Main Page

Check out the complete list of Keystone Training Videos

Frequently Asked Questions

a-z
A-Z
Software Products


C++ Advanced: Includes Levels 1-6

C++ Advanced Training Return Policy: You may open and view 1 DVD for "demo" purposes and still be able return the product within 15 days. Any Keystone Training Products that have more than 1 tape or 1 CD opened or unsealed, are no longer covered under the 15 Day Money Back Guarantee Policy.

DVD ROM'S: This Training set will only run on DVD ROM computer players only. These DVD's WILL NOT run on entertainment DVD players that are connected to TV's. An Internet connection is also required.
C++ Advanced Levels 1-6 DVD ROM's.....$399.00


Home || Shopping Cart || Site Map || Newsletter/Blog
Search HALLoGRAM || Request More Information
CALL TOLL FREE 1-866-340-3404

©Copyright 2001 HALLoGRAM Publishing, Aurora CO. All Rights Reserved.
All products mentioned in this site are trademarks of their respective owners.