Scribd
Upload
60 views5 pages

DSA - Exp1 - Vu4f2021081 - Sushant Patil

This document contains code to implement a stack using an array. It defines functions to push, pop, peek, check if empty/full and display elements. The main function takes user input to call these functions and perform stack operations like push, pop, display top etc. It uses a while loop, switch case and function calls to implement the stack functionality.

Uploaded by

Utekar Namrata
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
60 views5 pages

DSA - Exp1 - Vu4f2021081 - Sushant Patil

This document contains code to implement a stack using an array. It defines functions to push, pop, peek, check if empty/full and display elements. The main function takes user input to call these functions and perform stack operations like push, pop, display top etc. It uses a while loop, switch case and function calls to implement the stack functionality.

Uploaded by

Utekar Namrata
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
You are on page 1/ 5

Name:-Namrata Atmaram Utekar

Id’No.:-vu4f2021120 batch:-D

Div:-A/I.t,. Subject:-DSA

Experiment No.1

Stack Implementation

code

#include<stdio.h>

#include<stdlib.h>

#define MAX 10

int stack_arr[MAX]; int

top = -1;

void push(int item);

int pop(); int

peek(); int

isEmpty(); int

isFull(); void

display();

main()

int choice,item;

while(1)

{
printf("1.Push\n");

printf("2.Pop\n");

printf("3.Display the top element\n");

printf("4.Display all stack elements\n");

printf("5.Quit\n"); printf("Enter

your choice : "); scanf("%d",&choice);

switch(choice)

case 1 :

printf("Enter the item to be pushed : ");

scanf("%d",&item);

push(item);

break;

case 2: item = pop();

printf("Popped item is : %d\n",item );

break;

case 3:

printf("Item at the top is : %d\n", peek() );

break;

case 4:

display();

break;

case 5:

exit(1);

default:

printf("Wrong choice\n");
}/*End of switch*/

getch() ;

}/*End of while*/

}/*End of main()*/

void push(int item)

if( isFull() )

printf("Stack Overflow\n");

return;

top = top+1;

stack_arr[top] = item;

}/*End of push()*/

int pop()

int item;

if( isEmpty() )

printf("Stack Underflow\n");

exit(1);

}
item = stack_arr[top];

top = top-1; return item;

}/*End of pop()*/

int peek()

if( isEmpty() )

printf("Stack Underflow\n");

exit(1);

return stack_arr[top];

}/*End of peek()*/

int isEmpty()

if( top == -1 )

return 1;

else return 0;

}/*End of isEmpty*/

int isFull()

if( top == MAX-1 )

return 1;

else return 0;

}/*End of isFull*/
void display()

int i;

if( isEmpty() )

printf("Stack is empty\n");

return;

printf("Stack elements :\n\n");

for(i=top;i>=0;i--)

printf(" %d\n", stack_arr[i] ); printf("\n");

}/*End of display()*/

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy