Scribd
Upload
5 views5 pages

Stack Implementation in C Using Arrays

The document presents a C program that implements a stack data structure using an array. It includes functions for initializing the stack, pushing and popping items, peeping at the top item, and traversing the stack contents. The program features a menu-driven interface for user interaction.

Uploaded by

surwaseakhil137
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
5 views5 pages

Stack Implementation in C Using Arrays

The document presents a C program that implements a stack data structure using an array. It includes functions for initializing the stack, pushing and popping items, peeping at the top item, and traversing the stack contents. The program features a menu-driven interface for user interaction.

Uploaded by

surwaseakhil137
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

/* Implementation of Stack using array

S.Y.CSE_DS_2021-22 */

# include <stdio.h>
# include <conio.h>
# include <process.h>

# define MAX_SIZE 10
# define bottom -1

void initStack();
int isOverflow();
int isUnderflow();
void push(int);
void pop();
void peep();
void traverse();

int stack[MAX_SIZE];
int top;

void main()
{
int choice, item;
clrscr();
do
{
printf("\n....MENU.....\n");
printf("1. Initialize stack\n");
printf("2. Push\n");
printf("3. Pop\n");
printf("4. Peep\n");
printf("5. Traverse\n");
printf("6. Quit\n");
printf("Enter your choice\n");
scanf("%d",&choice);
if (choice <1 || choice>6)
{
printf("Invalid choice...try again\n");
continue;
}
switch(choice)
{
case 1: initStack();
break;
case 2: printf("Enter the item to Push\n");
scanf("%d",&item);
push(item);
break;
case 3: pop();
break;
case 4: peep();
break;
case 5: traverse();
break;
case 6: printf("End of program\n");
exit(0);
}
} while (choice != 6);
}

void initStack()
{
top=bottom;
printf("Stack initialized\n");
}

int isOverflow()
{
if (top==MAX_SIZE-1)
return(1);
else
return(0);
}

int isUnderflow()
{
if (top==bottom)
return(1);
else
return(0);
}
void push(int newItem)
{
if (isOverflow())
printf("Stack overflow\n");
else
{
top = top +1;
stack[top] = newItem;
}
}

void pop()
{
if (isUnderflow())
printf("Stack underflow\n");
else
{
printf("Item Popped = %d\n", stack[top]);
top = top-1;
}
}

void peep()
{
if (isUnderflow())
printf("Stack is empty\n");
else
printf("Top of stack = %d\n", stack[top]);
}
void traverse()
{
int i;
if (isUnderflow())
printf("Stack is empty\n");
else
{
printf("Stack contents are :\n");
for(i=top; i>bottom; i--)
printf(" %d\n", stack[i]);
}
}

You might also like