Binary search technique works for the sorted list. It is one of the most efficient techniques of searching. It is a technique of searching in ordered list where we first find middle value. Based on the comparison between the middle … Continue reading
1)In the main,declare a pthread_t type variable. 2)Create a thread using pthread_create. prototype:pthread_create(pthread_t*,attributes,void*(function pointer),void*(argument to be passed)); //attributes=0:::if not used 3)Make a function of return type void *; 4)This function would be called as soon as the thread is created. … Continue reading
head 1.19; 2 access; 3 symbols; 4 locks 5 root:1.19; strict; 6 comment @ * @; 7 8 9 1.19 10 date 2014.10.05.10.38.59; author root; state Exp; 11 branches; 12 next 1.18; 13 14 1.18 15 date 2014.10.05.10.38.24; author root; … Continue reading
RCS file: ./server.c,v 3 Working file: ./server.c 4 head: 1.200 5 branch: 6 locks: strict 7 access list: 8 symbolic names: 9 keyword substitution: kv 10 total revisions: 200; selected revisions: 200 11 description: 12 This is the server program … Continue reading