Week 10

Home Windows C++ 241 C++ 242 Contact Info Contents

Week 10 - March 11

Back Up

Due Today

Program #8

Preparation for Class

This class will cover a number of new features which will probably be of use to you in your term projects. There is no advance reading requirement but you may want to review what you know about data structures. 
We will have our final exam at the end of this class. A list of topics to be covered will be provided here before the class.

Topics Covered in this Class

Namespaces
Why they are needed
Defining names in a namespace
Referring to names in a namespace
Using a namespace by default
Data Structures
Self referential classes
Review of dynamic memory allocation
Single linked lists
Double linked lists
Stacks, queues and deques
Tree structures
Standard Template Library
Why we need it
Containers, Iterators and Algorithms
Sequence containers: vector, list and deque
Associative containers: set, multiset, map and multimap
Adapters: stack, queue and priority_queue
Algorithms - selected examples
The bitset class
Function objects
C++ Class Summary
What we have covered
What's left to know - how to become an expert
Term Projects
Final Exam

Assignments

Term Project is due by Saturday, March 18

Back Up

Home Windows C++ 241 C++ 242 Contact Info Contents

Copyright © 2000  Charlie Poole. All rights reserved.
Revised: July 15, 2002 - cpoole@ctc.edu