Skip to main content

Tower Of Hanoi in C Programming 

#include
#include
#include
void tower_of_hanoi(int,char,char,char);

void main()
{
 int disk,move;
 clrscr();
 printf("\n Enter number of disks:");
 scanf("%d",&disk);
 move=pow(2,disk)-1;
 printf("\n No. of moves required is:%d",move);
 printf("\n A-->Source peg\n B-->Destination peg \n C-->Auxiliary peg");
 tower_of_hanoi(disk,'A','B','C');

getch();
}

void tower_of_hanoi(int disk,char from,char to,char aux)
{
 if(disk==1)
 {
  printf("\n move disk %d from %c to %c",disk,from,to);
 }
 else
 {
  tower_of_hanoi(disk-1,from,aux,to);
  printf("\n move disk %d from %c to %c",disk,from,to);
  tower_of_hanoi(disk-1,aux,to,from);
 }
}
OUTPUT 

 Enter number of disks:4

 No. of moves required is:15
 A-->Source peg
 B-->Destination peg
 C-->Auxiliary peg
 move disk 1 from A to C
 move disk 2 from A to B
 move disk 1 from C to B
 move disk 3 from A to C
 move disk 1 from B to A
 move disk 2 from B to C
 move disk 1 from A to C
 move disk 4 from A to B
 move disk 1 from C to B
 move disk 2 from C to A
 move disk 1 from B to A
 move disk 3 from C to B
 move disk 1 from A to C
 move disk 2 from A to B
 move disk 1 from C to B
Labels:

Comments

Post a Comment

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
7 comments
Read more

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]; } }
Post a Comment
Read more

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
Post a Comment
Read more