Question

Explain how a stack would work internally if made with an array that doesn't increase in size. Write the C++ code for it. (Make sure to watch out for when the stack is full)--I am looking for when it is created, deleted, when data is inserted, and when data is removed. Make sure to have code that tests it too.

Answer 1

#include <iostream>
using namespace std;
#define MAX 10

//gloabal variable
int stack[10];
int top = -1;

//method to push the element onto the stack
void push(int val)
{
if(top>=MAX-1)
cout<<"Overflow!"<<endl;
else
{
top++;
stack[top]=val;
}
cout<<endl<<val<<" is inserted successfully!";
}

//method to pop an element from the stack
void pop()
{
if(top<=-1)
cout<<"Underflow!"<<endl;
else
{
cout<<stack[top]<<" is popped successfully!"<<endl;
top--;
}
}

//method to display the stack
void display()
{
if(top>=0)
{
cout<<endl<<endl<<"The current stack is:"<<endl;
for(int i=top; i>=0; i--)
{
cout<<stack[i]<<endl;
}
cout<<endl;
}
else
cout<<"Stack is empty!";
}

int main()
{
//method calling
push(10);
push(20);
push(30);
display();
pop();
push(40);
push(50);
display();
}

OUTPUT: