BCSL-033 Data and File Structures Lab Program

1. S4-3
Write a program in ‘C’ language to implement multiple stacks in a
single array.
#include<stdio.h>
#include<conio.h>
int sno,t1,t2;
int a[20];
void push(int,int);
void pop(int);
void disp();
void main()
{
int val,t=1,no;
clrscr();
t1=0;
t2=10;
while(t)
{
printf("n1.pushn2.popn3.exitn");
printf("enter your choice");
scanf("%d",&t);
switch(t)
{
case 1:
printf("enter the stack no:n");
scanf("%d",&sno);
printf("enter the value:n");
scanf("%d",&val);
push(sno,val);
disp();
break;
case 2:
printf("enter the stack no:n");
scanf("%d",&sno);
pop(sno);
disp();
break;
case 3:
exit();
}
}
getch();
}
void disp()
{
int ts1=t1, ts2=t2;
printf("nStack 1:n ");
if (ts1 <= 0)
printf ("Empty");
while(ts1>0)
printf("%dt", a[ts1--]);
printf("nStack 1:n ");
if (ts2 <= 10)
Page 1

2. S4-3
printf ("Empty");
while(ts2>10)
printf("%dt", a[ts2--]);
}
void push(int sno,int val)
{
switch(sno)
{
case 1:
if((++t1)==10)
printf("stack 1:overflown");
else
a[t1]=val;
break;
case 2:
if(++t2==20)
printf("stack 2:overflown");
else
a[t2]=val;
break;
}
}
void pop(int sno)
{
switch(sno)
{
case 1:
if(t1<=0)
printf("stack 1:emptyn");
else
{
printf("%dn",a[t1]);
t1--;
}
break;
case 2:
if(t2<=10)
printf("stack 2:emptyn");
else
{
printf("%dn",a[t2]);
t2--;
}
break;
}
}
Page 2