Skip to main content

Stack using Array in C programming



#include< stdio.h>
#include< conio.h>
#define MAX 3
void main()
{
 int S[MAX],i,val,c,top=-1,loc;
 char ch='y';
 clrscr();
 while(ch=='y')
 {
  printf("\n1.Push \n2.Pop \n3.Peep \n4.Change \n5.Display \n6.Exit");
  printf("\n Enter your choice:");
  scanf("%d",&c);


  switch(c)
  {
   case 1:
    if(top>=(MAX-1))
     printf("\n Stack Overflow");
    else
    {
     top++;
     printf("\n Enter value:");
     scanf("%d",&val);
     S[top]=val;
    }
    break;

   case 2:
    if(top==-1)
    {
     printf("\n Stack underflow");
    }

    else
    {
     printf("\n Deleted element is:%d",S[top]);
     top--;
    }
    break;
   case 3:
    printf("\n Enter index number:");
     scanf("%d",&loc);
    if((top-loc)+1<= -1)
     printf("\n Invalid index.");
    else
    {
     printf("\n At index %d element is %d",loc,S[(top-loc)+1]);

    }
    break;
   case 4:
     printf("\n Enter index number:");
     scanf("%d",&loc);
    if((top-loc)+1<= -1)
     printf("\n Stack underflow on change.");
    else
    {
     printf("\n Enter new value at location %d:",loc);
     scanf("%d",&val);
     S[(top-loc)+1]=val;

    }
    break;


   case 5:
    if(top==-1)
    {
     printf("\n Stack underflow.");
    }



    else
    {
      printf("\n Stack Content:");
      for(i=0;i<= top;i++)
      printf("\n %d",S[i]);
    }
    break;
   case 6:
    exit(0);

  }
 }
getch();
}

OUTPUT
1.Push
2.Pop
3.Peep
4.Change
5.Display
6.Exit
 Enter your choice:2

 Stack underflow
1.Push
2.Pop
3.Peep
4.Change
5.Display
6.Exit
 Enter your choice:1

 Enter value:1

1.Push
2.Pop
3.Peep
4.Change
5.Display
6.Exit
 Enter your choice:1

 Enter value:2

1.Push
2.Pop
3.Peep
4.Change
5.Display
6.Exit
 Enter your choice:1

 Enter value:3

1.Push
2.Pop
3.Peep
4.Change
5.Display
6.Exit
Enter your choice:1

 Stack Overflow
1.Push
2.Pop
3.Peep
4.Change
5.Display
6.Exit
 Enter your choice:5

 Stack Content:
 1
 2
 3
1.Push
2.Pop
3.Peep
4.Change
5.Display
6.Exit
 Enter your choice:3

 Enter index number:3

 At index 3 element is 1
1.Push
2.Pop
3.Peep
4.Change
5.Display
6.Exit
 Enter your choice:4

 Enter index number:3

 Enter new value at location 3:74

1.Push
2.Pop
3.Peep
4.Change
5.Display
6.Exit
 Enter your choice:5

 Stack Content:
 74
 2
 3
1.Push
2.Pop
3.Peep
4.Change
5.Display
6.Exit
 Enter your choice:2

 Deleted element is:3
1.Push
2.Pop
3.Peep
4.Change
5.Display
6.Exit
 Enter your choice:5

 Stack Content:
 74
 2

Comments

Popular posts from this blog

MVT (Multiprogramming Variable Task) in C Programming

#include< stdio.h> #include< conio.h> void main() { int i,os_m,nPage,total,pg[25]; clrscr(); printf("\nEnter total memory size:"); scanf("%d",&total); printf("\nEnter memory for OS:"); scanf("%d",&os_m); printf("\nEnter no. of pages:"); scanf("%d",&nPage); for(i=0;i< nPage;i++) { printf("Enter size of page[%d]:",i+1); scanf("%d",&pg[i]); } total=total-os_m; for(i=0;i< nPage;i++) { if(total>=pg[i]) { printf("\n Allocate page %d",i+1); total=total-pg[i]; } else printf("\n page %d is not allocated due to insufficient memory.",i+1); } printf("\n External Fragmentation is:%d",total); getch(); } OUTPUT Enter total memory size:1024 Enter memory for OS:256 Enter no. of pages:4 Enter size of page[1]:128 Enter size of page[2]:512 Enter size of page[3]:64 Enter size of page[4]:512 Allocate page 1 Al

implement Rail fence cipher in Java

// File Name: RailFence.java import java.util.*; class RailFenceBasic{ int depth; String Encryption(String plainText,int depth)throws Exception { int r=depth,len=plainText.length(); int c=len/depth; char mat[][]=new char[r][c]; int k=0; String cipherText=""; for(int i=0;i< c;i++) { for(int j=0;j< r;j++) { if(k!=len) mat[j][i]=plainText.charAt(k++); else mat[j][i]='X'; } } for(int i=0;i< r;i++) { for(int j=0;j< c;j++) { cipherText+=mat[i][j]; } } return cipherText; } String Decryption(String cipherText,int depth)throws Exception { int r=depth,len=cipherText.length(); int c=len/depth; char mat[][]=new char[r][c]; int k=0; String plainText=""; for(int i=0;i< r;i++) { for(int j=0;j< c;j++) { mat[i][j]=cipherText.charAt(k++); } } for(int i=0;i< c;i++) { for(int j=0;j< r;j++) { plainText+=mat[j][i]; } }

Deadlock Prevention using Banker’s Algorithm in C Programming

#include< stdio.h> #include< conio.h> void main() { int allocated[15][15],max[15][15],need[15][15],avail[15],tres[15],work[15],flag[15]; int pno,rno,i,j,prc,count,t,total; count=0; clrscr(); printf("\n Enter number of process:"); scanf("%d",&pno); printf("\n Enter number of resources:"); scanf("%d",&rno); for(i=1;i< =pno;i++) { flag[i]=0; } printf("\n Enter total numbers of each resources:"); for(i=1;i<= rno;i++) scanf("%d",&tres[i]); printf("\n Enter Max resources for each process:"); for(i=1;i<= pno;i++) { printf("\n for process %d:",i); for(j=1;j<= rno;j++) scanf("%d",&max[i][j]); } printf("\n Enter allocated resources for each process:"); for(i=1;i<= pno;i++) { printf("\n for process %d:",i); for(j=1;j<= rno;j++) scanf("%d",&allocated[i][j]); } printf("\n avai