Lecture 4

Learning objectives

After this class, you should be able to:

  1. Declare a vector class and use its following features: back, begin, empty, erase, front, insert, [ ], pop_back, push_back, rbegin, rend, constructors.
  2. Use STL algorithms with the vector class.
  3. Explain the semantics of insertion into a vectors whose current storage is already full.

Reading assignment

  1. Section 1.8.
  2. Review material from discrete math, relevant to review questions on the next lecture.

Exercises and review questions


Last modified: 17 Jan 2008