To Implement Stack Using Array Program using C++ | Data Structures Lab Programs

//Stack implementation as a class. # include # include # include # define SIZE 5 class stack { int a[SIZE]; int tos; // Top of Stack public: stack(); void push(int); void display(); void pop(); int isempty(); int isfull(); }; stack::stack() { tos=0; //Initialize Top of Stack } int stack::isempty() { return (tos==0?1:0); } int stack::isfull() { return (tos==SIZE?1:0); } void stack::push(int i) { if(!isfull()) { a[tos]=i; tos++; } else { cerr<=0;i--) cout<>ch; switch(ch) { case 0: exit(1); //Normal Termination of Program case 1: cout<>num; s.push(num); s.display(); break; case 2: s.pop(); s.display(); break; case 3: (s.isempty())?(cout<

SAMPLE INPUT OUTPUT:

MAIN MENU :

1.PUSH
2.POP
3.EXIT

ENTER YOUR CHOICE : 1

ENTER THE STACK ELEMENT : 10

10 ---->TOP

MAIN MENU :

1.PUSH
2.POP
3.EXIT

ENTER YOUR CHOICE : 1

ENTER THE STACK ELEMENT : 20

20 ---->TOP

MAIN MENU :

1.PUSH
2.POP
3.EXIT

ENTER YOUR CHOICE : 1

ENTER THE STACK ELEMENT : 30

STACK FULL

30 ---->TOP

MAIN MENU :

1.PUSH
2.POP
3.EXIT

ENTER YOUR CHOICE : 2

20 ---->TOP

MAIN MENU :

1.PUSH
2.POP
3.EXIT

ENTER YOUR CHOICE : 2

10 ---->TOP

MAIN MENU :

1.PUSH
2.POP
3.EXIT

ENTER YOUR CHOICE : 1

STACK EMPTY

⇓Student Projects⇓

⇑Student Projects⇑