Questions

1. Replace your template Array class from your exercise from Chapter 13, Working with Templates, with an STL vector. Create a vector of Student instances. Use vector operations to insert, retrieve, print, compare, and remove objects from the vector. Alternatively, utilize an STL list. Use this opportunity to utilize the STL documentation to navigate the full set of operations available for these classes.

a. Consider what operators, if any, you will need to overload. Consider whether you will need an iterator to provide safe interleaved access to your collection.

b. Create a second vector of Student instances. Assign one to another. Print both vectors.

2. Modify the map from this chapter to index the hash table (map) of Student instances based on lastName rather than studentId.
3. Modify the queue example from this chapter to instead utilize priority_queue. Be sure to make use of the priority enqueueing mechanism priority_queue::emplace() to add elements...