Help with c++ homework | Computer Science homework help

Stack object data structures do not contain code to throw an exception when a stack.pop() function is called on an empty stack. This is due to the fact that it is easy to establish this exception handing elsewhere. Create a class named SafeStack that implements a stack of strings. 

  • Use an instance of stack from <string> to hold string values and implement the same interface as the data type. However, your implementation (class) should throw an exception if an attempt is made to remove a value from an empty stack.
  • See Chapter 17 of the book for how to complete this assignment.

TEXT is BIG C++ 

 

free pdf.

 

https://vk.com/doc-38203920_235034518

 

I am having issues getting code to compile. Need HELP ASAP 

 

// File: SafeStack.h
#ifndef SAFESTACK_H
#define SAFESTACK_H

// Header files section
#include <stack>
#include <string>
#include <exception>
#include <stdexcept>
#include <iostream>
#include <sstream>
using namespace std;

// definition of the EmptyStackException class
class EmptyStackException : public exception
{
public:
   EmptyStackException();
  
};

// definition of the SafeStack class
class SafeStack
{
public:
   SafeStack();
   void push(string str);
   string top() throw (EmptyStackException);
   void pop() throw (EmptyStackException);
   int size();
   bool empty();

private:
   stack<string> stk;
};
#endif

——————————————————————-

// File: SafeStack.cpp
#include “SafeStack.h”

// constructor of the EmptyStackException class
EmptyStackException::EmptyStackException() : exception(“Stack is empty!”)
{
}

// constructor of the SafeStack class
SafeStack::SafeStack()
{}

// push function implementation
void SafeStack::push(string str)
{
   stk.push(str);
   cout << “One element is inserted in the stack.” << endl;
} // end of push function

// top function implementation
string SafeStack::top() throw (EmptyStackException)
{
   // throw the EmptyStackException if the stack is empty
   if(stk.empty())
       throw EmptyStackException();

   return stk.top();
} // end of top function

// pop function implementation
void SafeStack::pop() throw (EmptyStackException)
{
   // throw the EmptyStackException if the stack is empty
   if(stk.empty())
       throw EmptyStackException();

   stk.pop();
} // end of pop function

// size function implementation
int SafeStack::size()
{
   return stk.size();
} // end of size function

// empty function implementation
bool SafeStack::empty()
{
   return stk.empty();
} // end of empty function

——————————————————————–

// File: Test.cpp
#include “SafeStack.h”

// start main function
int main()
{
   // create an object for the SafeStack class
   SafeStack ss;

   cout << “The number of elements in the stack: ” << ss.size() << endl;

   // try/catch for the top() function
   try
   {
       cout << “The top element in the stack: ” << ss.top() << endl;
   }
   catch(exception& ex)
   {
       cout << “Caught exception for top(): ” << ex.what() << endl;
   }

   ss.push(“John”);
   ss.push(“Smith”);
   cout << “nThe number of elements in the stack: ” << ss.size() << endl;

   // try/catch for the top() function
   try
   {
       cout << “The top element in the stack: ” << ss.top() << endl;
   }
   catch(exception &ex)
   {
       cout << “Caught exception for top(): ” << ex.what() << endl;
   }

   cout << “nThe number of elements in the stack: ” << ss.size() << endl;

   // try/catch for the pop() function
   try
   {
       ss.pop();
       cout << “One element is removed from the stack.” << endl;
   }
   catch(exception &ex)
   {
       cout << “Caught exception for pop(): ” << ex.what() << endl;
   }

   // try/catch for the top() function
   try
   {
       cout << “The top element in the stack: ” << ss.top() << endl;
   }
   catch(exception &ex)
   {
       cout << “Caught exception for top(): ” << ex.what() << endl;
   }

   cout << “nThe number of elements in the stack: ” << ss.size() << endl;

   // try/catch for the pop() function
   try
   {
       ss.pop();
       cout << “One element is removed from the stack.” << endl;
   }
   catch(exception &ex)
   {
       cout << “Caught exception for pop(): ” << ex.what() << endl;
   }

   // try/catch for the top() function
   try
   {
       cout << “The top element in the stack: ” << ss.top() << endl;
   }
   catch(exception ex)
   {
       cout << “Caught exception for top(): ” << ex.what() << endl;
   }

   cout << “nThe number of elements in the stack: ” << ss.size() << endl;

   // try/catch for the pop() function
   try
   {
       ss.pop();
       cout << “One element is removed from the stack.” << endl;
   }
   catch(exception &ex)
   {
       cout << “Caught exception for pop(): ” << ex.what() << endl;
   }

   cout << endl;
   system(“pause”); // for Visual Studio
   return 0;
} // end of main function

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
The price is based on these factors:
Academic level
Number of pages
Urgency
Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

Read more

Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.

Read more

Privacy policy

Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.

Read more

Fair-cooperation guarantee

By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.

Read more