Containers are used to store objects of the same type and provide operations with which these objects can be managed. These operations include object insertion, deletion, and retrieval. Memory is allocated for containers dynamically at runtime.
Containers thus provide a safe and easy way to manage collections of objects. The C++ standard library provides various
class templates for container management in the Containers Library. These classes can be categorized as follows:
 Sequential containers, where the objects are arranged sequentially and access to an object can either be direct or
sequential.
 Associative containers, where the objects are generally organized and managed in a tree structure and can be referenced
using keys.
Sequential Containers
Sequential containers are distinguished by the operations defined for them, which are either generic or restricted. Restricted
operations, such as appending at the end of a container, have constant runtimes. That is, the runtime is proportional to a
fixed period of time and does not depend on the number of objects in the container.
The following are examples of sequential containers:
 Queues, which are managed on the First-In-First-Out principle. The first element to be inserted is also removed first.
 Stacks, which are managed on the Last-In-First-Out principle. The last element to be inserted is removed first.
 Vectors, which are basically a flexible-size array that supports fast random access.
Thus, in this programming assignment, you are going to create a general Vector class without using the utilities of the
standard vector class and the template feature of C++. The design should let its users to use a vector of integers or
characters. You should review the standard vector class for learning what to include as data members and member functions.
OOP principles such as encapsulation, inheritance, and polymorphism should be taken into account in the class design.
Partial grading will be in use in case there is no full implementation.