Computer Programming II

Lab Project #5a

PROBLEM:

This is the final stage of project 3. You are to alter your existing C++ stack and queue classes to use dynamic rather than static memory structures. Utilizing “lists” rather than arrays, you will implement the same functions for each ADT. None of your other code should be altered, but you should turn it in anyway for final credit. Only the six functions in the stack and queue classes need to be altered.

Do a full test run to show that your program still works. Use the original input files you used for either project 3A or 3B (your choice).

DESIGN:

No design is required other than the documentation for your new stack and queue functions.

IMPLEMENTATION:

You must have at least three program files for this project. One should hold the Queue ADT, another the Stack ADT and the third should hold the main function and any other code for handling the calculator (or postfixer). Make sure you make up "queue.h" and "stack.h" header files which should be #included at the top of your program with the other includes.