iterator i;

  *i

  (*i).first_name;   // access member variable
  i->first_name;



  map:

  i->first      // key
  i->second     // value

  *i   ==> gives you a pair<key,value>





 TEST #2 (June 16)
----------------------------------------
 OPEN BOOKS, OPEN NOTES, NO COMPUTER,
 NO CALCULATOR, NO ELECTRONIC CHEATING DEVICES

 Full 2 hours (9-11am)

 Max of 5 Questions, including stuff like this:
 -- What is the exact output of this code?
 -- Write some code to do ____________.
 -- Write a function to do ____________.
 -- Modify/expand this class declaration ....
 -- Short answer (e.g. order notation)

 TOPICS:
 -- Class declaration (*.h)
 ---- prototypes and member variables

 -- Class implementation (*.cpp)
 ---- constructors (destructors)
 ---- accessor (get_gpa or read-only functions)
 ---- mutator (set_name or write-able functions)

 -- Templated classes  (e.g. Vec<T>)
 -- Templated functions

 -- Operator overloading

 -- vector
 -- list  (linked list next/prev ptrs)
 -- iterator
 -- map
 -- set

 -- string/character (cctype) manipulation


 STUDY:
 -- (re)write functions from in-class examples
 -- write hangman program using set<char>
 -- create a class declaration for a "stack"
      similar to Vec.h, a stack is an array
      data structure that only allows push
      and pop operations from the "top" of
      the stack