Implement Hash Desk utilizing C language

#embrace<stdio.h>  <br/> #embrace<conio.h>  <br/> #outline MAX 8  <br/> void createwor(int [][2]);  <br/> void insertwor(int [][2]);  <br/> void deletwor(int [][2]);  <br/> void displaywor(int [][2]);  <br/> void createwr(int [][2]);  <br/> void insertwr(int [][2]);  <br/> void deletwr(int [][2]);  <br/> void displaywr(int [][2]);  <br/> void searchwr(int [][2]);  <br/> void searchwor(int [][2]);  <br/> void major()  <br/> {  <br/> int ch,ch1,i,j;  <br/> int a[MAX][2],b[MAX][2];  <br/> for(i=0;i<max;i++)  <br/> for(j=0;j<2;j++)  <br/> b[i][j]=-1;  <br/> for(i=0;i<max;i++)  <br/> for(j=0;j<2;j++)  <br/> a[i][j]=-1;  <br/> do  <br/> {  <br/> clrscr();  <br/> printf("nttHASH TABLEntt1.CREATE HASH TABLEntt2.INSERTntt3.DELETEntt4.DISPLAYntt5.SEARCHntt6.EXIT");  <br/> printf("nttENTER UR CHOICE");  <br/> scanf("%d",&ch);  <br/> swap(ch)  <br/> {  <br/> case 1:  <br/> do  <br/> {  <br/> clrscr();  <br/> printf("CREATE HASH TABLEntt1.WITH REPLACEMENTntt2.WITHOUT REPLACEMENTntt3.EXIT");  <br/> printf("nttENTER UR CHOICE");  <br/> scanf("%d",&ch1);  <br/> swap(ch1)  <br/> {  <br/> case 1:  <br/> printf("WITH REPLACEMENT");  <br/> createwr(a);  <br/> break;  <br/> case 2:  <br/> printf("WITHOUT REPLACEMENT");  <br/> createwor(b);  <br/> break;  <br/> case 3:  <br/> break;  <br/> }  <br/> }whereas(ch1!=3);  <br/> break;  <br/> case 2:  <br/> do  <br/> {  <br/> clrscr();  <br/> printf("nttINSERTntt1.WITH REPLACEMENTntt2.WITHOUT REPLACEMENTntt3.EXIT");  <br/> printf("nttENTER UR CHOICE");  <br/> scanf("%d",&ch1);  <br/> swap(ch1)  <br/> {  <br/> case 1:  <br/> printf("WITH REPLACEMENT");  <br/> insertwr(a);  <br/> break;  <br/> case 2:  <br/> printf("WITHOUT REPLACEMENT");  <br/> insertwor(b);  <br/> break;  <br/> case 3:  <br/> break;  <br/> }  <br/> }whereas(ch1!=3);  <br/> break;  <br/> case 3:  <br/> do  <br/> {  <br/> clrscr();  <br/> printf("nttDELETEntt1.WITH REPLACEMENTntt2.WITHOUT REPLACEMENTntt3.EXIT");  <br/> printf("nttENTER UR CHOICE");  <br/> scanf("%d",&ch1);  <br/> swap(ch1)  <br/> {  <br/> case 1:  <br/> printf("WITH REPLACEMENT");  <br/> deletwr(a);  <br/> break;  <br/> case 2:  <br/> printf("WITHOUT REPLACEMENT");  <br/> deletwor(b);  <br/> break;  <br/> case 3:  <br/> break;  <br/> }  <br/> }whereas(ch1!=3);  <br/> break;  <br/> case 4:  <br/> do  <br/> {  <br/> clrscr();  <br/> printf("nttDISPLAYntt1.WITH REPLACEMENTntt2.WITHOUT REPLACEMENTntt3.EXIT");  <br/> printf("nttENTER UR CHOICE");  <br/> scanf("%d",&ch1);  <br/> swap(ch1)  <br/> {  <br/> case 1:  <br/> printf("WITH REPLACEMENT");  <br/> displaywr(a) ;  <br/> break;  <br/> case 2:  <br/> printf("WITHOUT REPLACEMENT");  <br/> displaywor(b) ;  <br/> break;  <br/> case 3:  <br/> break;  <br/> }  <br/> }whereas(ch1!=3);  <br/> break;  <br/> case 5:  <br/> do  <br/> {  <br/> clrscr();  <br/> printf("nttSEARCHntt1.WITH REPLACEMENTntt2.WITHOUT REPLACEMENTntt3.EXIT");  <br/> printf("nttENTER UR CHOICE");  <br/> scanf("%d",&ch1);  <br/> swap(ch1)  <br/> {  <br/> case 1:  <br/> printf("WITH REPLACEMENT");  <br/> searchwr(a);  <br/> break;  <br/> case 2:  <br/> printf("WITHOUT REPLACEMENT");  <br/> searchwor(b);  <br/> break;  <br/> case 3:  <br/> break;  <br/> }  <br/> }whereas(ch1!=3);  <br/> break;  <br/> case 6:  <br/> break;  <br/> }  <br/> }whereas(ch!=6);  <br/> getch();  <br/> }  <br/> void createwor(int b[][2])  <br/> {  <br/> int i,j;  <br/> for(i=0;i<max;i++)  <br/> for(j=0;j<2;j++)  <br/> b[i][j]=-1;  <br/> do  <br/> {  <br/> insertwor(b);  <br/> printf("DO U WANT TO ENTER MORE");  <br/> }whereas(getche()=='y');  <br/> }  <br/> void insertwor(int b[][2])  <br/> {  <br/> int r,s,t,a;  <br/> printf("nENTER DATA");  <br/> scanf("%d",&a);  <br/> s=a%5;  <br/> if(b[s][0]==-1)  <br/> b[s][0]=a;  <br/> else  <br/> {  <br/> //printf("COLLISION OCCURS");  <br/> //getch();  <br/> whereas(1)  <br/> {  <br/> printf("nTRUE COLLISION OCCURS");  <br/> getch();  <br/> if(b[s][1]==-1)  <br/> {  <br/> t=s;  <br/> whereas(b[s][0]!=-1)  <br/> { //s++;  <br/> s=(s+1)%MAX;  <br/> if(s==t)  <br/> {  <br/> printf("OVERFLOW");  <br/> break;  <br/> }  <br/> }  <br/> if(s!=t)  <br/> {  <br/> b[s][0]=a;  <br/> b[t][1]=s;  <br/> }  <br/> break;  <br/> }  <br/> else  <br/> s=b[s][1];  <br/> }  <br/> }  <br/> }  <br/> void deletwr(int b[][2])  <br/> {  <br/> int r,s,t,a;  <br/> printf("ENTER DATA WHICH U WANT TO DELETE");  <br/> scanf("%d",&a);  <br/> t=s=a%5;  <br/> whereas(1)  <br/> {  <br/> if(b[s][0]==a)  <br/> break;  <br/> t=s;  <br/> s=b[s][1];  <br/> if(s==-1)  <br/> break;  <br/> }  <br/> if(s==-1)  <br/> printf("NOT FOUND");  <br/> else  <br/> {  <br/> whereas(1)  <br/> {  <br/> if(b[b[t][1]][0]!=a)  <br/> b[t][0]=b[b[t][1]][0];  <br/> r=b[t][1];  <br/> if(b[r][1]==-1)  <br/> {  <br/> b[t][1]=b[r][1];  <br/> break;  <br/> }  <br/> t=r;  <br/> }  <br/> b[r][0]=-1;  <br/> }  <br/> }  <br/> void displaywor(int b[][2])  <br/> {  <br/> int i,r,s,t,a;  <br/> printf("nINDEXtDATAtCHAIN");  <br/> for(i=0;i<max;i++)  <br/> {  <br/> if(b[i][0]!=-1)  <br/> {  <br/> printf("npercentd",i);  <br/> printf("tpercentd",b[i][0]);  <br/> //if(b[i][1]!=-1)  <br/> printf("tpercentd",b[i][1]);  <br/> }  <br/> }  <br/> getch();  <br/> }  <br/> void createwr(int b[][2])  <br/> {  <br/> int i,j;  <br/> for(i=0;i<max;i++)  <br/> for(j=0;j<2;j++)  <br/> b[i][j]=-1;  <br/> do  <br/> {  <br/> insertwr(b);  <br/> printf("DO U WANT TO ENTER MORE");  <br/> }whereas(getche()=='y');  <br/> }  <br/> void insertwr(int b[][2])  <br/> {  <br/> int r,s,t,a,i;  <br/> printf("nENTER DATA");  <br/> scanf("%d",&a);  <br/> s=a%5;  <br/> if(b[s][0]==-1)  <br/> b[s][0]=a;  <br/> else if(s==(b[s][0]%5))  <br/> {  <br/> //printf("TRUE COLLISION OCCURS");  <br/> //getch();  <br/> whereas(1)  <br/> {  <br/> printf("nTRUE COLLISION OCCURS");  <br/> getch();  <br/> if(b[s][1]==-1)  <br/> {  <br/> t=s;  <br/> whereas(b[s][0]!=-1)  <br/> {  <br/> s=(s+1)%MAX;  <br/> if(t==s)  <br/> {  <br/> printf("OVERFLOW");  <br/> getch();  <br/> break;  <br/> }  <br/> }  <br/> if(t!=s)  <br/> {  <br/> b[s][0]=a;  <br/> b[t][1]=s;  <br/> }  <br/> break;  <br/> }  <br/> else  <br/> s=b[s][1];  <br/> }  <br/> }  <br/> else  <br/> {  <br/> printf("FALSE COLLISION OCCURS");  <br/> getch();  <br/> r=i=b[s][0]%5;  <br/> whereas(1)  <br/> {  <br/> if(b[i][1]==s)  <br/> {  <br/> b[i][1]=b[s][1];  <br/> break;  <br/> }  <br/> i=b[i][1];  <br/> }  <br/> t=i;  <br/> whereas(b[i][1]!=-1)  <br/> i=b[i][1];  <br/> t=i;  <br/> i=(i+1)%MAX;  <br/> whereas(b[i][0]!=-1)  <br/> {  <br/> i=(i+1)%MAX;  <br/> if(r==i)  <br/> {  <br/> printf("OVERFLOW");  <br/> getch();  <br/> break;  <br/> }  <br/> }  <br/> if(r!=i)  <br/> {  <br/> b[t][1]=i;  <br/> b[i][0]=b[s][0];  <br/> //b[i][1]=-1;  <br/> b[s][0]=a;  <br/> b[s][1]=-1;  <br/> //b[r][1]=i;  <br/> }  <br/> }  <br/> }  <br/> void displaywr(int b[][2])  <br/> {  <br/> int i,r,s,t,a;  <br/> printf("nINDEXtDATAtCHAIN");  <br/> for(i=0;i<max;i++)  <br/> {  <br/> if(b[i][0]!=-1)  <br/> {  <br/> printf("npercentd",i);  <br/> printf("tpercentd",b[i][0]);  <br/> //if(b[i][1]!=-1)  <br/> printf("tpercentd",b[i][1]);  <br/> }  <br/> }  <br/> getch();  <br/> }  <br/> void searchwr(int b[][2])  <br/> {  <br/> int r,s,a;  <br/> printf("ENTER DATA WHICH U WANT TO SEARCH");  <br/> scanf("%d",&a);  <br/> s=a%5;  <br/> whereas(1)  <br/> {  <br/> if(b[s][0]==a)  <br/> break;  <br/> s=b[s][1];  <br/> if(s==-1)  <br/> break;  <br/> }  <br/> if(s==-1)  <br/> printf("NOT FOUND");  <br/> else  <br/> {  <br/> printf("nINDEX IS %d:",s);  <br/> printf("nDATA IS %d:",b[s][0]);  <br/> printf("nINDEX WHICH IS CHAINED FROM IT:%d",b[s][1]);  <br/> }  <br/> getch();  <br/> }  <br/> void searchwor(int b[][2])  <br/> {  <br/> int r,s,a;  <br/> printf("ENTER DATA WHICH U WANT TO SEARCH");  <br/> scanf("%d",&a);  <br/> s=a%5;  <br/> whereas(1)  <br/> {  <br/> if(b[s][0]==a)  <br/> break;  <br/> s=b[s][1];  <br/> if(s==-1)  <br/> break;  <br/> }  <br/> if(s==-1)  <br/> printf("NOT FOUN
D");  <br/> else  <br/> {  <br/> printf("nINDEX IS %d:",s);  <br/> printf("nDATA IS %d:",b[s][0]);  <br/> printf("nINDEX WHICH IS CHAINED FROM IT:%d",b[s][1]);  <br/> }  <br/> getch();  <br/> }  <br/> void deletwor(int b[][2])  <br/> {  <br/> int r,s,t,a,okay;  <br/> printf("ENTER DATA WHICH U WANT TO DELETE");  <br/> scanf("%d",&a);  <br/> t=s=a%5;  <br/> whereas(1)  <br/> {  <br/> if(b[s][0]==a)  <br/> break;  <br/> t=s;  <br/> s=b[s][1];  <br/> if(s==-1)  <br/> break;  <br/> }  <br/> if(s==-1)  <br/> printf("NOT FOUND");  <br/> else  <br/> {  <br/> r=t;  <br/> whereas(1)  <br/> {  <br/> if(b[b[r][1]][0]!=a&&b[b[r][1]][0]%5!=b[r][1])  <br/> {  <br/> b[t][0]=b[b[r][1]][0];  <br/> t=r;  <br/> }  <br/> else if(b[b[t][1]][1]==-1)  <br/> {  <br/> b[t][1]=-1;  <br/> break;  <br/> }  <br/> r=b[r][1];  <br/> if(b[r][1]==-1)  <br/> {  <br/> b[t][1]=b[r][1];  <br/> break;  <br/> }  <br/> if(b[b[t][1]][0]!=a&&b[b[t][1]][0]%5!=b[t][1])  <br/> {  <br/> t=r;  <br/> okay=r;  <br/> }  <br/> }  <br/> b[r][0]=b[k][1]=-1;  <br/> }  <br/> }

#embrace<stdio.h> #embrace<conio.h> #outline MAX 8 void createwor(int [][2]); void insertwor(int [][2]); void deletwor(int [][2]); void displaywor(int [][2]); void createwr(int [][2]); void insertwr(int [][2]); void deletwr(int [][2]); void displaywr(int [][2]); void searchwr(int [][2]); void searchwor(int [][2]); void major() { int ch,ch1,i,j; int a[MAX][2],b[MAX][2]; for(i=0;i<max;i++) for(j=0;j<2;j++) b[i][j]=-1; for(i=0;i<max;i++) for(j=0;j<2;j++) a[i][j]=-1; do { clrscr(); printf("nttHASH TABLEntt1.CREATE HASH TABLEntt2.INSERTntt3.DELETEntt4.DISPLAYntt5.SEARCHntt6.EXIT"); printf("nttENTER UR CHOICE"); scanf("%d",&ch); swap(ch) { case 1: do { clrscr(); printf("CREATE HASH TABLEntt1.WITH REPLACEMENTntt2.WITHOUT REPLACEMENTntt3.EXIT"); printf("nttENTER UR CHOICE"); scanf("%d",&ch1); swap(ch1) { case 1: printf("WITH REPLACEMENT"); createwr(a); break; case 2: printf("WITHOUT REPLACEMENT"); createwor(b); break; case 3: break; } }whereas(ch1!=3); break; case 2: do { clrscr(); printf("nttINSERTntt1.WITH REPLACEMENTntt2.WITHOUT REPLACEMENTntt3.EXIT"); printf("nttENTER UR CHOICE"); scanf("%d",&ch1); swap(ch1) { case 1: printf("WITH REPLACEMENT"); insertwr(a); break; case 2: printf("WITHOUT REPLACEMENT"); insertwor(b); break; case 3: break; } }whereas(ch1!=3); break; case 3: do { clrscr(); printf("nttDELETEntt1.WITH REPLACEMENTntt2.WITHOUT REPLACEMENTntt3.EXIT"); printf("nttENTER UR CHOICE"); scanf("%d",&ch1); swap(ch1) { case 1: printf("WITH REPLACEMENT"); deletwr(a); break; case 2: printf("WITHOUT REPLACEMENT"); deletwor(b); break; case 3: break; } }whereas(ch1!=3); break; case 4: do { clrscr(); printf("nttDISPLAYntt1.WITH REPLACEMENTntt2.WITHOUT REPLACEMENTntt3.EXIT"); printf("nttENTER UR CHOICE"); scanf("%d",&ch1); swap(ch1) { case 1: printf("WITH REPLACEMENT"); displaywr(a) ; break; case 2: printf("WITHOUT REPLACEMENT"); displaywor(b) ; break; case 3: break; } }whereas(ch1!=3); break; case 5: do { clrscr(); printf("nttSEARCHntt1.WITH REPLACEMENTntt2.WITHOUT REPLACEMENTntt3.EXIT"); printf("nttENTER UR CHOICE"); scanf("%d",&ch1); swap(ch1) { case 1: printf("WITH REPLACEMENT"); searchwr(a); break; case 2: printf("WITHOUT REPLACEMENT"); searchwor(b); break; case 3: break; } }whereas(ch1!=3); break; case 6: break; } }whereas(ch!=6); getch(); } void createwor(int b[][2]) { int i,j; for(i=0;i<max;i++) for(j=0;j<2;j++) b[i][j]=-1; do { insertwor(b); printf("DO U WANT TO ENTER MORE"); }whereas(getche()=='y'); } void insertwor(int b[][2]) { int r,s,t,a; printf("nENTER DATA"); scanf("%d",&a); s=a%5; if(b[s][0]==-1) b[s][0]=a; else { //printf("COLLISION OCCURS"); //getch(); whereas(1) { printf("nTRUE COLLISION OCCURS"); getch(); if(b[s][1]==-1) { t=s; whereas(b[s][0]!=-1) { //s++; s=(s+1)%MAX; if(s==t) { printf("OVERFLOW"); break; } } if(s!=t) { b[s][0]=a; b[t][1]=s; } break; } else s=b[s][1]; } } } void deletwr(int b[][2]) { int r,s,t,a; printf("ENTER DATA WHICH U WANT TO DELETE"); scanf("%d",&a); t=s=a%5; whereas(1) { if(b[s][0]==a) break; t=s; s=b[s][1]; if(s==-1) break; } if(s==-1) printf("NOT FOUND"); else { whereas(1) { if(b[b[t][1]][0]!=a) b[t][0]=b[b[t][1]][0]; r=b[t][1]; if(b[r][1]==-1) { b[t][1]=b[r][1]; break; } t=r; } b[r][0]=-1; } } void displaywor(int b[][2]) { int i,r,s,t,a; printf("nINDEXtDATAtCHAIN"); for(i=0;i<max;i++) { if(b[i][0]!=-1) { printf("npercentd",i); printf("tpercentd",b[i][0]); //if(b[i][1]!=-1) printf("tpercentd",b[i][1]); } } getch(); } void createwr(int b[][2]) { int i,j; for(i=0;i<max;i++) for(j=0;j<2;j++) b[i][j]=-1; do { insertwr(b); printf("DO U WANT TO ENTER MORE"); }whereas(getche()=='y'); } void insertwr(int b[][2]) { int r,s,t,a,i; printf("nENTER DATA"); scanf("%d",&a); s=a%5; if(b[s][0]==-1) b[s][0]=a; else if(s==(b[s][0]%5)) { //printf("TRUE COLLISION OCCURS"); //getch(); whereas(1) { printf("nTRUE COLLISION OCCURS"); getch(); if(b[s][1]==-1) { t=s; whereas(b[s][0]!=-1) { s=(s+1)%MAX; if(t==s) { printf("OVERFLOW"); getch(); break; } } if(t!=s) { b[s][0]=a; b[t][1]=s; } break; } else s=b[s][1]; } } else { printf("FALSE COLLISION OCCURS"); getch(); r=i=b[s][0]%5; whereas(1) { if(b[i][1]==s) { b[i][1]=b[s][1]; break; } i=b[i][1]; } t=i; whereas(b[i][1]!=-1) i=b[i][1]; t=i; i=(i+1)%MAX; whereas(b[i][0]!=-1) { i=(i+1)%MAX; if(r==i) { printf("OVERFLOW"); getch(); break; } } if(r!=i) { b[t][1]=i; b[i][0]=b[s][0]; //b[i][1]=-1; b[s][0]=a; b[s][1]=-1; //b[r][1]=i; } } } void displaywr(int b[][2]) { int i,r,s,t,a; printf("nINDEXtDATAtCHAIN"); for(i=0;i<max;i++) { if(b[i][0]!=-1) { printf("npercentd",i); printf("tpercentd",b[i][0]); //if(b[i][1]!=-1) printf("tpercentd",b[i][1]); } } getch(); } void searchwr(int b[][2]) { int r,s,a; printf("ENTER DATA WHICH U WANT TO SEARCH"); scanf("%d",&a); s=a%5; whereas(1) { if(b[s][0]==a) break; s=b[s][1]; if(s==-1) break; } if(s==-1) printf("NOT FOUND"); else { printf("nINDEX IS %d:",s); printf("nDATA IS %d:",b[s][0]); printf("nINDEX WHICH IS CHAINED FROM IT:%d",b[s][1]); } getch(); } void searchwor(int b[][2]) { int r,s,a; printf("ENTER DATA WHICH U WANT TO SEARCH"); scanf("%d",&a); s=a%5; whereas(1) { if(b[s][0]==a) break; s=b[s][1]; if(s==-1) break; } if(s==-1) printf("NOT FOUN

D"); else { printf("nINDEX IS %d:",s); printf("nDATA IS %d:",b[s][0]); printf("nINDEX WHICH IS CHAINED FROM IT:%d",b[s][1]); } getch(); } void deletwor(int b[][2]) { int r,s,t,a,okay; printf("ENTER DATA WHICH U WANT TO DELETE"); scanf("%d",&a); t=s=a%5; whereas(1) { if(b[s][0]==a) break; t=s; s=b[s][1]; if(s==-1) break; } if(s==-1) printf("NOT FOUND"); else { r=t; whereas(1) { if(b[b[r][1]][0]!=a&&b[b[r][1]][0]%5!=b[r][1]) { b[t][0]=b[b[r][1]][0]; t=r; } else if(b[b[t][1]][1]==-1) { b[t][1]=-1; break; } r=b[r][1]; if(b[r][1]==-1) { b[t][1]=b[r][1]; break; } if(b[b[t][1]][0]!=a&&b[b[t][1]][0]%5!=b[t][1]) { t=r; okay=r; } } b[r][0]=b[k][1]=-1; } }

Supply projectgeek.com

Implement Hash Desk utilizing C language

Share this:

Related posts: