Add to Favorites    Make Home Page 3109 Online  
 Language Categories  
 Our Services  

Home » C Home » Games and Graphics Home » Soulution To N-queen's Problem

A D V E R T I S E M E N T

Search Projects & Source Codes:

Title Soulution To N-queen's Problem
Author Onkar Vinayak Deshpande
Author Email onkar_v [at] rediffmail.com
Description
Category C » Games and Graphics
Hits 318436
Code Select and Copy the Code
Code : /* modified final*/ #include<stdio.h> #include<conio.h> #include<graphics.h> #include<dos.h> #include<math.h> #include<process.h> //Functions used void about_prog(); void gotorc ( int, int ) ; void mainmenu ( ) ; void drawbox ( int, int, int, int, int, int ) ; void writechar ( char, int, int, int, int ) ; void writestring ( char*, int, int, int, int, int = 0 ) ; void clrwin ( int=0, int=0, int=25, int=80, int=7, int=0 ) ; void rules ( ) ; void about ( ) ; void quit ( ) ; void back ( ) ; void initmouse(void); void yesmouse(void); void nomouse(void); void mouse(void); void limmouse(int,int,int,int); void background(); void first_screen(); void loadprog(); void acceptsize(); void error_mesg(); int possible_results(); int search_rowcol(); void doneby(); void fill_poly(int,int,int,int,int,int); void draw_chess_board(); void erase(); void drawcircle(); void acceptbymouse(); void acceptbykeyboard(); int placequeen(int,int,int); void diagonal_1_check(int,int,int,int); void diagonal_2_check(int,int,int,int); void column(int,int,int,int); void result(); //Global Variables int exit_p; int chess[50][50]; int placed_row,size,row,col,x,y,radiusx,radiusy,ro,co,text_x=1; int iRow,iCol,iStatus; long int total_no_of_nodes,temp; long int count_exceed; int x_center = 320, y_center = 200, rad = 100,p[100],q[100]; long int count_num=0; union REGS i,o; char far *scr=(char far *) 0xB8000000L ; //screen address char ch, *menu[]= { " *** MENU *** ", " ^Instructions ", " ^Enter Size Of ChessBoard ", " ^Use Mouse To place Queen ", " ^USE Keyboard To Place Queen ", " ^Possible Solutions ", " ^Exit " }; void about_prog() { clrwin ( 0, 0, 25, 80, 0, 3 ) ; drawbox ( 2, 2, 22, 75, 0, 8 ) ; writestring ( "About Program", 30, 2, 14, 0 ) ; writestring ( "* A Classic Combinatorial Problem Is To Place N-Queens on N by N", 3, 4, 11, 0) ; writestring ( "ChessBoard So That No Two 'Attack',that is,so that no two of them ", 5, 6, 11, 0 ) ; writestring ( "are on the same row,column or diagonal.", 5, 8, 11, 0 ) ; writestring ( "* This Problem Is Solved By 'BackTracking',BackTracking is a", 3,10,11, 0 ) ; writestring ( "Algorithmic Strategy.", 5, 12, 15, 0 ) ; writestring ( "* In This Program You Have To Choose a Position On ChessBoard For", 3, 14, 12, 0 ) ; writestring ( "a Queen Then The BackTracking Algorithm Places All N-1 Queens", 5, 16, 12, 0 ) ; writestring ( "On Right Place Satisfing Above Conditions.", 5, 18, 12, 0 ) ; writestring ( "* Number Of All Possible Solutions For Placed Positions Can Be Viewed.", 3, 18, 13, 0 ) ; writestring ( "Press Any Key To Continue", 50, 21, 13, 0 ) ; getch(); } void error_mesg() { int gd=DETECT,gm; initgraph(&gd,&gm,"..\bgi"); cleardevice(); background(); fill_poly(100,200,550,250,12,10); settextstyle(8, HORIZ_DIR, 3); setcolor(15); } void loadprog() { int i; _setcursortype(_NOCURSOR); drawbox ( 10, 30, 13, 50, 2, 0 ) ; writestring ( "Loading.... ", 32, 11, 0, 2, 1 ) ; gotoxy(1,25); textcolor(CYAN); for(i=0;i<79;i++) { cprintf("?"); delay(20); } } void acceptsize() { int i,j; _setcursortype(_NOCURSOR); clrwin ( 0, 0, 25, 80, 0, 1 ) ; do { drawbox ( 10, 20, 14, 65, 2, 0 ) ; writestring ( "ENTER THE SIZE OF CHESSBOARD (4 TO 25): ", 22, 12, 0, 2, 1 ) ; _setcursortype(_NORMALCURSOR); gotorc ( 12,61) ; scanf("%d",&size); _setcursortype(_NOCURSOR); }while(size<4 || size>26); total_no_of_nodes=0; for(j=0;j<size;j++) { temp=1; for(i=0;i<=j;i++) { temp=temp*(size-i); } total_no_of_nodes=total_no_of_nodes+temp; } //total_no_of_nodes=temp; for(i=0;i<size;i++) { for(j=0;j<size;j++) { chess[i][j]=-1; } } radiusy=((479/size))/2-3; radiusx=((479/size))/2-3; } int possible_results() { int gd=DETECT,gm,i,j,ex; char buff[5]; initgraph(&gd,&gm,"..\bgi"); draw_chess_board(); setcolor(10); settextstyle(1,0,3); outtextxy(500,100,"Solution"); outtextxy(500,120,"Number"); sprintf(buff,"%d",count_num+1); outtextxy(500,140,buff); x=y=((getmaxy()/size)/2); for(i=0;i<size;i++) { x=((getmaxy()/size)/2); for(j=0;j<size;j++) { if(chess[i][j]==(i+50)) { setcolor(6); setfillstyle(9,6); fillellipse(x,y,radiusx,radiusy); } x=x+((getmaxy()/size)); } y=y+((getmaxy()/size)); } ex=getch(); if(ex==0) ex=getch(); if(ex==27) { closegraph(); return 1; } closegraph(); return 0; } void cal_positions(int *a,int index,int row,int ptr) { int i,j,b[50],k,placed,l,m,remove; if(exit_p==0) { if(index >= 1) { i=0; j=1; k=0; for(i=1;i<=size;i++) { for(j=0;j<ptr;j++) { if(a[j]==i) break; } if(j==ptr) b[k++]=i; } i=j=0; while(i<index && exit_p==0) { remove=0; if(chess[row][b[i]-1]==-1&& exit_p==0) { chess[row][b[i]-1]=(row+50); diagonal_1_check(row,b[i]-1,row,-1); diagonal_2_check(row,b[i]-1,row,-1); column(row,b[i]-1,row,-1); remove=1; a[ptr]=b[i]; cal_positions(a,index-1,row+1,ptr+1); } if(remove==1 && exit_p==0) { chess[row][b[i]-1]=-1; diagonal_1_check(row,b[i]-1,-1,row); diagonal_2_check(row,b[i]-1,-1,row); column(row,b[i]-1,-1,row); } i++; } } else { exit_p=possible_results(); count_num++; } } } void instructions( ) // RULES { clrwin ( 0, 0, 25, 80, 0, 3 ) ; drawbox ( 2, 2, 21, 75, 0, 8 ) ; writestring ( "INSTRUCTIONS", 30, 2, 12, 0 ) ; writestring ( "YOU CAN USE KEYBOARD OR MOUSE TO PLACE A QUEEN", 5, 4, 11, 0) ; writestring ( "* USING KEYBOARD", 5, 6, 4, 0 ) ; writestring ( " - USE ARROW KEYS TO GO UP,DOWN,LEFT,RIGHT.", 10, 8, 11, 0 ) ; writestring ( " - THEN PRESS ENTER TO PLACE A QUEEN", 10,10,11, 0 ) ; writestring ( "~* USING MOUSE ", 5, 12, 4, 0 ) ; writestring ( "- FIRST LEFTCLICK ON BUTTON 'PLACED' WHICH IS AT RIGHT TOP.", 10, 14, 11, 0 ) ; writestring ( "- THEN SELECT A PLACE ON CHESSBOARD BY RIGHTCLICK. ", 10, 16, 11, 0 ) ; writestring ( "* THEN WAIT FOR FEW MINUTES", 5, 18, 13, 0 ) ; writestring ( "Press Any Key To Continue", 50, 20, 13, 0 ) ; getch(); } void writestring(char*str,int row,int col,int fore, int back, int del ) { //WRITES A STRING TO THE SCREN int x = 30 * del ; // DEL = 1 IF THERE SHOULD BE A DELAY IN DISPLAY // 0 OTHER WISE. IT IS SET TO ZERO BY DEFAULT while ( *str ) { // THE NEXT CHAR WILL BE DISPLAYED IN ATTRIBUTED MANNER if ( *str == '^' ) // HOT KEYS { str++ ; writechar (*str++, row++, col, 1, back ) ; delay ( x ) ; nosound ( ) ; delay ( x ) ; } else if ( *str == 126 ) // HOT KEYS { str++; writechar(*str++, row++, col, 10, back ); delay ( x ) ; nosound ( ) ; delay ( x ) ; } else { writechar (*str++, row++, col, fore, back ) ; delay ( x ) ; nosound ( ) ; delay ( x ) ; } } nosound ( ) ; return ; } void clrwin(int sr,int sc,int er,int ec,int fore, int back) { // CLEARS THE WINDOW WITH THE GIVEN FOREGROUND AND BACKGROUND COLOR i.h.ah=6; i.h.al=0; i.h.ch=sr; i.h.cl=sc; i.h.dh=er; i.h.dl=ec; i.h.bh=back*16+fore; int86(0x10,&i,&i); //clears the screen gotorc ( 0, 0 ) ; //moves the cursor to the appropriate position } void gotorc ( int r, int c ) { // MOVES THE CURSOR TO THE APPROPRIATE LOCATION REGS i, o ; i.h.ah = 2 ; i.h.bh = 0 ; i.h.dh = r ; i.h.dl = c ; int86 ( 16, &i, &o ) ; } void drawbox ( int starty, int startx, int endy, int endx, int color, int shad ) { // FUNCTION TO DRAW THE BOX // JUST STEP THRU THE FUNCTION USING F7 KEY int i, j ; if ( starty > endy || startx > endx || color > 7 ) return ; for ( i = startx ; i < endx ; i ++ ) { for ( j = starty ; j < endy ; j ++ ) writechar ( ' ', i, j, 0, color ) ; writechar ( 219, i + 1, endy, shad, 0 ) ; } for ( i = endy ; i >= starty + 1 ; i -- ) { writechar ( 219, endx, i, shad, 0 ) ; writechar ( 219, endx + 1, i, shad, 0 ) ; } } void writechar(char ch,int row,int col,int fore, int back) { * ( scr + col * 160 + row * 2 ) = ch ; * ( scr + col * 160 + row * 2 + 1 ) = back * 16 + fore ; return ; } void doneby() { int i,j,z,c; int gd=DETECT,gm; initgraph(&gd,&gm,"..\bgi"); x_center = 320, y_center = 200; rad=100; setcolor(13); line(40,70,590,70); setcolor(2); rectangle(50,340,590,420); setcolor(10); settextstyle(5,0,5); outtextxy(55,345,"Onkar V Deshpande"); settextstyle(4,0,3); for(i=1;i<=640;i++) { setcolor(9); line(i,20,i,20); line(i,30,i,30); delay(1); } for(j=10;j<=460;j++) { setcolor(9); line(610,j,610,j); line(620,j,620,j); delay(1); } for( z=640;z>=1;z--) { line(z,435,z,435); line(z,445,z,445); delay(1); } for( c=460;c>=10;c--) { setcolor(9); line(20,c,20,c); line(30,c,30,c); delay(1); } for ( i = 0; i < 10; i++ ) { p[i] = x_center + rad * cos(36*i*3.14159/180); q[i] = y_center + rad * sin(36*i*3.14159/180); } for ( i = 0; i < 10; i++ ) { for ( j = 0; j < 10; j++ ) { setcolor(14); line(p[i],q[i],p[j],q[j]); delay(25); } } delay(500); closegraph(); error_mesg(); outtextxy(250,210, "Thank You"); gotoxy(50,24); printf( "Press Any Key To Exit"); getch(); } void fill_poly(int x1,int y1,int x2,int y2,int color,int style) { int poly[8],i; poly[0] = x1; poly[1] = y1; poly[2] = x2; poly[3] = y1; poly[4] = x2; poly[5] = y2; poly[6] = x1; poly[7] = y2; setfillstyle(style,color); setcolor(color); fillpoly(4, poly); } void background() { int gd=DETECT,gm; initgraph(&gd,&gm,"..\bgi"); fill_poly(0,20,getmaxx(),40,11,11); fill_poly(getmaxx()-40,0,getmaxx()-20,getmaxy(),11,11); fill_poly(0,getmaxy()-40,getmaxx(),getmaxy()-20,11,11); fill_poly(20,0,40,getmaxy(),11,11); } void first_screen() { int i,j,k; fill_poly(125,50,500,100,12,10); settextstyle(10, HORIZ_DIR, 3); setcolor(10); outtextxy(135,50, "N-Queen's Problem"); fill_poly(125,300,500,350,12,10); settextstyle(7, HORIZ_DIR, 3); setcolor(11); outtextxy(135,300, "N-Queen's Problem"); fill_poly(50,50,100,350,12,10); settextstyle(8, 1, 3); setcolor(12); outtextxy(50,55, "N-Queen's Problem"); fill_poly(525,50,575,350,12,10); settextstyle(5, 1, 3); setcolor(13); outtextxy(525,50, "N-Queen's Problem"); gotoxy(50,25); printf("Press any key to continue"); for ( i = 0; i < 10; i++ ) { p[i] = x_center + rad * cos(36*i*3.14159/180); q[i] = y_center + rad * sin(36*i*3.14159/180); } for ( i = 0; i < 10; i++ ) { for ( j = 0; j < 10; j++ ) { setcolor(14); line(p[i],q[i],p[j],q[j]); delay(50); } } getch(); } void initmouse(void) { iRow = 0,iCol = 0,iStatus = 0; asm{ mov ax,0; int 0x33; } } void yesmouse(void) { asm{ mov ax,1; int 0x33; } } void nomouse(void) { asm{ mov ax,2; int 0x33; } } void mouse(void) { asm{ mov ax,3; int 0x33; mov iRow,dx; mov iCol,cx; mov iStatus,bx; } } void limmouse(int iMinX,int iMinY,int iMaxX,int iMaxY) { yesmouse(); asm{ mov ax,7 mov cx,iMinX mov dx,iMaxX int 0x33 } asm{ mov ax,8 mov cx,iMinY mov dx,iMaxY int 0x33 } } void draw_chess_board() { int color1,color2,poly[8],i,j; x=0;y=0; color1=1; color2=0; for(i=0;i<size;i++) { color1=color2; for(j=0;j<size;j++) { if(color1==1) color1=0; else if(color1==0) color1=1; setcolor(2); rectangle(x,y,x+(getmaxy()/size),y+(getmaxy()/size)); poly[0] = x; poly[1] = y; poly[4] = x+(getmaxy()/size); poly[5] = y+(getmaxy()/size); poly[2] = x+(getmaxy()/size); poly[3] = y; poly[6] = x; poly[7] = y+(getmaxy()/size); setcolor(2); if(color1!=0) { setfillstyle(1,color1); fillpoly(4,poly); x=x+getmaxy()/size; } else { rectangle(x,y,x+getmaxy()/size,getmaxy()/size); x=x+getmaxy()/size; } } if(color2==1) color2=0; else if(color2==0) color2=1; x=0; y=y+getmaxy()/size; } } void result() { int gd=DETECT,gm,count,i,j; initgraph(&gd,&gm,"..\bgi"); draw_chess_board(); settextstyle(3,0,4); setcolor(5); outtextxy(500,5,"Solution"); outtextxy(500,50,"Found"); setcolor(2); rectangle(495,150,getmaxx(),479); setcolor(15); settextstyle(1,0,1); outtextxy(500,200,"This Queen Is"); outtextxy(500,220,"Placed By User"); setcolor(4); setfillstyle(10,4); fillellipse(550,180,20,20); setcolor(15); outtextxy(500,300,"These Queens"); outtextxy(500,320,"Are Placed"); outtextxy(500,340,"According to"); outtextxy(500,360,"Queen Placed"); outtextxy(500,380,"By User"); setcolor(6); setfillstyle(9, 6); fillellipse(550,280,20,20); x=y=((getmaxy()/size)/2); for(i=0;i<size;i++) { x=((getmaxy()/size)/2); for(j=0;j<size;j++) { if(chess[i][j]==(i+50)) { if(i==placed_row) { setcolor(4); setfillstyle(10, 4); } else { setcolor(6); setfillstyle(9, 6); } fillellipse(x,y,radiusx,radiusy); } x=x+((getmaxy()/size)); } y=y+((getmaxy()/size)); } getch(); closegraph(); } void erase() { int pixel; pixel=getpixel(x+radiusx+1,y); setcolor(pixel); setfillstyle(1,pixel); fillellipse(x,y,radiusx,radiusy); } void drawcircle() { setcolor(4); setfillstyle(10,4); fillellipse(x,y,radiusx,radiusy); } int search_rowcol() { y=0; for(ro=0;ro<size;ro++) { x=0; for(co=0;co<size;co++) { if(x<iCol && iCol<(x+479/size) && y<iRow && iRow<(y+479/size)) { return 1; } x=x+(479/size); } y=y+(479/size); } return 0; } void acceptbymouse() { int prevx,prevy,break_flag,pressed,valid; int gd=DETECT,gm; initgraph(&gd,&gm,"..\bgi"); draw_chess_board(); initmouse(); limmouse(0,0,getmaxx()-50,getmaxy()); yesmouse(); fill_poly(495,15,605,45,11,1); fill_poly(500,20,600,40,5,1); setcolor(14); settextstyle(5,0,3); outtextxy(525,12,"Place"); setcolor(15); settextstyle(1,0,3); outtextxy(500,100,"To Place"); outtextxy(500,120,"A Queen"); outtextxy(500,140,"LeftClick"); outtextxy(500,160,"On Button"); outtextxy(500,180,"'Placed' "); while(1) { mouse(); if(iStatus==1 && 500<=iCol &&iCol<=605 && 15<=iRow &&iRow<=40) { nomouse(); fill_poly(495,15,605,50,0,1); break; } } prevx=0;prevy=0; fill_poly(500,0,getmaxx(),getmaxy(),0,1); setcolor(15); settextstyle(1,0,3); outtextxy(500,100,"To Place"); outtextxy(500,120,"A Queen"); outtextxy(500,140,"RightClick"); outtextxy(500,160,"On Proper"); outtextxy(500,180,"Place"); while(1) { yesmouse(); mouse(); if(iStatus==2) { break; } valid=search_rowcol(); if(valid==1) { if(prevx<iCol && iCol<(prevx+479/size) && prevy<iRow && iRow<(prevy+479/size)) { nomouse(); setcolor(15); prevx=x;prevy=y; rectangle(x,y,x+(479/size),y+(479/size)); } else { setcolor(2); rectangle(prevx,prevy,prevx+(479/size),prevy+(479/size)); nomouse(); setcolor(15); prevx=x;prevy=y; rectangle(x,y,x+(479/size),y+(479/size)); } yesmouse(); } } nomouse(); x=x+(479/size)/2; y=y+(479/size)/2; drawcircle(); placed_row=ro; placequeen(ro,co,0); delay(1000); closegraph(); } void acceptbykeyboard() { int gd=DETECT,gm,c,i,j; initgraph(&gd,&gm,"..\bgi"); draw_chess_board(); x=(getmaxy()/size)/2; y=(getmaxy()/size)/2; i=0;j=0; drawcircle(); do { c=getch(); if(c==0) c=getch(); if(c==72 && y-(getmaxy()/size)>0) { erase(); y=y-(getmaxy()/size); drawcircle(); i--; } else if(c==80 && y+(getmaxy()/size)<479) { erase(); y=y+(getmaxy()/size); drawcircle(); i++; } else if(c==75&& x-(getmaxy()/size)>0) { erase(); x=x-(getmaxy()/size); drawcircle(); j--; } else if(c==77 &&x+(getmaxy()/size)<479) { erase(); x=x+(getmaxy()/size); drawcircle(); j++; } if(c==13) { drawcircle(); placed_row=i; placequeen(i,j,0); c=27; } }while(c!=27); closegraph(); } int placequeen(int i,int j,int break_up) { int j1; if(break_up==0) { count_exceed++; if(count_exceed>total_no_of_nodes) { error_mesg(); outtextxy(110,210, "Sorry,Solution Is Not Possible !!"); gotoxy(50,24); printf( "Press Any Key To Continue"); getch(); closegraph(); return 1; } for(j1=j;j1<size;j1++) { if(chess[i][j1]==-1) { textcolor(3); gotoxy(text_x++,25); cprintf("?"); chess[i][j1]=(i+50); diagonal_1_check(i,j1,i,-1); diagonal_2_check(i,j1,i,-1); column(i,j1,i,-1); break; } } if(j1==size) { if(i-1!=placed_row) { i--; row--; } else { i=i-2; row=row-2; } for(j=0;j<size;j++) { if(chess[i][j]==(i+50)) break; } chess[i][j]=-1; diagonal_1_check(i,j,-1,i); diagonal_2_check(i,j,-1,i); column(i,j,-1,i); textcolor(0); textbackground(0); gotoxy(--text_x,25); cprintf(" "); break_up=placequeen(row,j+1,0); } } return 0; } void diagonal_1_check(int i1,int j1,int val,int check) { int i2,j2; i2=i1; j2=j1; i2--;j2--; while(i2>=0&&j2>=0) { if(check==chess[i2][j2]) chess[i2][j2]=val; i2--;j2--; } i2=i1; j2=j1; i2++;j2++; while(i2<size&&j2<size) { if(check==chess[i2][j2]) chess[i2][j2]=val; i2++;j2++; } } void diagonal_2_check(int i1,int j1,int val,int check) { int i2,i3,j2; i2=i1; j2=j1; i2--;j2++; while(i2>=0&&j2<size) { if(check==chess[i2][j2]) chess[i2][j2]=val; i2--;j2++; } i2=i1; j2=j1; i2++;j2--; while(i2<size&&j2>=0) { if(check==chess[i2][j2]) chess[i2][j2]=val; i2++;j2--; } } void column(int i1,int j1,int val,int check) { int j2; for(j2=0;j2<size;j2++) { if(chess[i1][j2]==check) { chess[i1][j2]=val; } } for(j2=0;j2<size;j2++) { if(chess[j2][j1]==check) { chess[j2][j1]=val; } } } void main() { int i,j,choice,status,breakup,b[50]; background(); // first_screen(); closegraph(); loadprog(); about_prog(); size=-1; choice=1; do { clrwin ( 0, 0, 25, 80, 0, 1 ) ; drawbox ( 5, 20, 20, 55, 4, 0 ) ; _setcursortype(_NOCURSOR); for ( int i = 0 ; i <= 6 ; i ++ ) { if ( choice == i ) writestring ( menu[i], 20, 7 + 2 * i, 0, 10 ) ; else writestring ( menu[i], 20, 7 + 2 * i, 10, 4 ) ; } status=getch(); if(status==0) status=getch(); switch(status) { case 72:if(choice==1) choice=6; else choice--; break; case 80:if(choice==6) choice=1; else choice++; break; case 13: if(choice==1) instructions(); else if(choice==2) { acceptsize(); } else if(choice==6) { doneby(); exit(0); } else if(size==-1) { error_mesg(); outtextxy(110,210, "First Enter Size Of ChessBoard"); gotoxy(50,24); printf( "Press Any Key To Continue"); getch(); closegraph(); } else if(choice==5) { for(i=0;i<size;i++) { b[i]=0; } exit_p=0; cal_positions(b,size,0,0); } else if(choice==4||choice==3) { if(choice==4) acceptbykeyboard(); else if(choice==3) acceptbymouse(); gotoxy(30,13); textcolor(3); textbackground(1); printf("Placing Please Wait........"); row=0; count_exceed=0; breakup=0; while(row!=size &&breakup==0) { if(row==placed_row) row++; if(row==size) break; breakup=placequeen(row,0,0); row++; } if(breakup==0) { for(i=text_x;i<79;i++) { textcolor(2); cprintf("?"); delay(30); } result(); } } break; } }while(1); } DeleteReplyForwardSpamMove...

Related Source Codes

Script Name Author
The Game Opposite as seen on Nokia 2300 Mobile Manikanta
RECURSIVE BALANCED QUICK SORT ashish
Radix Sort ashish
Change your mouse pointer Ashim
The blinking star Shashank
Data Validation Crylittlebaby
To search a file by giving file type like mp3 or mpeg or doc Prashanth SR
Menus Demonstration B.Chidhambaram
Employee Database Project Using C. Reenku Raman Nayak
Creating a Lexical Analyzer in c fahad bader al-buhairi դ ? ??
Calendar Program Omkar & Devendra
Stop double Process for start in C Cedrik Jurak
Stop double Process for start in C Cedrik Jurak
Time Scheduler Atiq Anwar
A timepass game between atmost two players Rahul Roy

A D V E R T I S E M E N T




Google Groups Subscribe to SourceCodesWorld - Techies Talk
Email:

Free eBook - Interview Questions: Get over 1,000 Interview Questions in an eBook for free when you join JobsAssist. Just click on the button below to join JobsAssist and you will immediately receive the Free eBook with thousands of Interview Questions in an ebook when you join.

New! Click here to Add your Code!


ASP Home | C Home | C++ Home | COBOL Home | Java Home | Pascal Home
Source Codes Home Page

 Advertisements  

Google Search

Google

Source Codes World.com is a part of Vyom Network.

Vyom Network : Web Hosting | Dedicated Server | Free SMS, GRE, GMAT, MBA | Online Exams | Freshers Jobs | Software Downloads | Interview Questions | Jobs, Discussions | Placement Papers | Free eBooks | Free eBooks | Free Business Info | Interview Questions | Free Tutorials | Arabic, French, German | IAS Preparation | Jokes, Songs, Fun | Free Classifieds | Free Recipes | Free Downloads | Bangalore Info | Tech Solutions | Project Outsourcing, Web Hosting | GATE Preparation | MBA Preparation | SAP Info | Software Testing | Google Logo Maker | Freshers Jobs

Sitemap | Privacy Policy | Terms and Conditions | Important Websites
Copyright ©2003-2022 SourceCodesWorld.com, All Rights Reserved.
Page URL: http://www.sourcecodesworld.com/source/show.asp?ScriptID=997


Download Yahoo Messenger | Placement Papers | Free SMS | C Interview Questions | C++ Interview Questions | Quick2Host Review