Homework 2, A Stack.

Short Description:

This assignment is worth 40 points.

Goals

• Implemented a class that works with dynamic memory.
• Thoroughly tested this class.
• Employed this class to solve a simple problem.

Formal Description

1. Implement a stack class.
   • The data held in this class should be a character.
   • This class must be based on a dynamic list
   • This class should have no memory leaks.
   • You must implement this in the files
     • StackT.h
     • StackT.cpp
   • Your type should be StackT
   • It should support the following functions

     void Push(char c);
     void Pop(void);
     char Top(void) const;
     bool IsEmpty(void) const;
     size_t Size(void) const; 

   • In addition, you should add any functions needed to build a fully functional stack with dynamic memory.
2. You should thoroughly test your stack.
   • Provide a word document describing a test plan for testing your stack class.
   • Implement your test plan and provide the file(s) that accomplish this.
   • Use valgrind to assure you have no memory leaks.
3. Implement a solution to The Grand Adventure.
   • This should be implemented in a file called grand.cpp or grand.C and should employ your stack class.

-g -O3 -Wpedantic -Wall -Wextra -Wmisleading-indentation -Wunused -Wuninitialized -Wshadow -Wconversion  -D_FORTIFY_SOURCE=2 -std=c++17

Required Files

If you do not know how to produce a tar file, or need assistance with your Makefile, please contact me.

Submission