Question

Stack Operations initializestack: Initializes the stack to an empty state. isEmptyStack: Determines whether the stack is empty. If the stack is empty, it returns the value true; otherwise, it returns the value false. isFul1stack: Determines whether the stack is full. If the stack is full, it returns the value true; otherwise, it returns the value false. push: Adds a new element to the top of the stack. The input to this operation consists of the stack and the new element. Prior to this opera- tion, the stack must exist and must not be full. top: Returns the top element of the stack. Prior to this operation, the stack must exist and must not be full. pop: Removes the top element of the stack. Prior to this operation, th stack must exist and must not be empty.

Create a C++ program. Include comment, input and output file.

STACK IMPLEMENTATION USING AN link list

IMPLEMENT THE FOLLOWING STACK OPERATIONS using  a TEMPLATED CLASS.

WRITE ALL THE FULL-FUNCTION DEFINITIONS NEEDED for the OPERATIONS.

OUTPUT: PRINT ALL THE ELEMENTS ON THE STACK.

Answer 1

#include <iostream>
#include <string>
using namespace std;


template <typename T>
class Stack {
private:
    T stackArray[100];
    int top;
public:
      Stack() {
        top = -1;
    }

    void push(T value) {
        ++top;
        stackArray[top] = value;
    }
bool isFullStack( ){

    if(top == 100)
        return true ;
    else return false ;


}

    void display() {
        for(int i = 0; i <= top ; ++i) {
            cout << stackArray[i] << " ";
        }
        cout << endl;
    }
    T pop() {

        // check if the stack is not empty
        if(isEmptyStack()) {

            cout << "The stack is empty so you cannot pop element " << endl;
        }
        else {
        T retVal = stackArray[top];
        --top;
        return retVal;
    }}

    T top_element() {

        if( top != -1 )
        return stackArray[top];
        else
            cout<< "Stack is empty "<< endl;

    }

    int count() {
        return top + 1;
    }


    bool isEmptyStack() {
        if (top == -1) {
            return true;
        }
        else {
            return false;
        }
    }


};

int main()
{
    Stack<double> data_double;
   cout<< "when performing pop() operation on the empty stack : "<< endl ;
    
    data_double.pop();

    data_double.push(15);
    data_double.push(25);
    data_double.push(226);
    data_double.push(32);
    data_double.push(5);
    data_double.push(52);
    data_double.push(92);
    cout<< " Display all elements of the stack:" << endl ;

    data_double.display() ;
    cout << "Top element is :" << data_double.top_element() << endl;
     data_double.pop();
    cout<<"Stack contents after single POP : " <<endl ;
    data_double.display();

    cout << "Top element is( after one pop()  :" << data_double.top_element() << endl;

cout<< " The number of elements in the stack :  " << data_double.count()<< endl ;

    cout<< "Is stack full ?  " ;
    data_double.isFullStack() ?  cout<< "yes " : cout<< "NO ";


    return 0;
}

when performing pop) operation on the empty stack The stack is empty so you cannot pop element Display all elements of the stack: 15 25 226 32 5 52 92 Top element is:92 Stack contents after single POP 15 25 226 32 5 52 Top element isC after one pop) $ The number of elements in the stack: 6 Is stack full? NO Process finished with exit code θ