RCS file: ./server1.c,v Working file: ./server1.c head: 1.4 branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 4; selected revisions: 4 description: Server for server-client application. —————————- revision 1.4 date: 2014/08/11 06:59:46; author: root; state: Exp; lines: … Continue reading
RCS file: mdc.c,v Working file: mdc.c head: 1.11 branch: locks: strict root: 1.11 access list: symbolic names: keyword substitution: kv total revisions: 11; selected revisions: 11 description: This is the program for compression of file. —————————- revision 1.11 locked by: … Continue reading
Circular Queue Implementation completed successfully. RCS file: queue_cir.c,v Working file: queue_cir.c head: 1.1 branch: locks: strict root: 1.1 access list: symbolic names: keyword substitution: kv total revisions: 1; selected revisions: 1 description: Implemented the circular queue using arrays. Revision … Continue reading
LINK LIST creation, traversal, insertion(all options) and deletion(all options) completed. RCS file: ll.c,v Working file: ll.c head: 1.7 branch: locks: strict root: 1.7 access list: symbolic names: keyword substitution: kv total revisions: 7; selected revisions: 7 description: SINGLY LINKED LIST … Continue reading
STACK implementation using array completed. RCS file: stack.c,v Working file: stack.c head: 1.4 branch: locks: strict root: 1.4 access list: symbolic names: keyword substitution: kv total revisions: 4; selected revisions: 4 description: STACK MAIN PROGRAM. In initial rev 1.1 – … Continue reading
RCS file: mdc.c,v Working file: mdc.c head: 1.5 branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 5; selected revisions: 5 description: This is the program with an array storing all the present characters in the file. … Continue reading
//HCF and LCM of two nos. #include int main() { int a,b,num1,num2,deno,nume,rem=1,lcm; printf(“\nEnter two nos: “); scanf(“%d %d”,&a,&b); if(a>b) { num1=a; num2=b; } else { num1=b; num2=a; } nume=num1; deno=num2; while(rem!=0) { rem=nume%deno; nume=deno; deno=rem; } printf(“\nHCF: %d “,nume); lcm=(num1*num2)/nume; … Continue reading