Scribd
Upload
7 views4 pages

Stack Operations Using Array

The document outlines a program for implementing a stack using an array in C. It describes stack operations such as push, pop, and display, along with the corresponding code implementation. The program allows users to interactively perform stack operations and displays the output of these operations.

Uploaded by

zeeshan ahmad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views4 pages

Stack Operations Using Array

The document outlines a program for implementing a stack using an array in C. It describes stack operations such as push, pop, and display, along with the corresponding code implementation. The program allows users to interactively perform stack operations and displays the output of these operations.

Uploaded by

zeeshan ahmad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

PROGRAM -04

4.1 Objective: Write a program for array implementation of stack.


4.2 Theory
Stack is a linear data structure that follows the LIFO (Last In First Out) principle, where it
performs all operations. It performs insertion and deletion operations on the stack from only
one end called the top of stack. You can perform the implementation of the stack in memory
using two data structures: using array and using linked-list.
Possible stack operations are:
● push() to insert an element into the stack
● pop() to remove an element from the stack
● top() Returns the top element of the stack.
● isEmpty() returns true if stack is empty else return false

4.3 Code
#include<stdio.h>
int stack[100], choice, n, top, x, i ;
void push(void);
void pop(void);
void display(void);
int main()
{
//clrscr();
top=-1;
printf("\n Enter the size of STACK[MAX=100]:");
scanf("%d",&n);
printf("\n\t STACK OPERATIONS USING ARRAY");
printf("\n\t--------------------------------");
printf("\n\t [Link]\n\t [Link]\n\t [Link]\n\t [Link]");
do
{
printf("\n Enter the Choice:");
scanf("%d",&choice);
switch(choice)
{

14
case 1:
{
push();
break;
}
case 2:
{
pop();
break;
}
case 3:
{
display();
break;
}
case 4:
{
printf("\n\t EXIT POINT ");
break;
}
default:
{
printf ("\n\t Please Enter a Valid Choice(1/2/3/4)");
}
}
}
while(choice!=4);
return 0;
}
void push()

15
{
if(top>=n-1)
printf("\n\tSTACK is over flow");
else
{
printf(" Enter a value to be pushed:");
scanf("%d",&x);
top++;
stack[top]=x;
}
}
void pop()
{
if(top<=-1)
printf("\n\t Stack is under flow");
else
{
printf("\n\t The popped elements is %d",stack[top]);
top--;
}
}
void display()
{
if(top>=0)
{
printf("\n The elements in STACK \n");
for(i=top; i>=0; i--)
printf("\n%d",stack[i]);
printf("\n Press Next Choice");
}

16
else
{
printf("\n The STACK is empty");
}
}
4.4 Output
Enter the size of STACK[MAX=100]:10

STACK OPERATIONS USING ARRAY


--------------------------------
[Link]
[Link]
[Link]
[Link]
Enter the Choice:1
Enter a value to be pushed:12

Enter the Choice:1


Enter a value to be pushed:24

Enter the Choice:1


Enter a value to be pushed:98

Enter the Choice:3

The elements in STACK

98
24
12
Press Next Choice
Enter the Choice:2

The popped elements is 98


Enter the Choice:3

The elements in STACK

24
12
Press Next Choice
Enter the Choice:4

EXIT POINT

17

You might also like