Display Numbers in Ascending Order C language

Implement Hash Table using C language

 

#include<stdio.h>  
 #include<conio.h>  
 #define 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 main()  
 {  
 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("\n\t\tHASH TABLE\n\t\t1.CREATE HASH TABLE\n\t\t2.INSERT\n\t\t3.DELETE\n\t\t4.DISPLAY\n\t\t5.SEARCH\n\t\t6.EXIT");  
 printf("\n\t\tENTER UR CHOICE");  
 scanf("%d",&ch);  
 switch(ch)  
 {  
 case 1:  
 do  
 {  
 clrscr();  
 printf("CREATE HASH TABLE\n\t\t1.WITH REPLACEMENT\n\t\t2.WITHOUT REPLACEMENT\n\t\t3.EXIT");  
 printf("\n\t\tENTER UR CHOICE");  
 scanf("%d",&ch1);  
 switch(ch1)  
 {  
 case 1:  
 printf("WITH REPLACEMENT");  
 createwr(a);  
 break;  
 case 2:  
 printf("WITHOUT REPLACEMENT");  
 createwor(b);  
 break;  
 case 3:  
 break;  
 }  
 }while(ch1!=3);  
 break;  
 case 2:  
 do  
 {  
 clrscr();  
 printf("\n\t\tINSERT\n\t\t1.WITH REPLACEMENT\n\t\t2.WITHOUT REPLACEMENT\n\t\t3.EXIT");  
 printf("\n\t\tENTER UR CHOICE");  
 scanf("%d",&ch1);  
 switch(ch1)  
 {  
 case 1:  
 printf("WITH REPLACEMENT");  
 insertwr(a);  
 break;  
 case 2:  
 printf("WITHOUT REPLACEMENT");  
 insertwor(b);  
 break;  
 case 3:  
 break;  
 }  
 }while(ch1!=3);  
 break;  
 case 3:  
 do  
 {  
 clrscr();  
 printf("\n\t\tDELETE\n\t\t1.WITH REPLACEMENT\n\t\t2.WITHOUT REPLACEMENT\n\t\t3.EXIT");  
 printf("\n\t\tENTER UR CHOICE");  
 scanf("%d",&ch1);  
 switch(ch1)  
 {  
 case 1:  
 printf("WITH REPLACEMENT");  
 deletwr(a);  
 break;  
 case 2:  
 printf("WITHOUT REPLACEMENT");  
 deletwor(b);  
 break;  
 case 3:  
 break;  
 }  
 }while(ch1!=3);  
 break;  
 case 4:  
 do  
 {  
 clrscr();  
 printf("\n\t\tDISPLAY\n\t\t1.WITH REPLACEMENT\n\t\t2.WITHOUT REPLACEMENT\n\t\t3.EXIT");  
 printf("\n\t\tENTER UR CHOICE");  
 scanf("%d",&ch1);  
 switch(ch1)  
 {  
 case 1:  
 printf("WITH REPLACEMENT");  
 displaywr(a) ;  
 break;  
 case 2:  
 printf("WITHOUT REPLACEMENT");  
 displaywor(b) ;  
 break;  
 case 3:  
 break;  
 }  
 }while(ch1!=3);  
 break;  
 case 5:  
 do  
 {  
 clrscr();  
 printf("\n\t\tSEARCH\n\t\t1.WITH REPLACEMENT\n\t\t2.WITHOUT REPLACEMENT\n\t\t3.EXIT");  
 printf("\n\t\tENTER UR CHOICE");  
 scanf("%d",&ch1);  
 switch(ch1)  
 {  
 case 1:  
 printf("WITH REPLACEMENT");  
 searchwr(a);  
 break;  
 case 2:  
 printf("WITHOUT REPLACEMENT");  
 searchwor(b);  
 break;  
 case 3:  
 break;  
 }  
 }while(ch1!=3);  
 break;  
 case 6:  
 break;  
 }  
 }while(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");  
 }while(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();  
 while(1)  
 {  
 printf("\nTRUE COLLISION OCCURS");  
 getch();  
 if(b[s][1]==-1)  
 {  
 t=s;  
 while(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;  
 while(1)  
 {  
 if(b[s][0]==a)  
 break;  
 t=s;  
 s=b[s][1];  
 if(s==-1)  
 break;  
 }  
 if(s==-1)  
 printf("NOT FOUND");  
 else  
 {  
 while(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("\nINDEX\tDATA\tCHAIN");  
 for(i=0;i<MAX;i++)  
 {  
 if(b[i][0]!=-1)  
 {  
 printf("\n%d",i);  
 printf("\t%d",b[i][0]);  
 //if(b[i][1]!=-1)  
 printf("\t%d",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");  
 }while(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();  
 while(1)  
 {  
 printf("\nTRUE COLLISION OCCURS");  
 getch();  
 if(b[s][1]==-1)  
 {  
 t=s;  
 while(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;  
 while(1)  
 {  
 if(b[i][1]==s)  
 {  
 b[i][1]=b[s][1];  
 break;  
 }  
 i=b[i][1];  
 }  
 t=i;  
 while(b[i][1]!=-1)  
 i=b[i][1];  
 t=i;  
 i=(i+1)%MAX;  
 while(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("\nINDEX\tDATA\tCHAIN");  
 for(i=0;i<MAX;i++)  
 {  
 if(b[i][0]!=-1)  
 {  
 printf("\n%d",i);  
 printf("\t%d",b[i][0]);  
 //if(b[i][1]!=-1)  
 printf("\t%d",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;  
 while(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;  
 while(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 deletwor(int b[][2])  
 {  
 int r,s,t,a,k;  
 printf("ENTER DATA WHICH U WANT TO DELETE");  
 scanf("%d",&a);  
 t=s=a%5;  
 while(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;  
 while(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;  
 k=r;  
 }  
 }  
 b[r][0]=b[k][1]=-1;  
 }  
 }

 

 

Graphical User Interface designer for Java

 

The ambition where to develop a fully functional GUI designer for Java. It was to be 100% cross platform compliant, fast and easy to use with “hidden” power features, such as keyboard shortcuts for all operations. The program will base it’s structure on open standards and therefore have a strong foundation which easily can be extend. All code must be available to the public and based on the open source Gnu Public License.

The Gart must be easy to install and use. It will implement several quick start features which, makes it easy to start on new project without getting to many questions. It’s very important that The Gart will not implement anything else then GUI features and that way avoid becoming a monster application using unnecessary time and resources.

By implementing all these features we hope The Gart will be an unique application and appeal to all levels of Java coders.

System Specification for Graphical User Interface designer

 

The system on which the project developed has the following configuration.

Hardware Specifications

Main Memory : 64MB.

Micro Processor : Pentium –III.

Hard Disk Drive : 4.3 GB.

Cache Memory : 512KB.

Software Specifications

Operating System : Windows 98/NT.

Front End : Java Using Swings/AWT.

JAVA VERSION : JDK 1.4

 

 

Budget Planner Mini Project for Final Year

This project is aimed at developing a system by which the employees in the organization submit the bills to their managers. The bills could of various types and also of various amounts. The employee after submitting the bill will automatically provide the manager’s name to which the bill will be submitted. The bill will pass through a workflow process and the owner of the bill can view the status of the bill at any time. An email will be sent to the concerned people to let them know about the status of the bill.

The software is fully integrated with Customer Relationship Management as well as Content Management System solution and developed in a manner that is easily manageable, time saving and relieving one from manual works.

Functional components of the project: Following is the list of functionality which is expected to be provided by the system:

User will log on to the application and the log in will be based on the role of the user. The user will directly take into ‘My open requests’, where the user can view the details of the request and can also view the status at which the request is.

The access to the system will be based on the roles. The roles will be based on the type of department the user belongs to.

Details of Bugdet Planner Mini Project

(1) Any user can create a request by login to the system, the parameters for creating the request will be

• Name of the user (should be defaulted from the login).
• Dept of the user (should be defaulted from the login).
• Type of the bill being submitted (e.g., telephone bill, electricity bill etc).
• Amount of the bill.Date of expense incurred.
• Whether the request is supported by the bills.
• Whether the bill amount should be credited to the user account in the bank.
• Bank name, address and account number.
• Any other mode by which the user will want to get the payment.

(2) The manager of the user should be able to view the details of the request but cannot modify the details entered; he can either approve the request or reject it. Every time he performs and operation the approved has to write the comments for the same.

(3) Finance Manager – there will be number of finance managers and each finance manager will be responsible for 1 or 2 departments. Users in this role can only close the application, they can only view the requests and after crediting the amount to the request creator the request will be closed by the finance manage.

Snapshots for Budget Planner-Mini Project

 

Download Section of Mini Project

Project Abstract	Click Here
Project Report	Click Here
Project Codes Zip	Click Here
Project Database Docs	Click Here

Hospital Management System or Health Center Management system

To develop a Health Center Management system, we take care of patient registration, drug information and concerns such as drug inquiries and complaints.

The current manual system is slow laborious and error prone to computerize the same for quicker efficient results and customer satisfaction

Hospital Management System Advantages To Both End Users & Developers

The system is useful in various ways as the information about the patients who are taking the free services from the health center all the details are already stored in the database , so the service is done in no time . All the information about the drugs are also maintained in the database

Goal And Need

GOAL: With every going day the need to be where the inflow of out patient request exceeds that which can be handled manually. Hence computerization of OP receipt request and maintenance of the drugs through the computerization brings better satisfaction and service orientedness.

Quicker processing of OPNO receipt would mean better service to the patients . It would also help in the complexity of maintaining the records manually and thus less time is wasted on rework. Proper maintenance of the drug information timely dispatching of the drugs from the main stores to the pharmacy and also maintenance of daily dispatching of the drugs to the out patients from the pharmacy to the out patients . Towards this achievement the computerization of the Health Center will help greatly in maintaining pf proper information about the out patients who are eligible for the free services and the patients who are not eligible for the free services , drug information , patients records ,and daily dispatching of the drugs to various patients .

NEED: To develop a Heath Center Management system as from manual system to computerized system, and to take care of Records of the various departments in the health center.The current manual system is slow laborious and error prone to computerize the same for quicker efficient results .

Snapshots for Hospital Management System