The Assignment:

You will implement and test a revised sequence class that uses a dynamic array to store the items.

Purposes:

Ensure that you can write a small class that uses a dynamic array as a private member variable.

Before Starting:

Read all of Chapter 4.

Complete Lab Exercise 3 (Using Make for G++ Compilations).

Due Date:

________________

Files that you must write:

1. sequence2.h: The header file for the new sequence class. Actually, you don't have to write much of this file. Just start with our version and add your name and other information at the top. If some of your member functions are implemented as inline functions, then you may put those implementations in this file too. By the way, you might want to compare this header file with your first sequence header file (sequence1.h) . The new version no longer has a CAPACITY constant because the items are stored in a dynamic array that grows as needed. But there is a DEFAULT_CAPACITY constant, which provides the initial size of the array for a sequence created by the default constructor.
2. sequence2.cxx: The implementation file for the new sequence class. You will write all of this file, which will have the implementations of all the sequence's member functions.

Other files that you may find helpful:

1. sequence_test.cxx: This is the same interactive test program that you used with the earlier sequence. If you want to use it with the new sequence, then copy it to your directory and open it with your editor. Then change the statement
   #include "sequence1.h"
   to
   #include "sequence2.h"
   and also change the namespace to main_savitch_4.
2. sequence_exam2.cxx: A non-interactive test program that will be used to grade the correctness of your new sequence class.

The Sequence Class Using a Dynamic Array
Discussion of the Assignment

Your sequence class for this assignment will differ from the your previous sequence in the following ways:

• The number of items which may be stored in the sequence should only be limited by the amount of memory available on the heap. When new items are added to a sequence which is at capacity, the size of the data array in which items are stored should be automatically enlarged.
• Because you are dynamically allocation memory within your sequence class, you will need to define a copy constructor, an assignment operator, and a destructor.
• The constructor should have a default argument which allows the user to set the initial capacity of the sequence.
• There should be a resize function that allows the user to explicitly set the the capacity of the sequence.

Start by declaring the new sequence's private member variables in sequence2.h. This should include the dynamic array (which is declared as a pointer to an Item). You will also need two size_t variables to keep track of the number of items in the sequence and the total size of the dyamic array. After you've declared your member variables, write an invariant for the top of sequence2.cxx.

Once again, do your work in small pieces. For example, my first version of the sequence had only a constructor, start, insert, advance, and current. My other member functions started out as stubs.

Use the interactive test program and the debugger to track down errors in your implementation. If you have an error, do not start making changes until you have identified the cause of the error.

When a member functions needs to increase the size of the dynamic array, it is a good idea to increase that size by at least 10% (rather than by just one item).