C/C++ PROJECTS.

Search

THURSDAY, JUNE 19, 2008

!!!... EMPLOYEE MANA GEMENT SYSTEM ...!!!

#IN CLU DE<IOST REAM .H> #IN CLU DE<STRI N G .H> #IN CLU DE<IOM A N IP.H> #IN CLU DE<DOS. H> #IN CLU DE<CON I O.H> #IN CLU DE<STDI O.H> #D EF IN E M AX 20 ST RU CT EM PLOY EE { CHAR N AM E[ 20] ; LON G IN T CODE; CHAR D ESIG N ATI ON [ 20] ; IN T EXP; IN T AG E; }; IN T N U M ; EM PLOY EE EM P[ M AX] ,TEM PEM P[ M AX ] ,SORTEM P[ M AX] ,SORTE M P1[ M AX] ; V OID M AIN ( ) {

CLRSCR( ) ; V OID BU ILD( ) ; V OID LIST( ) ; V OID IN SERT( ) ; V OID D ELETES( ) ; V OID EDIT( ) ; V OID SEARC H( ) ; V OID SORT( ) ; CHAR OPTION ; V OID M EN U ( ) ; M EN U () ; W HILE( ( OPTION =CIN .G E T( )) !=' Q' ) { SW IT CH( OPTION ) { CASE ' B' : BU ILD ( ) ; BREAK ; CASE ' L' : LIST ( ) ; BREAK ; CASE ' I' : IN SERT ( ) ; BREAK ; CASE ' D ' : D ELET ES( ) ; BREAK ; CASE ' E' : ED IT ( ) ; BREAK ; CASE ' S' : SEARCH( ) ; BREAK ;

CASE ' N ' : SORT ( ) ; BREAK ; } M EN U () ; } } V OID M EN U ( ) { CLRSCR( ) ; HIG HV IDEO( ) ; COU T <<" "; CPRIN T F( "*****W ELCOM E TO EM P LOY EE DATA C EN TRE***** ") ; N ORM V IDEO( ) ; COU T <<EN DL; COU T <<" "; COU T <<"PRE SS B --- - >BU ILT T HE E M PLOY EE TAB LE "; COU T <<" "; COU T <<"PRE SS L --- - >LIST T HE EM PLOY EE T AB LE" ; COU T <<" "; COU T <<"PRE SS I - --- >IN SERT N EW EN TRY "; COU T <<" "; COU T <<"PRE SS D --- - >DE LETE AN EN TRY "; COU T <<" "; COU T <<"P RE SS E --- - >EDIT AN EN T RY "; COU T <<" "; COU T <<"PRE SS S - --- >SEARC H AR EC ORD"; COU T <<" "; COU T <<"PRE SS N --- - >SO RT THE TA BLE"; COU T <<" "; COU T <<"PRE SS Q --- --- -- -- > QU IT "; COU T <<" "; COU T <<"OPTI ON PLEASE -- --- >";

} V OID BU ILD( ) { CLRSCR( ) ; HIG HV IDE O( ) ; CPRIN T F( "BU ILD THE T AB LE ") ; COU T <<EN DL; N ORM V IDEO( ) ; COU T <<"M AXIM U M N U M BE R OF E N TRIES -- --- > 20 "<<EN DL; COU T <<"H OW M AN Y DO Y OU W AN T --- -- > "; CIN >>N U M ; COU T <<"EN TER T HE FO L LOW IN G ITEM S"; F OR( IN T I=0;I<= N U M -1;I++) { COU T <<" N AM E "; CIN >>EM P [ I] .N AM E; COU T <<"C ODE "; CIN >>EM P[ I] .CODE; COU T <<"DESIG N ATION " ; CIN >>EM P[ I] .DESIG N AT ION ; COU T <<"Y EARS O F EXPE RIEN C E "; CIN >>EM P[ I] .EXP; COU T <<"AG E "; CIN >>EM P[ I] .AG E; } COU T <<"G OIN G TO M AIN M EN U "; D ELAY ( 5 00) ; } V OID LIST( ) {

CLRSCR( ) ; HIG HV IDEO( ) ; CPRIN T F( " ****** **LI ST TH E TABL E***** *** ") ; COU T <<EN DL; N ORM V IDEO( ) ; COU T <<" N AM E C ODE DE SIG N ATIO N Y EARS( EXP) AGE"; COU T <<" - -- --- -- - --- --- -- --- -- --- -- -- - --- --- -- -- - -- --- -- -- - --- " ; F OR( IN T I=0;I<= N U M -1;I++) { COU T <<SETW ( 13) <<EM P[ I] .N AM E; COU T <<SETW ( 6 ) <<EM P[ I ] .CODE; COU T <<SETW ( 15 )<<EM P[ I] .DESIG NATION ; COU T <<SETW ( 10) <<EM P[ I] .EXP; COU T <<SETW ( 15 )<<EM P[ I] .AG E; COU T <<EN DL; } COU T <<"G OIN G TO M AIN M EN U "; G ET CH( ) ; } V OID IN SERT( ) { CLRSCR( ) ; IN T I=N U M ; N U M +=1; HIG HV IDEO( ) ; CPRIN T F( " IN SERT N EW RECORD") ; COU T <<EN DL; N ORM V IDEO( ) ; COU T <<"EN TER T HE FO L LOW IN G ITEM S"; COU T <<"N AM E "; CIN >>EM P[ I] .N AM E; COU T <<"C ODE "; CIN >>EM P[ I] .CODE;

COU T <<"DESIG N ATION " ; CIN >>EM P[ I] .DESIG N AT ION ; COU T <<"Y EARS O F EXPE RIEN C E "; CIN >>EM P[ I] .EXP; COU T <<"AG E "; CIN >>EM P[ I] .AG E; COU T <<EN DL< <E N DL; COU T <<"G OIN G TO M AIN M EN U "; D ELAY ( 5 00) ; }

V OID D ELETES( ) { CLRSCR( ) ; HIG HV IDEO( ) ; IN T CODE; IN T CHECK ; CPRIN T F( "DELETE AN E N TRY ") ; N ORM V IDEO( ) ; COU T <<EN DL; COU T <<"EN TER A N J OBC ODE T O D ELETE T H AT EN T RY "; CIN >>CODE ; IN T I; F OR( I=0;I< =N U M -1;I++) { IF ( EM P[ I] .CODE= =CODE ) { CHEC K=I; } } F OR( I=0;I< =N U M -1;I++)

{ IF ( I==CHEC K) { CON T IN U E; } ELSE { IF ( I>CHECK) { T EM PEM P[ I -1] =EM P[ I] ; } ELSE { T EM PEM P[ I] =EMP[ I] ; } } } N U M --; F OR( I=0;I< =N U M -1;I++) { EM P[ I] =TEM PEMP[ I] ; } } V OID EDIT( ) { CLRSCR( ) ; IN T J OBCODE; HIG HV IDEO( ) ; CPRIN T F( " EDIT AN EN TRY ") ; COU T <<EN DL; COU T <<EN DL;

IN T I; V OID EDITM EN U () ; V OID EDITN AM E( IN T) ; V OID EDITCODE( IN T) ; V OID EDITDES( IN T) ; V OID E DITEXP( IN T) ; V OID EDITAG E( IN T) ; CHAR OPTION ; N ORM V IDEO( ) ; COU T <<"EN TER A N J OBC ODE T O E DIT AN EN TRY ---- "; CIN >>J OBC ODE; ED IT M EN U ( ) ; F OR( I=0;I< =N U M -1;I++) { IF ( EM P[ I] .CODE= =J OBC ODE) { W HILE( ( OPTION =CIN .G E T( )) !=' Q' ) { SW IT CH( OPTION ) { CASE ' N ' : ED IT N AM E( I) ; BREAK ; CASE ' C' : ED IT CODE( I) ; BREAK ; CASE ' D ' : ED IT D ES( I) ; BREAK ; CASE ' E' : ED IT EXP( I) ; BREAK ;

CASE ' A' : ED IT AG E( I) ; BREAK ; } ED IT M EN U ( ) ; } } } } V OID EDITM EN U () { CLRSCR( ) ; COU T <<" W HAT D O Y OU W AN T TO EDIT"; COU T << " N - --- -- -- - >N AM E"; COU T <<" C --- -- -- - - >COD E"; COU T <<" D - -- --- -- - >DESIG N ATION " ; COU T <<" E -- --- -- - - >EXPE RIEN CE" ; COU T <<" A --- -- --- - >AG E"; COU T <<" Q -- -- - > QU IT"; COU T <<" OPTI ON S PLEA SE -- -- >>> "; } V OID EDITN AM E( IN T I) { COU T <<"EN TER N EW N AM E---- - > "; CIN >>EM P[ I] .N AM E; } V OID EDITCODE( IN T I) { COU T <<"EN TER N EW J OB CODE -- - -- > " ; CIN >>EM P[ I] .CODE; } V OID EDITDES( IN T I) {

COU T <<"EN TER N EW DES IG N ATION --- -- > "; CIN >>EM P[ I] .DESIG N AT ION ; } V OID EDITEXP( IN T I) { COU T <<"EN TER N EW Y EA RS OF E XPERI EN CE" ; CIN >>EM P[ I] .EXP; } V OID EDITAG E( IN T I) { COU T <<"EN TER N EW AG E "; CIN >>EM P[ I] .AG E; } V OID SEARC H( ) { CLRSCR( ) ; HIG HV IDEO( ) ; CPRIN T F( "W ELCOM E TO SEAR CH O F EM PLOY EE D AT ABASE") ; N ORM V IDEO( ) ; COU T <<EN DL; COU T <<EN DL; IN T J OBCODE; COU T <<"Y OU CA N SEARCH ON LY B Y J OBCODE OF A N EM PL OY EE"; COU T <<"EN TER C ODE OF AN EM PL OY EE"; CIN >>J OBC ODE; F OR( IN T I=0;I<= N U M -1;I++) { IF ( EM P[ I] .CODE= =J OBC ODE) { COU T <<" N AM E C ODE DE SIG N ATIO N Y EARS( EXP) AGE"; COU T <<" - -- --- -- - --- --- -- --- -- --- -- -- - --- --- -- -- - -- --- -- -- - --- " ;

COU T <<SETW ( 13) <<EM P[ I] .N AM E; COU T <<SETW ( 6 ) <<EM P[ I ] .CODE; COU T <<SETW ( 15 )<<EM P[ I] .DESIG NATION ; COU T <<SETW ( 10) <<EM P[ I] .EXP; COU T <<SETW ( 15 )<<EM P[ I] .AG E; COU T <<EN DL; } } COU T <<"G OIN G TO M AIN M EN U "; G ET CH( ) ;

} V OID SORT( ) { CLRS CR( ) ; HIG HV IDEO( ) ; CPRIN T F( "SORT THE DA TABS E BY J OBCOD E") ; N ORM V IDEO( ) ; V OID SORTM EN U ( ) ; V OID SORTN AM E( ) ; V OID SORTCOD E( ) ; V OID SORTDES( ) ; V OID SORTEXP( ) ; CHAR OPTION ; V OID SORTAG E( ) ; COU T <<EN DL; COU T <<EN DL; SORT M EN U ( ) ; W HILE( ( OPTION =CIN .G E T ( )) !=' Q' )

{ SW IT CH( OPTION ) { CASE ' N ' : SORT N AM E( ) ; BREAK ; CASE ' C' : SORT CODE( ) ; BREAK ; CASE ' D ' : SORT D ES( ) ; BREAK ; CASE ' E' : SORT EXP( ) ; BREAK ; CASE ' A' : SORT AG E( ) ; BREAK ; } SORT M EN U ( ) ; } }

V OID SORTM EN U ( ) { CLRSCR( ) ; COU T <<" W HA T D O Y OU W AN T TO EDI T"; COU T <<" N - --- -- -- - >N AM E"; COU T <<" C --- -- -- - - >COD E"; COU T <<" D - -- --- -- - >DESIG N ATION " ; COU T <<" E -- --- -- - - >EXPE RIEN CE" ; COU T <<" A --- -- --- - >AG E";

COU T <<" Q -- -- - > QU IT"; COU T <<" OPTI ON S PLEA SE -- -- >>> "; }

V OID SORTN AM E( ) { CLRSCR( ) ; IN T I,J ; ST RU CT EM PLOY EE TEM P [ M AX] ; F OR( I=0;I< =N U M -1;I++) { SORT EM P1[ I] =EM P[ I] ; } F OR( I=0;I< =N U M -1;I++) { F OR( J =0;J <=N U M -1;J ++) { IF ( ST RCM P( SORTEM P1[ I ] .N AM E,SORTEM P1[ J ] .N AM E) <=0) { T EM P[ I] =SORTEM P1[ I] ; SORT EM P1[ I] =SORTEM P1 [ J ] ; SORT EM P1[ J ] =TEM P[ I] ; } } } F OR( I=0;I< =N U M -1;I++) { COU T <<" N AM E C ODE DE SIG N ATIO N Y EARS( EXP) AGE"; COU T <<" - -- --- -- - --- --- -- --- -- --- -- -- - --- --- -- -- - -- --- -- -- - --- " ;

F OR( I=0;I< =N U M -1;I++) { COU T <<SETW ( 13) <<SORT EM P1[ I] .NAM E; COU T <<SETW ( 6 ) <<SORTE M P1[ I] .CODE; COU T <<SETW ( 15 )<<SORT EM P1[ I] .DESIG N ATION ; COU T <<SETW ( 10) <<SORT EM P1[ I] .EXP; COU T <<SETW ( 15 )<<SORT EM P1[ I] .AG E; COU T <<EN DL; } COU T <<"PRE SS A N Y KEY TO G O BA CK"; G ET CH( ) ; } } V OID SORTCOD E( ) { CLRSCR( ) ; IN T I,J ; ST RU CT EM PLOY EE TEM P [ M AX] ; F OR( I=0;I< =N U M -1;I++) { SORT EM P1[ I] =EM P[ I] ; } F OR( I=0;I< =N U M -1;I++) { F OR( J =0;J <=N U M -1;J ++) { IF ( SORT EM P1[ I] .CODE< S ORTEM P1 [ J ] .CODE) { T EM P[ I] =SORTEM P1[ I] ; SORT EM P1[ I] =SORTEM P1 [ J ] ; SORT EM P1[ J ] =TEM P[ I] ; }

} } F OR( I=0;I< =N U M -1;I++) { COU T <<" N AM E C ODE DESIG N ATIO N Y EARS( EXP) AG E"; COU T <<" - -- --- -- - --- --- -- --- -- --- -- -- - --- --- -- -- - -- --- -- -- - --- " ; F OR( I=0;I< =N U M -1;I++) { COU T <<SETW ( 13) <<SORT EM P1[ I] .NAM E; COU T <<SETW ( 6 ) <<SORTE M P1[ I] .CODE; COU T <<SETW ( 15 )<<SORT EM P1[ I] .DESIG N ATION ; COU T <<S ETW ( 10) <<SORT EM P1[ I] .EXP; COU T <<SETW ( 15 )<<SORT EM P1[ I] .AG E; COU T <<EN DL; } COU T <<"PRE SS A N Y KEY TO G O BA CK"; G ET CH( ) ; } }

V OID SORTDES( ) { CLRSCR( ) ; IN T I,J ; ST RU CT EM PLOY EE TEM P [ M AX] ; F OR( I=0;I< =N U M -1;I++) { SORT EM P1[ I] =EM P[ I] ; } F OR( I=0; I< =N U M -1;I++)

{ F OR( J =0;J <=N U M -1;J ++) { IF ( ST RCM P( SORTEM P1[ I ] .DESIG N ATION ,SORTEM P1[ J ] .DESIG N AT IO N ) <=0) { T EM P[ I] =SORTEM P1[ I] ; SORT EM P1[ I] =SORTEM P1 [ J ] ; SORT EM P1[ J ] =TEM P[ I] ; } } } F OR( I=0;I< =N U M -1;I++) { COU T <<" N AM E C ODE DE SIG N ATIO N Y EARS( E XP) AGE"; COU T <<" - -- --- -- - --- --- -- --- -- --- -- -- - --- --- -- -- - -- --- -- -- - --- " ; F OR( I=0;I< =N U M -1;I++) { COU T <<SETW ( 13) <<SORT EM P1[ I] .NAM E; COU T <<SETW ( 6 ) <<SORTE M P1[ I] .CODE; COU T <<SETW ( 15 )<<SORT EM P1[ I] .DESIG N ATION ; COU T <<SETW ( 10) <<SORT EM P1[ I] .EXP; COU T <<S ETW ( 15 )<<SORT EM P1[ I] .AG E; COU T <<EN DL; } COU T <<"PRE SS A N Y KEY TO G O BA CK"; G ET CH( ) ; } } V OID SORTAG E( )

{ CLRSCR( ) ; IN T I,J ; ST RU CT EM PLOY EE TEM P [ M AX] ; F OR( I=0;I< =N U M -1;I++) { SORT EM P1[ I] =EM P[ I] ; } F OR( I=0;I< =N U M -1;I++) { F OR( J =0;J <=N U M -1 ;J ++) { IF ( SORT EM P1[ I] .AG E<S ORTEM P1[ J ] .AG E) { T EM P[ I] =SORTEM P1[ I] ; SORT EM P1[ I] =SORTEM P1 [ J ] ; SORT EM P1[ J ] =TEM P[ I] ; } } } F OR( I=0;I< =N U M -1;I++) { COU T <<" N AM E C ODE DE SIG N ATIO N Y EARS( EXP) AGE"; COU T <<" - -- --- -- - --- --- -- --- -- --- -- -- - --- --- -- -- - -- --- -- -- - --- " ; F OR( I=0;I< =N U M -1;I++) { COU T <<SETW ( 13) <<SORT EM P1[ I] .NAM E; COU T <<SETW ( 6 ) <<SORTE M P1[ I] .CODE; COU T <<SETW ( 15 )<<SORT EM P1[ I] .DESIG N ATION ; COU T <<SETW ( 10) <<SORT EM P1[ I] .EXP; COU T <<SETW ( 15 )<<SORT EM P1[ I] .AG E;

COU T <<EN DL; } COU T <<"PRE SS A N Y KE Y TO G O BA CK"; G ET CH( ) ; } }

V OID SORTEXP( ) { CLRSCR( ) ; IN T I,J ; ST RU CT EM PLOY EE TEM P [ M AX] ; F OR( I=0;I< =N U M -1;I++) { SORT EM P1[ I] =EM P[ I] ; } F OR( I=0;I< =N U M -1;I++) { F OR( J =0;J <=N U M -1;J ++) { IF ( SORT EM P1[ I] .EXP<S ORT EM P1[ J ] .EXP) { T EM P[ I] =SORT EM P1[ I] ; SORT EM P1[ I] =SORTEM P1 [ J ] ; SORT EM P1[ J ] =TEM P[ I] ; } } } F OR( I=0;I< =N U M -1;I++) {

COU T <<" N AM E C ODE DE SIG N ATIO N Y EARS( EXP) AGE"; COU T <<" - -- --- -- - --- --- -- --- -- --- -- -- - --- --- -- -- - -- --- -- -- - --- " ; F OR( I=0;I< =N U M -1;I++) { COU T <<SETW ( 13) <<SOR T EM P1[ I] .NAM E; COU T <<SETW ( 6 ) <<SORTE M P1[ I] .CODE; COU T <<SETW ( 15 )<<SORT EM P1[ I] .DESIG N ATION ; COU T <<SETW ( 10) <<SORT EM P1[ I] .EXP; COU T <<SETW ( 15 )<<SORT EM P1[ I] .AG E; COU T <<EN DL; } COU T <<"PRE SS A N Y KEY TO G O BA CK"; G ET CH( ) ; } }
POSTED BY DIVAY AT 12:34 AM

2 COMMENTS:

KAN IKA SAID... PLEZ CAN U ADD FILE HAN DLIN G TO THIS PROG RAM ....OTH ERW ISE ITS THE BEST....SEN D M E THIS PROG RAM TO SW EETKIN N U 05 @G M AIL.COM
AUGUST 2, 2010 6:44 AM

AN ON Y M OU S SAID... T HIS IS A C OPY SOU RC E W ITHOU T COPY RIG HT. IT' S SO CRAP LO L
SEPTEMBER 21, 2010 6:57 AM POST A COMMENT

N EW ER POST OLD ER POST HOM E

SU BSCRIBE T O: P OST COM M EN TS ( ATOM )

O O

2 008 ( 10) J U LY ( 1) J U N E (9 ) !!!... SCH OOL F EE EN QU IRY SY TEM ...!!! !!!... EM PLOY EE M AN A G EM EN T SYSTEM ...!!! !!!HOSPITA L M AN AG EM E N T SY STEM ...!!! !!!... BO OKS LIBR ARY PROJ ECT ...!! ! !!!... V IDEO LIB R ARY ...!!! !!!... SALES M AN A G EM EN T SY STEM ...!!! !!!... RESU LT M A N AG E M EN T SY STEM ...!!! !!!... ELE CTION V OTI N G SOFTW ARE ...!!! !!..W HAT THIS B L OG M EAN T FOR..!!
ABOUT ME

DIVAY VIEW MY COMPLETE PROFILE WHICH COMPLILER/DEBUGGER U USE MOST YOUR FAV. SUBJECT OF ALL TIME IF I=5 THEN ++I + 9 + I = ?? THE BEST C++ BOOK WHICH ACCORDING TO YOU IS MOST DIFFUCULT ENTRANCE EXAM. TO GET THROUGH YOUR ALL TIME FAV PROG. LANG.

YOUR ALL TIME FAV. GAME IS JAVA BETTER THAN C++ THE TOPIC WHICH U FIND DIFFICULT IN C++