*진* 스토어

*진*

개인

팔로워0 팔로우

소개

등록된 소개글이 없습니다.

전문분야 등록된 전문분야가 없습니다.

판매자 정보

학교정보

입력된 정보가 없습니다.

직장정보

입력된 정보가 없습니다.

자격증

입력된 정보가 없습니다.

판매지수

판매중 자료수

2개
전체 판매량

3개
최근 3개월 판매량

0개
자료후기 점수

-
자료문의 응답률

-

전체자료 2개

[프로그래밍] 소켓프로그래밍(클라이언트)

#include #include #include #include #include #include #include #include #define PORT 3490 /* the port client will be connecting to */#define MAXDATASIZE 150 /* max number of bytes we can get at once */int main(int argc, char *argv[]){int sockfd, numbytes,count = 10;char ans[3];char buf[MAXDATASIZE];char msg[MAXDATASIZE];struct hostent *he;struct sockaddr_in their_addr; /* connector's address information */if (argc != 2) {fprintf(stderr,"usage: client hostnamen");exit(1);}if ((he=gethostbyname(argv[1])) == NULL) { /* get the host info */herror("gethostbyname");exit(1);}if ((sockfd = socket(AF_INET, SOCK_STREAM, 0)) == -1) {perror("socket");exit(1);}their_addr.sin_family = AF_INET; /* host byte order */their_addr.sin_port = htons(PORT); /* short, network byte order */their_addr.sin_addr = *((struct in_addr *)he->h_addr);bzero(&(their_addr.sin_zero), 8); /* zero the rest of the struct */if (connect(sockfd, (struct sockaddr *)&their_addr, sizeof(struct sockaddr)) == -1) {perror("connect");exit(1);}/*-------------------------------------------------------------*///3개의 문자열을 입력받는다.if ((numbytes=recv(sockfd,buf, MAXDATASIZE, 0)) == -1) {perror("recv");exit(1);}buf[numbytes] = '';printf("===================n",buf);if(send(sockfd,"send successful",MAXDATASIZE,0)== -1)perror("send");if ((numbytes=recv(sockfd,buf, MAXDATASIZE, 0)) == -1) {perror("recv");exit(1);}buf[numbytes] = '';printf("%s",buf);if(send(sockfd,"send successful",MAXDATASIZE,0)== -1)perror("send");if ((numbytes=recv(sockfd,buf, MAXDATASIZE, 0)) == -1) {perror("recv");exit(1);}buf[numbytes] = '';printf("%s",buf);if(send(sockfd,"send successful",MAXDATASIZE,0)== -1)perror("send");if ((numbytes=recv(sockfd,buf, MAXDATASIZE, 0)) == -1) {perror("recv");exit(1);}buf[numbytes] = '';printf("%sn",buf);if(send(sockfd,"send successful",MAXDATASIZE,0)== -1)perror("send");if ((numbytes=recv(sockfd,buf, MAXDATASIZE, 0)) == -1) {perror("recv");exit(1);}buf[numbytes] = '';printf(" %s %d개의 문자입니다.n",buf,numbytes);if(send(sockfd,"send successful",MAXDATASIZE,0)== -1)perror("send");if ((numbytes=recv(sockfd,buf, MAXDATASIZE, 0)) == -1) {perror("recv");exit(1);}buf[numbytes] = '';printf("%sn",buf);if(send(sockfd,"send successful",MAXDATASIZE,0)== -1)perror("send");/*---------------------------------------------------*/while(count > 0){if ((numbytes=recv(sockfd,buf, MAXDATASIZE, 0)) == -1) {perror("recv");exit(1);}buf[numbytes] = '';printf("n%sn",buf);scanf("%s",ans);msg[0] = ans[0];if(send(sockfd,msg,MAXDATASIZE,0)== -1)perror("send");//검사한 문자열을 받는다.if ((numbytes=recv(sockfd,buf, MAXDATASIZE, 0)) == -1) {perror("recv");exit(1);}buf[numbytes] = '';printf("%sn",buf);if(send(sockfd,"send successful",MAXDATASIZE,0)== -1)perror("send");count--;if (recv(sockfd,buf, MAXDATASIZE, 0) == -1) {perror("recv");exit(1);}if(send(sockfd,"send successful",MAXDATASIZE,0)== -1)perror("send");if(buf[0]=='Y')count = 0;}/*--------------------------------------------------------*/if ((numbytes=recv(sockfd,buf, MAXDATASIZE, 0)) == -1) {perror("recv");exit(1);}buf[numbytes] = '';printf("%sn",buf);if(send(sockfd,"send successful",MAXDATASIZE,0)== -1)perror("send");if ((numbytes=recv(sockfd,buf, MAXDATASIZE, 0)) == -1) {perror("recv");exit(1);}buf[numbytes] = '';printf("%sn",buf);if(send(sockfd,"send successful",MAXDATASIZE,0)== -1)perror("send");if ((numbytes=recv(sockfd,buf, MAXDATASIZE, 0)) == -1) {perror("recv");exit(1);}buf[numbytes] = '';printf("%sn",buf);if(send(sockfd,"send successful",MAXDATASIZE,0)== -1)perror("send");close(sockfd);return 0;}

공학/기술| 2003.11.11| 4페이지| 1,000원| 조회(461)

소켓, 클라이언트, unix

미리보기

닫기
[소스] 소켓프로그래밍(서버)

#include #include #include #include #include #include #include #include #include #define MYPORT 3490#define BACKLOG 10#define MAXDATASIZE 150#define NUM_QUIZ 6main(){int sockfd, new_fd, numbytes, msg_size; /*listen on sock_fd, new connection on new_fd*/struct sockaddr_in my_addr;struct sockaddr_in their_addr;int sin_size;char buf[MAXDATASIZE];char msg[MAXDATASIZE];char * que[NUM_QUIZ] ;char * quiz; //출제된 단어가 들어있는 변수int i,len,count=10;int list[10],right_case = 0;char ans[3]; //입력받은 문자를 넣을 곳if((sockfd=socket(AF_INET, SOCK_STREAM, 0))==-1){perror("socket");exit(1);}my_addr.sin_family = AF_INET;my_addr.sin_port = htons(MYPORT);my_addr.sin_addr.s_addr = INADDR_ANY;bzero(&(my_addr.sin_zero),8);if(bind(sockfd, (struct sockaddr *)&my_addr, sizeof(struct sockaddr))==-1){perror("bind");exit(1);}if(listen(sockfd, BACKLOG)==-1){perror("listen");exit(1);}while(1){ /*main accept() loop*/sin_size=sizeof(struct sockaddr_in);if((new_fd=accept(sockfd, (struct sockaddr *)&their_addr, &sin_size))==-1){perror("accept");continue;}printf("sever: got connection from %sn", inet_ntoa(their_addr.sin_addr));if(!fork()){/*this is the child process*/srand( (unsigned)time( NULL ) );//문제를 낼 문항들을 정리해 둔다.*que = "mother";*(que + 1) ="father";*(que + 2) ="house";*(que + 3) ="student";*(que + 4) ="teacher";*(que + 5) = "school";//임의의 값에 해당하는 문자열을 문제로 낸다.i = rand() % NUM_QUIZ;quiz = que[i];//출제된 문자열의 길이를 구해둔다.len = strlen(quiz);/*시작하는 말을 보낸다(send - 3개)*/if(send(new_fd,"영어 단어 맞추기 게임",30,0) == -1)perror("send");if(recv(new_fd,buf,MAXDATASIZE,0)==-1)perror("recv");if(send(new_fd,"한문자씩 입력하여 단어를 맞추어 보십시오n",42,0) == -1)perror("send");if(recv(new_fd,buf,MAXDATASIZE,0)==-1)perror("recv");if(send(new_fd,"자 이제 시작해 볼까요?n문제입니다.n",47,0) == -1)perror("send");if(recv(new_fd,buf,MAXDATASIZE,0)==-1)perror("recv");if(send(new_fd,"==========================================",50,0)==-1)perror("send");if(recv(new_fd,buf,MAXDATASIZE,0)==-1)perror("recv");/*"____"메시지를 보내다*/for(i=0; i 0 && right_case != len){if(send(new_fd,"한문자를 입력하시오",30,0)==-1)perror("send");//한문자를 입력받는다.if(recv(new_fd,buf,MAXDATASIZE,0)==-1)perror("recv");ans[0] = buf[0];//입력한 문자가 주어진 단어 안에 있는지 검사한다.for( i=0 ; i

공학/기술| 2003.11.11| 4페이지| 1,000원| 조회(599)

프로그래밍, 소켓, unix

미리보기

닫기