DS-Record-mca-02) write a program to implement operations on a stack.

 Program:-02 

AIM:-
write a program to implement operations on a stack.

code:-

#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#define LIMIT 3 // Specifying the maximum limit of the stack
/* Global declaration of variables */
int stack[LIMIT]; // Array implementation of stack
int top; // To insert and delete the data elements in the stack
int i; // To traverse the loop to while displaying the stack
int choice; // To choose either of the 3 stack operations
void push(); // Function used to insert the element into the stack
void pop(); // Function used to delete the element from the stack
void display(); // Function used to display all the elements in the stack according to LIFO rule
void main()
{
	clrscr();
	printf ("ARRAY IMPLEMENTATION USING STACKS\n\n");
	top = -1; // Initializing top to -1 indicates that it is empty
	do
	{
		printf("1. Insert\n2. Delete\n3. Display\n4. Exit\n\n");
		printf("Enter your choice:");
		scanf("%d",&choice);
		switch(choice)
		{
			case 1: push();
			break;
			case 2: pop();
			break;
			case 3: display();
			break;
			case 4: exit(0);
			break;
			default:printf("Sorry, invalid choice!\n");
			break;
		}
	} while(choice!=4);
	getch();
}
//Push function
void push()
{
	int element;
	if(top == LIMIT- 1)
	{
		printf("Stack underflow\n");
	}
	else
	{
		printf("Enter the element to be inserted:");
		scanf("%d", &element);
		top++;
		stack[top]=element;
	}
}
//Pop function
void pop()
{
	int element;
	if(top == -1)
	{
		printf("Stack underflow\n");
	}
	else
	{
		element=stack[top];
		printf("The deleted item is %d\n",element);
		top--; // The element below the topmost element is deleted
	}
}
//Display function
void display()
{
	if(top == -1)
	{
		printf("Stack underflow\n"); // Stack is empty
	}
	else if(top >= 0)
	{
		printf("The elements of the stack are:\n");
		for(i = top; i >= 0; i--) // top to bottom traversal
		{
			printf("%d\n",stack[i]);
		}
	}
} 

Output:-