Homework 3, Queue.

Short Description:

Implement the QueueT class.

Goals

When you finish this homework, you should have:

Formal Description

Implement the QueueT class with dynamic memory.

A queue is a data structure which represents a line, or a First In First Out (FIFO) construct. Queues are very old and have a standard set interface. For this assignment you should implement a queue matching the class described in QueueT.h. You may not change this file and classes which fail to compile with this file as their header will receive no credit for this assignment.

Provided Files

Notes

Required Files

A single tar file containing the source code and makefile for this program.

Submission

Submit the assignment to the D2L folder Homework 3 by the due date.