/* 301.

FILES AND FUNCTIONS --- GET CHARACTER FROM FILE, */ /* STORE IN AN ARRAY, DISPLAY THE THING IF PATTERN EXISTS, LINE BY LINE */ #include<stdio.h> main(int argc, char *argv[]) { FILE *fp1; int n,p=0,m; char a[100]; if(argc!=3) { printf("wrong usage"); return; } fp1=fopen(argv[1],"r"); if(fp1==NULL) { printf("file opening error"); return; } n=line(fp1,a); while(n==1) { m=count(a,argv[2]); if(m==1) { puts(a); p++; } n=line(fp1,a); } printf("PATTERN TOTAL = %d",p); fclose(fp1); } line(fp1,a) FILE *fp1; char a[100]; { int i; for(i=0;(a[i]=fgetc(fp1))!=EOF;i++) { if(a[i]=='\n') { a[i]='\0'; return 1;

} } return 0; } count(a,b) char a[100],b[20]; { int i,j,k; for(i=0;a[i];i++) { for(j=0,k=i;b[j]==a[k]&&b[j]!='\0';j++,k++) ; if(b[j]=='\0') return 1; } return 0; } /* 302. GREP ALL FILES --FILES AND FUNCTIONS --- GET CHARACTER FROM FILE, */ /* STORE IN AN ARRAY, DISPLAY THE THING ALONG WITH LINE NO.IF PATTERN EXISTS, LINE BY LI NE */ #include<stdio.h> main(int argc, char *argv[]) { FILE *fp1; int n,p=0,m,l=0; char a[100]; if(argc!=3) { printf("wrong usage"); return; } fp1=fopen(argv[1],"r"); if(fp1==NULL) { printf("file opening error"); return; } n=line(fp1,a); while(n==1) { l++; m=count(a,argv[2]);

if(m==1) { printf("LINE = %d. ",l); puts(a); p++; } n=line(fp1,a); } printf("PATTERN TOTAL = %d",p); fclose(fp1); } line(fp1,a) FILE *fp1; char a[100]; { int i; for(i=0;(a[i]=fgetc(fp1))!=EOF;i++) { if(a[i]=='\n') { a[i]='\0'; return 1; } } return 0; } count(a,b) char a[100],b[20]; { int i,j,k; for(i=0;a[i];i++) { for(j=0,k=i;b[j]==a[k]&&b[j]!='\0';j++,k++) ; if(b[j]=='\0') return 1; } return 0; } /* 303. GREP ALL FILES --FILES AND FUNCTIONS --- GET CHARACTER FROM FILE, */ /* DISPLAY THE STRING WHEN THE PATTERN IS NOT EXISTING, LINE BY LINE */ #include<stdio.h>

main(int argc, char *argv[]) { FILE *fp1; int n,p=0,m,l=0; char a[100]; if(argc!=3) { printf("wrong usage"); return; } fp1=fopen(argv[1],"r"); if(fp1==NULL) { printf("file opening error"); return; } n=line(fp1,a); while(n==1) { l++; m=count(a,argv[2]); if(m==0) { printf("LINE = %d. ",l); puts(a); } n=line(fp1,a); } fclose(fp1); } line(fp1,a) FILE *fp1; char a[100]; { int i; for(i=0;(a[i]=fgetc(fp1))!=EOF;i++) { if(a[i]=='\n') { a[i]='\0'; return 1; } } return 0; } count(a,b)

char a[100],b[20]; { int i,j,k; for(i=0;a[i];i++) { for(j=0,k=i;b[j]==a[k]&&b[j]!='\0';j++,k++) ; if(b[j]=='\0') return 1; } return 0; } /* 304. SUM OF TWO INTEGER NUMBERS */ main() { int a,*pa,b,*pb,c,*pc; printf("enter the integer no.\n"); scanf("%d%d",&a,&b); pa=&a; pb=&b; *pc=*pa+*pb; printf("SUM IS %d\n",*pc); } /* 305. AREA OF THE CIRCLE */ #define pi 3.14 main() { int r,*pr; float a,*pa; printf("enter the radius.\n"); scanf("%d",&r); pr=&r; pa=&a; *pa=pi*(*pr)*(*pr); printf("AREA IS %f\n",*pa); } /* 306. BIGGEST OF 3 INTEGER NUMBERS */ main() { int a,*pa,b,*pb,c,*pc,d,*pd;

printf("enter the integer no.\n"); scanf("%d%d%d",&a,&b,&c); pa=&a; pb=&b; pc=&c; pd=&d; *pd=(*pa>*pb) ? (*pa>*pc) ? *pa : *pc : *pb > *pc ? *pb : *pc ; printf("BIGGEST IS %d\n",*pd); } /* 307. READ AND DISPLAY THE TEXT */ main() { char a[100],*pa; int i; pa=&a[0]; for(pa=a;(*pa=getchar())!='$';pa++) ; *pa='\0'; for(pa=a;*pa!='\0';pa++) printf("%c",*pa); } /* 308. READ THE TEXT, COUNT THE NUMBER OF UPPER, LOWER, DIGIT, SPECIAL */ main() { char a[100],*pa; int i,u=0,l=0,d=0,s=0; pa=&a[0]; for(pa=a;(*pa=getchar())!='$';pa++) ; *pa='\0'; for(pa=a;*pa!='\0';pa++) { if(*pa>=48&&*pa<=57) d++; else if(*pa>=65&&*pa<=90) u++; else if(*pa>=97&&*pa<=122) l++; else s++; } printf("UPPER=%d,LOWER=%d,DIGIT=%d,SPECIAL=%d",u,l,d,s); }

/* 309. READ THE TEXT, COUNT THE NUMBER OF WORDS, LINES, CHARACTERS */ main() { char a[100],*pa; int i,w=0,l=0,c=0; pa=&a[0]; for(pa=a;(*pa=getchar())!='$';pa++) ; *pa='\0'; for(pa=a;*pa!='\0';pa++) { if(*pa!=' '&&*(pa+1)==' '||*pa!='\t'&&*(pa+1)=='\t'||*pa!='\n'&&*(pa+1)=='\n') w++; if(*pa=='\n') l++; c++; } printf("WORDS=%d,LINES=%d,CHARACTERS=%d",w,l,c); } /*310. READ THE TEXT , COPY TO ANOTHER ARRAY AND PRINT */ main() { char a[100],*pa,b[100],*pb; int i,j; pa=&a[0]; pb=&b[0]; for(pa=a;(*pa=getchar())!='$';pa++) ; *pa='\0'; for(pa=a,pb=b;*pa!='\0';pa++,pb++) *pb=*pa; *pb='\0'; for(pb=b;*pb!='\0';pb++) printf("%c",*pb); } /* 311. READ THE TEXT , COPY LEFT N CHAR TO ANOTHER ARRAY AND PRINT */ main() { char a[100],*pa,b[100],*pb,*pt; int i,j,n; pa=&a[0];

pb=&b[0]; for(pa=a;(*pa=getchar())!='$';pa++) i++; *pa='\0'; pa=a; printf("LENGTH = %d\n",i); printf("enter the n :\n"); scanf("%d",&n); pt= pa+n; for(pa=a,pb=b;pa<pt;pa++,pb++) *pb=*pa; *pb='\0'; for(pb=b;*pb!='\0';pb++) printf("%c",*pb); } /* 312. READ THE TEXT , COPY LEFT N CHAR FROM M TH POSITION TO ANOTHER*/ main() { char a[100],*pa,b[100],*pb,*pm,*pn; int i,j,n,m; pa=&a[0]; pb=&b[0]; for(pa=a;(*pa=getchar())!='$';pa++) i++; *pa='\0'; pa=a; printf("enter the n & m :\n"); scanf("%d%d",&n,&m); pm= pa+m; pn=pm+n; for(pa=pm;pm<pn;pa++,pb++) { *pb=*pa; pm++; } *pb='\0'; for(pb=b;*pb!='\0';pb++) printf("%c",*pb); } /* 313. READ THE TEXT , COPY LAST N CHAR TO ANOTHER*/ main() { char a[100],*pa,b[100],*pb,*pn;

int i,j,n; pa=&a[0]; pb=&b[0]; for(pa=a;(*pa=getchar())!='$';pa++) i++; *pa='\0'; scanf("%d",&n); pn=pa-n; for(pa=pn,pb=b;*pa!='\0';pa++,pb++) *pb=*pa; *pb='\0'; for(pb=b;*pb!='\0';pb++) printf("%c",*pb); } /* 314. READ THE TEXT , CONVERT UPPER TO LOWER */ main() { char a[100],*pa,b[100],*pb; int i,j; pa=&a[0]; pb=&b[0]; for(pa=a;(*pa=getchar())!='$';pa++) ; *pa='\0'; for(pa=a,pb=b;*pa!='\0';pa++,pb++) { if(*pa>=65&&*pa<=90) *pb=*pa+32; else *pb=*pa; } *pb='\0'; for(pb=b;*pb!='\0';pb++) printf("%c",*pb); } /* 315. READ THE TEXT , CONVERT COMMA TO SEMICOLON */ main() { char a[100],*pa,b[100],*pb; int i,j; pa=&a[0]; pb=&b[0]; for(pa=a;(*pa=getchar())!='$';pa++) ;

*pa='\0'; for(pa=a,pb=b;*pa!='\0';pa++,pb++) { if(*pa==',') *pb=';'; else *pb=*pa; } *pb='\0'; for(pb=b;*pb!='\0';pb++) printf("%c",*pb); } /* 316. READ THE TEXT , DELETE COMMA */ main() { char a[100],*pa,b[100],*pb; int i,j; pa=&a[0]; pb=&b[0]; for(pa=a;(*pa=getchar())!='$';pa++) ; *pa='\0'; for(pa=a,pb=b;*pa!='\0';pa++) { if(*pa==',') ; else { *pb=*pa; pb++; } } *pb='\0'; for(pb=b;*pb!='\0';pb++) printf("%c",*pb); } /* 317. READ THE TEXT , REVERSE THE TEXT */ main() { char a[100],*pa,b[100],*pb; int i,j; pa=&a[0]; pb=&b[0]; for(pa=a;(*pa=getchar())!='$';pa++)

; *pa='\0'; for(pa--,pb=b;pa>=a;pa--) { *pb=*pa; pb++; } *pb='\0'; for(pb=b;*pb!='\0';pb++) printf("%c",*pb); } /* 318. READ THE TEXT , MERGE TWO ARRAYS */ main() { char a[100],*pa,b[100],*pb,c[200],*pc; pa=&a[0]; pb=&b[0]; pc=&c[0]; for(pa=a;(*pa=getchar())!='$';pa++) ; *pa='\0'; for(pb=b;(*pb=getchar())!='$';pb++) ; *pb='\0'; for(pa=a,pc=c;*pa!='\0';pa++,pc++) *pc=*pa; for(pb=b;*pb!='\0';pb++,pc++) *pc=*pb; *pc='\0'; for(pc=c;*pc!='\0';pc++) printf("%c",*pc); } /* 319. STORE THE STARTING ADDRESS OF EACH LINE IN ARRAY AND PRINT */ main() { char a[100],*pa,*b[20]; int j; pa=&a[0]; for(pa=a;(*pa=getchar())!='$';pa++) ; *pa='\0'; for(pa=a,j=0,b[j++]=&a[0];*pa!='\0';pa++) {

if(*pa=='\n') { b[j]=pa+1; j++; } } b[j]='\0'; for(j=0;b[j]!='\0';j++) printf("%u\n",b[j]); } /* 320. STORE THE STARTING ADDRESS OF EACH LINE IN ARRAY */ /* DISPLAY N TH LINE */ main() { char a[100],*pa,*b[20]; int n,j; pa=&a[0]; for(pa=a;(*pa=getchar())!='$';pa++) ; *pa='\0'; for(pa=a,j=0,b[j++]=&a[0];*pa!='\0';pa++) { if(*pa=='\n') { b[j]=pa+1; j++; } } b[j]='\0'; printf("enter the n th line to be displayed:\n"); scanf("%d",&n); for(pa=b[n-1];*pa!='\n';pa++) printf("%c",*pa); } /* 321. STORE THE STARTING ADDRESS OF EACH LINE IN ARRAY */ /* DISPLAY N TH LINE TO M TH LINE */ main() { char a[100],*pa,*b[20],*pt; int n,j=0,m; pa=&a[0]; for(pa=a;(*pa=getchar())!='$';pa++) ; *pa='\0';

for(pa=a,j=0,b[j++]=&a[0];*pa!='\0';pa++) { if(*pa=='\n') { b[j]=pa+1; j++; } } b[j]='\0'; printf("enter the n & m :\n"); scanf("%d%d",&n,&m); for(pa=b[n-1],pt=b[m];pa<pt;pa++) printf("%c",*pa); } /* 322. STORE THE STARTING ADDRESS OF EACH LINE a POINTER ARRAY & PRINT IT */ main() { char a[100],*pa,*b[20],**pb; int n,j=0,m; pa=&a[0]; pb=&b[0]; for(pa=a;(*pa=getchar())!='$';pa++) ; *pa='\0'; for(pa=a,*pb=a,pb++;*pa!='\0';pa++) { if(*pa=='\n') { *pb=pa+1; pb++; } } *pb='\0'; for(pb=b;*pb!='\0';pb++) printf(" %u\n ",*pb); } /* 323. STORE THE STARTING ADDRESS OF EACH LINE IN A POINTER ARRAY & PRINT IT */ /* DISPLAY N TH LINE */ main() { char a[100],*pa,*b[20],**pb; int n,i=0,j=0,m;

pa=&a[0]; pb=&b[0]; for(pa=a;(*pa=getchar())!='$';pa++) ; *pa='\0'; for(pa=a,*pb=a,pb++;*pa!='\0';pa++) { if(*pa=='\n') { i++; *pb=pa+1; pb++; } } *pb='\0'; pb=b; printf("NO OF LINES:%d\nENTER THE N TH LINE :\n",i); scanf("%d",&n); for(pa=*(pb+(n-1));*pa!='\n';pa++) printf("%c",*pa); } /* 324. STORE THE STARTING ADDRESS OF EACH LINE IN A POINTER ARRAY & PRINT IT */ /* DISPLAY N TH TO M TH LINE */ main() { char a[100],*pa,*b[20],**pb,*pt; int n,i=0,j=0,m; pa=&a[0]; pb=&b[0]; for(pa=a;(*pa=getchar())!='$';pa++) ; *pa='\0'; for(pa=a,*pb=a,pb++;*pa!='\0';pa++) { if(*pa=='\n') { i++; *pb=pa+1; pb++; } } *pb='\0'; pb=b; printf("NO OF LINES:%d\nENTER THE N & M :\n",i);

scanf("%d%d",&n,&m); for(pa=*(pb+(n-1)),pb=b,pt=*(pb+m);pa<pt;pa++) printf("%c",*pa); } /* 325. COUNT THE NUMBER OF TIMES PATTERN EXISTS */ main() { char a[100],*pa,b[20],*pb,*pc; int p=0; pa=&a[0]; pb=&b[0]; printf("ENTER THE TEXT:\n"); for(pa=a;(*pa=getchar())!='$';pa++) ; *pa='\0'; for(pb=b;(*pb=getchar())!='$';pb++) ; *pb='\0'; for(pa=a,pb=b;*pa!='\0';pa++) { for(pc=pa,pb=b;*pc==*pb&&*pb!='\0';pb++,pc++) ; if(*pb=='\0') p++; } printf("PATTERN TOTAL = %d\n",p); } /* 326. DELETE PATTERN */ main() { char a[100],*pa,b[20],*pb,*pc,d[100],*pd; int p=0; pa=&a[0]; pb=&b[0]; pd=&d[0]; printf("ENTER THE TEXT:\n"); for(pa=a;(*pa=getchar())!='$';pa++) ; *pa='\0'; for(pb=b;(*pb=getchar())!='$';pb++) ; *pb='\0'; for(pa=a,pb=b;*pa!='\0';pa++)

{ for(pc=pa,pb=b;*pc==*pb&&*pb!='\0';pb++,pc++) ; if(*pb=='\0') pa=--pc; else { *pd=*pa; pd++; } } for(pd=d;*pd!='\0';pd++) printf("%c",*pd); } /* 327. REPLACE PATTERN */ main() { char a[100],*pa,b[20],*pb,*pc,d[100],*pd,e[20],*pe; int p=0; pa=&a[0]; pb=&b[0]; pd=&d[0]; pe=&e[0]; printf("ENTER THE TEXT:\n"); for(pa=a;(*pa=getchar())!='$';pa++) ; *pa='\0'; for(pb=b;(*pb=getchar())!='$';pb++) ; *pb='\0'; for(pe=e;(*pe=getchar())!='$';pe++) ; *pe='\0'; for(pa=a,pb=b;*pa!='\0';pa++) { for(pc=pa,pb=b;*pc==*pb&&*pb!='\0';pb++,pc++) ; if(*pb=='\0') { for(pe=e;*pe!='\0';pe++) { *pd=*pe; pd++; } }

else { *pd=*pa; pd++; } } for(pd=d;*pd!='\0';pd++) printf("%c",*pd); } /* 328. STORE THE VALUE OF A IN FUNCTION AND DISPLAY IT IN MAIN */ /* FUNCTIONS AND POINTERS */ main() { int a; pass(&a); printf("THE VALUE IS %d",a); } pass(int *a) { *a=10; return *a; } /* 329. STORE TWO VALUES A & B IN FUNCTION AND DISPLAY IT IN MAIN */ /* FUNCTIONS AND POINTERS */ main() { int a,b; pass(&a,&b); printf("THE VALUE IS A=%d, B= %d ",a,b); } pass(int *a,int *b) { *a=10,*b=20; } /* 330. READ TWO VALUES A & B IN MAIN SWAP IN FUNCTION AND DISPLAY IT IN MAIN */ /* FUNCTIONS AND POINTERS */ main() { int a,b; printf("enter the numbers:\n"); scanf("%d%d",&a,&b);

printf("BEFORE SWAP, THE VALUE OF A=%d, B=%d\n",a,b); swap(&a,&b); printf("AFTER SWAP, THE VALUE OF A=%d, B= %d ",a,b); } swap(int *a,int *b) { int t; t=*a; *a=*b; *b=t; } /* 331. READ RADIUS IN MAIN, FIND AREA IN FUNCTION DISPLAY IT IN MAIN */ /* FUNCTIONS AND POINTERS */ #define pi 3.14 main() { int r; float a; printf("enter the radius:\n"); scanf("%d",&r); area(r,&a); printf("THE VALUE OF A = %f\n",a); } area(int r,float *a) { *a=pi*r*r; } /* 332. READ THREE NO.S A, B, C IN MAIN CALCULATE BIGGEST IN FUNCTION /* AND DISPLAY IT IN MAIN ,FUNCTIONS AND POINTERS */ main() { int a,b,c,d; printf("enter the numbers:\n"); scanf("%d%d%d",&a,&b,&c); biggest(&a,&b,&c,&d); printf("THE BIGGEST IS %d",d); } biggest(int *a,int *b,int *c,int *d) { *d = *a > *b ? *a > *c ? *a : *c : *b > *c ? *b : *c ; }

/* 333. READ THREE NO.S A, B, C , CALCULATE BIGGEST & SMALLEST IN FUNCTION /* AND DISPLAY IT IN MAIN ,FUNCTIONS AND POINTERS */ main() { int a,b,c,d,e; printf("enter the numbers:\n"); scanf("%d%d%d",&a,&b,&c); biggest(&a,&b,&c,&d,&e); printf("THE BIGGEST IS %d\n SMALLEST IS %d\n",d,e); } biggest(int *a,int *b,int *c,int *d,int *e) { *d = *a > *b ? *a > *c ? *a : *c : *b > *c ? *b : *c ; *e = *a < *b ? *a < *c ? *a : *c : *b < *c ? *b : *c ; } /* 334. FUNCTIONS AND POINTERS -- READ AND DISPLAY TEXT */ main() { char a[100]; read(a); display(a); } read(char *x) { printf("in function *x=%c *x=%u \nx =%c x=%u\n",*x,*x,x,x); for(;(*x=getchar())!='$';x++) ; *x='\0'; } display(char *y) { for(;*y!='\0';y++) printf("%c",*y); } /* 335. FUNCTIONS AND POINTERS -- READ AND COUNT UPPER, LOWER, DIGIT, SPECIAL* / main() { char a[100]; int u=0,l=0,d=0,s=0; read(a); count(a,&u,&l,&d,&s); printf("UPPER = %d,LOWER=%d,DIGIT=%d,SPECIAL=%d\n",u,l,d,s); }

read(char *x) { printf("enter the text:\n"); for(;(*x=getchar())!='$';x++) ; *x='\0'; } count(char *y,int *u,int *l,int *d,int *s) { for(;*y!='\0';y++) { if(*y>=48&&*y<=57) (*d)++; else if(*y>=65&&*y<=90) (*u)++; else if(*y>=97&&*y<=122) (*l)++; else (*s)++; } } /* 336. FUNCTIONS AND POINTERS -- READ AND COUNT WORDS, LINES, CHARACTERS */ main() { char a[100]; int w=0,l=0,c=0; read(a); count(a,&w,&l,&c); printf("WORDS = %d, LINES=%d, CHARACTERS=%d\n",w,l,c); } read(char *x) { printf("enter the text:\n"); for(;(*x=getchar())!='$';x++) ; *x='\0'; } count(char *y,int *w,int *l,int *c) { for(;*y!='\0';y++) { if(*y!=' '&&*(y+1)==' '||*y!='\t'&&*(y+1)=='\t'||*y!='\n'&&*(y+1)=='\n') (*w)++; if(*y=='\n') (*l)++;

(*c)++; } } /* 337. FUNCTIONS, ARRAYS AND POINTERS -- READ TEXT, COPY TO ANOTHER */ main() { char a[100],b[100]; read(a); copy(a,b); puts(b); } read(char *x) { printf("enter the text:\n"); for(;(*x=getchar())!='$';x++) ; *x='\0'; } copy(char *a,char *b) { for(;*a!='\0';a++,b++) *b=*a; *b='\0'; } /* 338. FUNCTIONS, ARRAYS AND POINTERS -- READ TEXT, COPY LEFT N CHAR */ main() { char a[100],b[100]; int n; read(a); printf("enter n:\n"); scanf("%d",&n); copy(a,&b,n); puts(b); } read(char *x) { printf("enter the text:\n"); for(;(*x=getchar())!='$';x++) ; *x='\0'; } copy(char *a,char *b,int n)

{ char *p; p=a; p=p+n; for(;a<p;a++,b++) *b=*a; *b='\0'; } /* 339. FUNCTIONS, ARRAYS AND POINTERS-READ TEXT, COPY LEFT N CHAR FROM M TH */ main() { char a[100],b[100]; int n,m; read(a); printf("enter n & m :\n"); scanf("%d%d",&n,&m); copy(a,&b,n,m); puts(b); } read(char *x) { printf("enter the text:\n"); for(;(*x=getchar())!='$';x++) ; *x='\0'; } copy(char *a,char *b,int n,int m) { char *p,*q; p=a; p=p+m; q=p+n; for(a=p;a<q;a++,b++) *b=*a; *b='\0'; } /* 340. FUNCTIONS,ARRAYS, POINTERS-READ TEXT, COPY LAST N CHAR */ main() { char a[100],b[100]; int n; read(a); printf("enter n :\n"); scanf("%d",&n); copy(a,&b,n);

puts(b); } read(char *x) { printf("enter the text:\n"); for(;(*x=getchar())!='$';x++) ; *x='\0'; } copy(char *a,char *b,int n) { char *p; int t; t=length(a); printf("length of a = %d",t); p=a; p=p+t-n; for(a=p;*a!='\0';a++,b++) *b=*a; *b='\0'; } length(char *a) { int i; for(i=0;*a!='\0';a++) i++; return i; } }/* 341. FUNCTIONS,ARRAYS, POINTERS-READ TEXT, REVERSE TEXT */ main() { char a[100],b[100]; int n; read(a); reverse(a,&b); puts(b); } read(char *x) { printf("enter the text:\n"); for(;(*x=getchar())!='$';x++) ; *x='\0'; }

reverse(char *a,char *b) { char *p; int t; t=length(a); printf("length of a = %d",t); p=a; a=a+t; for(--a;a>=p;a--,b++) *b=*a; *b='\0'; } length(char *a) { int i; for(i=0;*a!='\0';a++) i++; return i; } } /* 342. FUNCTIONS, ARRAYS AND POINTERS -- MERGE TWO ARRAYS */ char a[100],b[100],c[200]; main() { read(a); read(b); merge(a,c); merge(b,c); puts(c); } read(char *x) { printf("enter the text:\n"); for(;(*x=getchar())!='$';x++) ; *x='\0'; } merge(char *a,char *c) { int m; m=length(c); for(c=c+m;*a;a++,c++) *c=*a; *c='\0';

} length(char *c) { int k; for(k=0;*c;c++) k++; return k; } /* 343. FUNCTIONS, ARRAYS AND POINTERS-CONVERT UPPER T O LOWER */ main() { char a[100],b[100]; read(a); lower(a,&b); puts(b); } read(char *x) { printf("enter the text:\n"); for(;(*x=getchar())!='$';x++) ; *x='\0'; } lower(char *a,char *b) { for(;*a!='\0';a++,b++) { if(*a>=65 && *a<=90) *b=*a+32; else *b=*a; } *b='\0'; } /* 344. FUNCTIONS, ARRAYS AND POINTERS-CONVERT COMMA T O SEMICOLON */ main() { char a[100],b[100]; read(a); semi(a,&b); puts(b); }

read(char *x) { printf("enter the text:\n"); for(;(*x=getchar())!='$';x++) ; *x='\0'; } semi(char *a,char *b) { for(;*a!='\0';a++,b++) { if(*a==',') *b=';'; else *b=*a; } *b='\0'; } /* 345. FUNCTIONS, ARRAYS AND POINTERS - DELETE COMMA*/ main() { char a[100],b[100]; read(a); delete(a,&b); puts(b); } read(char *x) { printf("enter the text:\n"); for(;(*x=getchar())!='$';x++) ; *x='\0'; } delete(char *a,char *b) { for(;*a!='\0';a++) { if(*a==',') ; else { *b=*a; b++; } }

*b='\0'; } /* 346. FUNCTIONS, ARRAYS AND POINTERS */ /* STORE THE STARTING ADDRESS OF EACH LINE IN ARRAY & DISPLAY */ main() { char a[100],*b[20]; read(a); store(a,b); print(b); } read(char *x) { printf("enter the text:\n"); for(;(*x=getchar())!='$';x++) ; *x='\0'; } store(char *a,char **b) { for(*b=a,b++;*a!='\0';a++) { if(*a=='\n') { *b=a+1; b++; } } *b='\0'; } print(b) char **b; { for(;*b!='\0';b++) printf("%u\n",*b); } /* 347. FUNCTIONS, ARRAYS AND POINTERS */ /* STORE THE STARTING ADDRESS in ARRAY & DISPLAY N TH LINE */ main() { char a[100],*b[20]; int n; read(a); scanf("%d",&n); store(a,b); print(a,b,n);

} read(char *x) { printf("enter the text:\n"); for(;(*x=getchar())!='$';x++) ; *x='\0'; } store(char *a,char **b) { for(*b=a,b++;*a!='\0';a++) { if(*a=='\n') { *b=a+1; b++; } } *b='\0'; } print(char *a,char **b,int n) { char *p; p=b[n-1]; for(a=p;*a!='\n';a++) printf("%c",*a); } /* 348. FUNCTIONS, ARRAYS AND POINTERS */ /* STORE THE STARTING ADDRESS in ARRAY & DISPLAY N TH TO M TH LINE */ main() { char a[100],*b[20]; int n,m; read(a); printf("ENTER N & M:\n"); scanf("%d%d",&n,&m); store(a,b); print(a,b,n,m); } read(char *x) { printf("enter the text:\n"); for(;(*x=getchar())!='$';x++) ;

*x='\0'; } store(char *a,char **b) { for(*b=a,b++;*a!='\0';a++) { if(*a=='\n') { *b=a+1; b++; } } *b='\0'; } print(char *a,char **b,int n,int m) { char *p,*q; p=b[n-1]; q=b[m]; for(a=p;a<q;a++) printf("%c",*a); } /* 349. COUNT THE PATTERN */ main() { char a[100],b[100]; int n=0; printf("enter the text & then pattern :\n"); read(a); read(b); n=pattern(a,b); printf("PATTERN TOTAL = %d\n",n); } read(a) char *a; { for(;(*a=getchar())!='$';a++) ; *a='\0'; } pattern(char *a, char *b) { char *p,*q; int n=0; for(;*a!='\0';a++)

{ for(p=a,q=b;*q==*p&&*q!='\0';p++,q++) ; if(*q=='\0') n++; } return n; } /* 350. DELETE THE PATTERN */ main() { char a[100],b[20],c[100]; int n=0; printf("enter the text & then pattern :\n"); read(a); read(b); delete(a,b,c); puts(c); } read(a) char *a; { for(;(*a=getchar())!='$';a++) ; *a='\0'; } delete(char *a, char *b,char *c) { char *p,*q; for(;*a!='\0';a++) { for(p=a,q=b;*q==*p&&*q!='\0';p++,q++) ; if(*q=='\0') a=--p; else { *c=*a; c++; } } *c='\0'; }

/* 351. FUNCTIONS AND STRUCTURES */ /* READ AND DISPLAY BIO DATA */ struct bio { char name[20],address[40]; int age; float salary; }; main() { typedef struct bio BIO; BIO a; scanf("%s%d%f%s",a.name,&a.age,&a.salary,a.address); print(a); } print(a) struct bio a; { printf("%s\n%d\n%f\n%s\n",a.name,a.age,a.salary,a.address); } /* 352. FUNCTIONS AND STRUCTURES */ /* AREA OF THE CIRCLE */ #define pi 3.14 struct area { int r; float a; }; main() { typedef struct area AREA; AREA x; scanf("%d",&x.r); print(x); } print(x) struct area x; { x.a=pi*x.r*x.r; printf("AREA IS %f\n",x.a); }

/* 353. FUNCTIONS AND STRUCTURES */ /* BIGGEST OF THREE NUMBERS */ struct biggest { int a,b,c,d; }; main() { typedef struct biggest BIGGEST; BIGGEST x; printf("enter the numbers:\n"); scanf("%d%d%d",&x.a,&x.b,&x.c); big(x); } big(x) struct biggest x; { x.d = x.a > x.b ? x.a > x.c ? x.a : x.c : x.b > x.c ? x.b : x.c ; printf("BIGGEST IS %d\n",x.d); } /* 354. FUNCTIONS AND STRUCTURE POINTER */ /* READ AND DISPLAY BIODATA */ struct bio { char name[20],address[40]; int age; float salary; }; main() { typedef struct bio BIO; BIO a; read(&a); print(&a); } read(a) struct bio *a; { scanf("%s%d%f%s",(*a).name,&(*a).age,&(*a).salary,(*a).address); } print(a) struct bio *a; { printf("%s\n%d\n%f\n%s\n",(*a).name,(*a).age,(*a).salary,(*a).address); }

/* 355. FUNCTIONS AND STRUCTURE POINTER */ /* AREA OF THE CIRCLE */ #define pi 3.14 struct area { int r; float a; }; main() { typedef struct area AREA; AREA x; read(&x); find(&x); print(&x); } read(x) struct area *x; { scanf("%d",&(*x).r); } find(x) struct area *x; { (*x).a=pi*(*x).r*(*x).r; } print(x) struct area *x; { printf("AREA IS %f\n",(*x).a); }

/* 356. FUNCTIONS AND STRUCTURE POINTERS */ /* BIGGEST OF THREE NUMBERS */ struct biggest { int a,b,c,d; }; main() {

typedef struct biggest BIGGEST; BIGGEST x; read(&x); find(&x); print(&x); } read(x) struct biggest *x; { printf("enter the numbers:\n"); scanf("%d%d%d",&(*x).a,&(*x).b,&(*x).c); } find(x) struct biggest *x; { (*x).d=(*x).a>(*x).b?(*x).a>(*x).c?(*x).a:(*x).c:(*x).b>(*x).c?(*x).b:(*x).c; } print(x) struct biggest *x; { printf("BIGGEST IS %d\n",(*x).d); }

/* 357. FUNCTIONS AND STRUCTURE POINTER REPLACING * . BY -> */ /* READ AND DISPLAY BIO DATA */ struct bio { char name[20],address[40]; int age; float salary; }; main() { typedef struct bio BIO; BIO a; read(&a); print(&a); } read(a) struct bio *a; {

scanf("%s%d%f%s",a->name,&a->age,&a->salary,a->address); } print(a) struct bio *a; { printf("%s\n%d\n%f\n%s\n",a->name,a->age,a->salary,a->address); } /* 358. FUNCTIONS AND STRUCTURE POINTER REPLACING (* .) BY ( -> ) */ /* AREA OF THE CIRCLE */ #define pi 3.14 struct area { int r; float a; }; main() { typedef struct area AREA; AREA x; read(&x); find(&x); print(&x); } read(x) struct area *x; { scanf("%d",&x->r); } find(x) struct area *x; { x->a=pi*x->r*x->r; } print(x) struct area *x; { printf("AREA IS %f\n",x->a); }

/* 359. FUNCTIONS AND STRUCTURE POINTERS */ /* BIGGEST OF THREE NUMBERS */

struct biggest { int a,b,c,d; }; main() { typedef struct biggest BIGGEST; BIGGEST x; read(&x); find(&x); print(&x); } read(x) struct biggest *x; { printf("enter the numbers:\n"); scanf("%d%d%d",&x->a,&x->b,&x->c); } find(x) struct biggest *x; { x->d = x->a > x->b ? x->a > x->c ? x->a : x->c : x->b > x->c ? x->b : x->c ; } print(x) struct biggest *x; { printf("BIGGEST IS %d\n",x->d); }

/* 360. FILES, FUNCTIONS AND STRUCTURE POINTER BY -> */ /* READ BIO DATA FROM KEYBOARD AND WRITE IT IN FILE */ #include<stdio.h> struct bio { char name[20],address[40]; int age; float salary; }; main(int argc,char *argv[]) { FILE *fp1; typedef struct bio BIO; BIO a; if(argc!=2)

{ printf("wrong usage"); return; } fp1=fopen(argv[1],"w"); if(fp1==NULL) { printf("FILE OPENING ERROR"); return; } read(&a); print(fp1,&a,sizeof(struct bio)); fclose(fp1); } read(a) struct bio *a; { scanf("%s%d%f%s",a->name,&a->age,&a->salary,a->address); } print(fp1,a,m) FILE *fp1; struct bio *a; int m; { char *pa; int i; pa=(char *)a; for(i=0;i<m;i++) { putc(*pa,fp1); pa++; } } /* 361. FILES, FUNCTIONS AND STRUCTURE POINTER BY -> */ /* READ BIO DATA FROM FILE AND DISPLAY ON SCREEN */ #include<stdio.h> struct bio { char name[20],address[40]; int age; float salary; }; main(int argc,char *argv[]) { FILE *fp1; typedef struct bio BIO;

BIO a; if(argc!=2) { printf("wrong usage"); return; } fp1=fopen(argv[1],"r"); if(fp1==NULL) { printf("FILE OPENING ERROR"); return; } read(fp1,&a,sizeof(struct bio)); print(&a); fclose(fp1); } read(fp1,a,m) FILE *fp1; struct bio *a; int m; { char *pa; int i; pa=(char *)a; for(i=0;i<m;i++) { *pa=getc(fp1); pa++; } } print(a) struct bio *a; { printf("%s\n%d\n%f\n%s\n",a->name,a->age,a->salary,a->address); } /* 362. FILES, FUNCTIONS AND STRUCTURE POINTER BY -> */ /* READ BIO DATA FROM KEYBOARD UNTIL '$' AND WRITE IT IN FILE */ #include<stdio.h> struct bio { char name[20],address[40]; int age; float salary; }; main(int argc,char *argv[]) {

FILE *fp1; typedef struct bio BIO; BIO a; int i; if(argc!=2) { printf("wrong usage"); return; } fp1=fopen(argv[1],"w"); if(fp1==NULL) { printf("FILE OPENING ERROR"); return; } i=read(&a); while(i==1) { print(fp1,&a,sizeof(struct bio)); i=read(&a); } fclose(fp1); } read(a) struct bio *a; { scanf("%s",a->name); if(a->name[0]!='$') { scanf("%d%f%s",&a->age,&a->salary,a->address); return 1; } else return 0; } print(fp1,a,m) FILE *fp1; struct bio *a; int m; { char *pa; int i; pa=(char *)a; for(i=0;i<m;i++) { putc(*pa,fp1);

pa++; } } /* 363. FILES, FUNCTIONS AND STRUCTURE POINTER BY -> */ /* READ BIO DATA FROM FILE UNTIL EOF AND DISPLAY ON SCREEN */ #include<stdio.h> struct bio { char name[20],address[40]; int age; float salary; }; main(int argc,char *argv[]) { FILE *fp1; typedef struct bio BIO; BIO a; if(argc!=2) { printf("wrong usage"); return; } fp1=fopen(argv[1],"r"); if(fp1==NULL) { printf("FILE OPENING ERROR"); return; } read(fp1,&a,sizeof(struct bio)); while(feof(fp1)==0) { print(&a); read(fp1,&a,sizeof(struct bio)); } fclose(fp1); } read(fp1,a,m) FILE *fp1; struct bio *a; int m; { char *pa; int i; pa=(char *)a; for(i=0;i<m;i++) {

*pa=fgetc(fp1); pa++; } return 1; } print(a) struct bio *a; { printf("%s\n%d\n%f\n%s\n",a->name,a->age,a->salary,a->address); /* 364. FILES, FUNCTIONS AND STRUCTURE POINTER BY -> */ /* READ BIO DATA FROM FILE AND DISPLAY NTH RECORD ON SCREEN */ #include<stdio.h> union xyz { struct bio { char name[20],address[40]; int age; float salary; }a; char b[sizeof(struct bio)]; }; main(int argc,char *argv[]) { FILE *fp1; union xyz m; typedef struct bio BIO; BIO a; int i,n,ln=0; if(argc!=2) { printf("wrong usage"); return; } fp1=fopen(argv[1],"r"); if(fp1==NULL) { printf("FILE OPENING ERROR"); return; } printf("enter the n th record to be displayed:\n"); scanf("%d",&n); ln=(n-1)*sizeof(struct bio); fseek(fp1,ln,0);

read(fp1,&a,sizeof(struct bio)); print(&a); fclose(fp1); } read(fp1,a,m) FILE *fp1; struct bio *a; int m; { char *pa; int i; pa=(char *)a; for(i=0;i<=m;i++) { *pa=getc(fp1); pa++; } } print(a) struct bio *a; { printf("%s\n%d\n%f\n%s\n",a->name,a->age,a->salary,a->address); } /* 365. FILES, FUNCTIONS AND STRUCTURE POINTER BY -> */ /* EDIT THE RECORD - READ BIO DATA FROM FILE AND DISPLAY NTH RECORD ON SCREEN READ BIODATA FROM KEYBOARD AND REPLACE THE RECORD */ #include<stdio.h> union xyz { struct bio { char name[20],address[40]; int age; float salary; }a; char b[sizeof(struct bio)]; }; main(int argc,char *argv[]) { FILE *fp1; union xyz m; typedef struct bio BIO; BIO a; int i,n,ln; if(argc!=2)

{ printf("wrong usage"); return; } fp1=fopen(argv[1],"r+"); if(fp1==NULL) { printf("FILE OPENING ERROR"); return; } printf("enter the n th record to be edited:\n"); scanf("%d",&n); ln=(n-1)*sizeof(struct bio); fseek(fp1,ln,0); fileread(fp1,&a,sizeof(struct bio)); print(&a); fseek(fp1,ln,0); read(&a); fileprint(fp1,&a,sizeof(struct bio)); fclose(fp1); } fileread(fp1,a,m) FILE *fp1; struct bio *a; int m; { char *pa; int i; pa=(char *)a; for(i=0;i<m;i++) { *pa=getc(fp1); pa++; } } print(a) struct bio *a; { printf("%s\n%d\n%f\n%s\n",a->name,a->age,a->salary,a->address); } read(a) struct bio *a; { scanf("%s%d%f%s",a->name,&a->age,&a->salary,a->address); } fileprint(fp1,a,m)

FILE *fp1; struct bio *a; int m; { char *pa; int i; pa=(char *)a; for(i=0;i<m;i++) { putc(*pa,fp1); pa++; } } /* 366. MALLOC - READ AND DISPLAY TEXT */ #include<stdio.h> #include<malloc.h> #include<stdlib.h> main() { char *pa,*pt,*pn; int n; printf("enter the n value"); scanf("%d",&n); pt=pa=(char *)malloc(n); printf("%u",malloc(n)); printf("AT FIRST pa=%u \tpt=%u\n",pa,pt); for(;(*pa=getchar())!='$';pa++) ; printf("AFTER READING,BEFORE NULL ASSIGN pa=%u \tpt= %u\n",pa,pt ); *pa='\0'; printf("AFTER READING,AFTER NULL ASSIGN pa=%u \tpt= %u\n",pa,p t); pa=pt; puts(pa); printf("AFTER PUTS pa=%u \tpt=%u\n",pa,pt); pa=pt; pn=pa+n; for(;pa<pn;pa++) printf("%c",*pa); printf("\nAFTER PRINTING pa=%u \tpt=%u\n",pa,pt); free(pt); printf("pa printed is \n");

puts(pa); printf("AFTER FREEpa=%u \tpt=%u\n",pa,pt); } /* 367. MALLOC - READ TEXT , COPY TO ANOTHER */ #include<stdio.h> #include<malloc.h> main() { char *pa,*pt,*pb,*pq; int n; scanf("%d",&n); pt=pa=(char*)malloc(n); for(;(*pa=getchar())!='$';pa++) ; *pa='\0'; printf("%u\n",pa); pa=pt; pq=pb=(char*)malloc(strlen(pt)+1); for(;*pa!='\0';pa++,pb++) *pb=*pa; *pb='\0'; printf("%u %c",pb,*(pb-1)); for(pb=pq,printf("\npb=%u pq=%u\n",pb,pq);*pb!='\0';pb++) printf("%c",*pb); printf("\npb=%u, pq=%u\n",pb,pq); free(pt); free(pq); } /* 368. MALLOC - READ 2 TEXT , MERGE TEXT */ #include<malloc.h> main() { char *pa,*pt,*pb,*pq,*pc,*pr; int n,m; printf("enter n &m \n"); scanf("%d%d",&n,&m); pt=pa=(char*)malloc(n); printf("\nenter text 1\n"); for(;(*pa=getchar())!='$';pa++) ; *pa='\0'; pa=pt; pq=pb=(char*)malloc(m); printf("\nenter text 2\n");

for(;(*pb=getchar())!='$';pb++) ; *pb='\0'; pb=pq; pt=pc=(char*)malloc(strlen(pt)+strlen(pq)+1); for(;*pa!='\0';pa++,pc++) *pc=*pa; for(;*pb!='\0';pc++,pb++) *pc=*pb; *pc='\0'; printf("\nmerged text is \n"); for(pc=pt;*pc!='\0';pc++) printf("%c",*pc); free(pt); free(pq); } /* 369. MALLOC - READ AND DISPLAY INTEGER NUMBER UNTIL -1000*/ #include<stdio.h> #include<malloc.h> main() { int *pa,*pt,n; scanf("%d",&n); printf("%d\t %d\n",n,malloc(n*sizeof(int))); pt=pa=(int*)malloc(n*sizeof(int)); printf("%u %u\n",pa,pt); for(scanf("%d",pa);*pa!=-1000;scanf("%d",pa)) { pa++; printf("address = %u",pa); } *pa=-1; for(pa=pt;*pa!=-1;pa++) printf("pa address=%u\tpa data=%d\n",pa,*pa); free(pt); } /* 370. MALLOC - READ AND DISPLAY INTEGER NUMBER UNTIL -1000*/ #include<stdio.h> #include<malloc.h> main() { int *pa,*pt,n,big; printf("enter n value:\n"); scanf("%d",&n);

printf("%d\n",malloc(n*sizeof(int))); pt=pa=(int*)malloc(n*sizeof(int)); for(scanf("%d",pa);*pa!=-1000;scanf("%d",pa)) { pa++; printf("address = %u\n",pa); } *pa=-1; for(pa=pt,big=*pa;*pa!=-1;pa++) { big=*pa>big?*pa:big; } printf("\nBIGGEST IS %d\n",big); free(pt); } /* 371. READ AND DISPLAY BIODATA */ #include<stdio.h> #include<malloc.h> struct bio { char name[20],address[40]; int age; float salary; }; main() { struct bio *pa,*pt; int n; printf("enter n value:\n"); scanf("%d",&n); pt=pa=(char*)malloc(n*sizeof(struct bio)); scanf("%s%d%f%s",pa->name,&pa->age,&pa->salary,pa->address); pa=pt; printf("%s%d%f%s",pa->name,pa->age,pa->salary,pa->address); free(pt); } /* 372. READ RADIUS AND DISPLAY AREA */ #include<stdio.h> #include<malloc.h> struct circle { int r; float area; };

main() { int n; struct circle *pa,*pt; printf("enter n value:\n"); scanf("%d",&n); pt=pa=(char*)malloc(n*sizeof(struct circle)); printf("enter the radius:\n"); scanf("%d",&pa->r); pa=pt; pa->area=3.14*pa->r*pa->r; printf("AREA = %f",pa->area); free(pt); } /* 373. BIGGEST OF THREE NUMBERS */ struct big { int a,b,c,d; }; main() { struct big *pa,*pt; pt=pa=(struct big*)malloc(sizeof(struct big)); printf("enter the three numbers :\n"); scanf("%d%d%d",&pa->a,&pa->b,&pa->c); pa=pt; pa->d = pa->a > pa->b ? pa->a > pa->c ? pa->a : pa->c: pa->b > pa->c ? pa->b : p a->c; printf("\nBIGGEST IS %d",pa->d); free(pt); } /* 374. READ TEXT IN ONE FUNCTION PRINT IT IN ANOTHER */ main() { char *pa,*pt; int n; printf("enter n value:"); scanf("%d",&n); pt=pa=(char*)malloc(n); read(pa); pa=pt; print(pa); free(pt); }

read(pa) char *pa; { for(;(*pa=getchar())!='$';pa++) ; *pa='\0'; } print(pa) char *pa; { for(;*pa!='\0';pa++) printf("%c",*pa); } /* 375. READ and DISPLAY INTEGER ARRAY - FUNCTION */ #include<malloc.h> main() { int *pa,*pt,n; printf("enter n value:"); scanf("%d",&n); pt=pa=(int*)malloc(n*sizeof(int)); read(pa); pa=pt; print(pa); free(pt); } read(pa) int *pa; { for(scanf("%d",pa);*pa!=-1000;pa++,scanf("%d",pa)) ; *pa=-1; } print(pa) int *pa; { for(;*pa!=-1;pa++) printf("%d\n",*pa); } /* 376. READ AND DISPLAY BIODATA - functions*/ #include<stdio.h> #include<malloc.h> struct bio { char name[20],address[40];

int age; float salary; }; main() { struct bio *pa,*pt; int n; printf("enter n value:\n"); scanf("%d",&n); pt=pa=(struct bio*)malloc(n*sizeof(struct bio)); read(pa); pa=pt; print(pa); free(pt); } read(pa) struct bio *pa; { scanf("%s%d%f%s",pa->name,&pa->age,&pa->salary,pa->address); } print(pa) struct bio *pa; { printf("%s%d%f%s",pa->name,pa->age,pa->salary,pa->address); } /* 377. SUM OF TWO NUMBERS WITHOUT POINTERS */ #include<stdio.h> #include<malloc.h> main() { int a,b,c,sum(); printf("enter two numbers\n"); scanf("%d%d",&a,&b); c=sum(a,b); printf("%d",c); } sum(a,b) int a,b; { int c; c=a+b; return c; }

/* 378. SUM OF TWO NUMBERS USING POINTERS -FUNCTIONS & POINTERS */ #include<stdio.h> #include<malloc.h> main() { int a,b,c,*pa,*pt,(*pt)(),sum; printf("enter two numbers\n"); scanf("%d%d",&a,&b); pt=sum; c=*pt(a,b); printf("%d",c); } int sum(a,b) int a,b; { int c; c=a+b; return c; } /* 379. AREA OF THE CIRCLE */ #include<malloc.h> main() { float r,a,*pt,(*pt)(),area(); scanf("%f",&r); pt=area; area=(*pt)(r); printf("%f",area); free(pt); } area(r) float r; { float a; a=3.14*r*r; return a; } /* 380. GIVEN INTEGER NUMBER EVEN OR ODD */ main() { int no,(*pt)(),find; scanf("%d",&no); find=pt; find=(*pt)(no); if(find==1)

printf("%d is even",no); else printf("%d is odd",no); free(pt); } find(no) int no; { if(no%2==0) return 1; else return 0; } /* 387. SUM OF 2 LONG,INT,SHORT,DOUBLE AND FLOAT */ #include<iostream.h> void read1(int *a, int *b); int sum1(int a,int b); void print1(int c); void read2(long *d, long *e); long sum2(long d, long e); void print2(long f); void read3(short *g, short *h); short sum3(short g,short h); void print3(short i); void read4(float *j,float *k); float sum4(float j, float k); void print4(float l); void read5(double *m,double *n); double sum5(double m, double n); void print5(double o); main() { int a,b,c; long d,e,f; short g,h,i; float j,k,l; double m,n,o; read1(&a,&b); c=sum1(a,b); print1(c); read2(&d,&e); f=sum2(d,e); print2(f); read3(&g,&h);

i=sum3(g,h); print3(i); read4(&j,&k); l=sum4(j,k); print4(l); read5(&m,&n); o=sum5(m,n); print5(o); } void read1(int *a,int *b); { cin>>*a>>*b; } int sum1(int a,int b); { int c; c=a+b; return c; } void print1(int c); { cout<<"THE SUM IS "<< c; } void read2(long *d, long *e); { cin>>*d>>*e; } long sum2(long d, long e); { long f; f=d+e; return f; } void print2(long f); { cout<<"THE SUM IS "<< f; } void read3(short *g, short *h); { cin>>*g>>*h; } short sum3(short g,short h); { short i; i=g+h; return i;

} void print3(short i); { cout<<"THE SUM IS "<<i; } void read4(float *j,float *k); { cin>>*j>>*k; } float sum4(float j, float k); { float l; l=j+k; return l; } void print4(float l); { cout<<"THE SUM IS "<<l; } void read5(double *m,double *n); { cin>>*m>>*n; } double sum5(double m, double n); { double o; o=m+n; return o; } void print5(double o); { cout<<"THE SUM IS "<<o; } pt=pa=(struct bio*)malloc(n*sizeof(struct bio)); read(pa); pa=pt; print(pa); free(pt); } read(pa) struct bio *pa; { scanf("%s%d%f%s",pa->name,&pa->age,&pa->salary,pa->address); } print(pa)

struct bio *pa; { printf("%s%d%f%s",pa->name,pa->age,pa->salary,pa->address); } /* 377. SUM OF TWO NUMBERS WITHOUT POINTERS */ #include<stdio.h> #include<malloc.h> main() { int a,b,c,sum(); printf("enter two numbers\n"); scanf("%d%d",&a,&b); c=sum(a,b); printf("%d",c); } sum(a,b) int a,b; { int c; c=a+b; return c; } /* 378. SUM OF TWO NUMBERS USING POINTERS -FUNCTIONS & POINTERS */ #include<stdio.h> #include<malloc.h> main() { int a,b,c,*pa,*pt,(*pt)(),sum; printf("enter two numbers\n"); scanf("%d%d",&a,&b); pt=sum; c=*pt(a,b); printf("%d",c); } int sum(a,b) int a,b; { int c; c=a+b; return c; } /* 379. AREA OF THE CIRCLE */ #include<malloc.h> main() {

float r,a,*pt,(*pt)(),area(); scanf("%f",&r); pt=area; area=(*pt)(r); printf("%f",area); free(pt); } area(r) float r; { float a; a=3.14*r*r; return a; } /* 380. GIVEN INTEGER NUMBER EVEN OR ODD */ main() { int no,(*pt)(),find; scanf("%d",&no); find=pt; find=(*pt)(no); if(find==1) printf("%d is even",no); else printf("%d is odd",no); free(pt); } find(no) int no; { if(no%2==0) return 1; else return 0; } void read1(int *a, int *b); int sum1(int a,int b); void print1(int c); void read2(long *d, long *e); long sum2(long d, long e); void print2(long f); void read3(short *g, short *h);

short sum3(short g,short h); void print3(short i); void read4(float *j,float *k); float sum4(float j, float k); void print4(float l); void read5(double *m,double *n); double sum5(double m, double n); void print5(double o); main() { int a,b,c; long int d,e,f; short int g,h,i; float j,k,l; double m,n,o; read1(&a,&b); c=sum1(a,b); print1(c); read2(&d,&e); f=sum2(d,e); print2(f); read3(&g,&h); i=sum3(g,h); print3(i); read4(&j,&k); l=sum4(j,k); print4(l); read5(&m,&n); o=sum5(m,n); print5(o); } void read1(int *a,int *b) { cin>>*a>>*b; } int sum1(int a,int b) { int c;

c=a+b; return c; } void print1(int c) { cout<<"THE SUM IS "<< c<<"\n"; } void read2(long int *d, long int *e) { cin>>*d>>*e; } long sum2(long int d,long int e) { long int f; f=d+e; return f; } void print2(long int f) { cout<<"THE SUM IS "<< f<<"\n"; } void read3(short *g, short *h) { cin>>*g>>*h; } short sum3(short g,short h) { short i; i=g+h; return i; } void print3(short i) { cout<<"THE SUM IS "<<i<<"\n"; } void read4(float *j,float *k) { cin>>*j>>*k; } float sum4(float j, float k) { float l; l=j+k; return l; } void print4(float l)

{ cout<<"THE SUM IS "<<l<<"\n"; } void read5(double *m,double *n) { cin>>*m>>*n; } double sum5(double m, double n) { double o; o=m+n; return o; } void print5(double o) { cout<<"THE SUM IS "<<o<<"\n"; } /* 388. FUNCTION OVERLOADING / POLYMORPHISM*/ /* SUM OF 2 LONG,INT,SHORT,DOUBLE AND FLOAT */ #include<iostream.h> void read(int *a, int *b); int sum(int a,int b); void print(int c); void read(long *d, long *e); long sum(long d, long e); void print(long f); void read(short *g, short *h); short sum(short g,short h); void print(short i); void read(float *j,float *k); float sum(float j, float k); void print(float l); void read(double *m,double *n); double sum(double m, double n); void print(double o); main() { int a,b,c; long int d,e,f;

short int g,h,i; float j,k,l; double m,n,o; read(&a,&b); c=sum(a,b); print(c); read(&d,&e); f=sum(d,e); print(f); read(&g,&h); i=sum(g,h); print(i); read(&j,&k); l=sum(j,k); print(l); read(&m,&n); o=sum(m,n); print(o); } void read(int *a,int *b) { cin>>*a>>*b; } int sum(int a,int b) { int c; c=a+b; return c; } void print(int c) { cout<<"THE SUM IS "<< c<<"\n"; } void read(long int *d, long int *e) { cin>>*d>>*e; } long sum(long int d,long int e) { long int f; f=d+e;

return f; } void print(long int f) { cout<<"THE SUM IS "<< f<<"\n"; } void read(short *g, short *h) { cin>>*g>>*h; } short sum(short g,short h) { short i; i=g+h; return i; } void print(short i) { cout<<"THE SUM IS "<<i<<"\n"; } void read(float *j,float *k) { cin>>*j>>*k; } float sum(float j, float k) { float l; l=j+k; return l; } void print(float l) { cout<<"THE SUM IS "<<l<<"\n"; } void read(double *m,double *n) { cin>>*m>>*n; } double sum(double m, double n) { double o; o=m+n; return o; } void print(double o) {

cout<<"THE SUM IS "<<o<<"\n"; } /* 389. TEMPLATES - SUM OF 2 NUMBERS OF DIFFERENT DATA TYPES */ #include<iostream.h> #include<stdio.h> template<class T> void read(T* a,T* b) { cin>>T* a>>T* b; } sum(T a,T b) { int c; c=a+b; return c; } void print(c) { cout<<c; } main() { int a,b,c; long int d,e,f; short int g,h,i; float j,k,l; double m,n,o; read(&a,&b); c=sum(a,b); print(c); read(&d,&e); f=sum(d,e); print(f); read(&g,&h); i=sum(g,h); print(i); read(&j,&k); l=sum(j,k); print(l); read(&m,&n); o=sum(m,n); print(o); } /* 387. SUM OF 2 LONG,INT,SHORT,DOUBLE AND FLOAT */ #include<iostream.h>

void read1(int *a, int *b); int sum1(int a,int b); void print1(int c); void read2(long *d, long *e); long sum2(long d, long e); void print2(long f); void read3(short *g, short *h); short sum3(short g,short h); void print3(short i); void read4(float *j,float *k); float sum4(float j, float k); void print4(float l); void read5(double *m,double *n); double sum5(double m, double n); void print5(double o); main() { int a,b,c; long d,e,f; short g,h,i; float j,k,l; double m,n,o; read1(&a,&b); c=sum1(a,b); print1(c); read2(&d,&e); f=sum2(d,e); print2(f); read3(&g,&h); i=sum3(g,h); print3(i); read4(&j,&k); l=sum4(j,k); print4(l); read5(&m,&n); o=sum5(m,n); print5(o); } void read1(int *a,int *b); { cin>>*a>>*b; } int sum1(int a,int b); { int c;

c=a+b; return c; } void print1(int c); { cout<<"THE SUM IS "<< c; } void read2(long *d, long *e); { cin>>*d>>*e; } long sum2(long d, long e); { long f; f=d+e; return f; } void print2(long f); { cout<<"THE SUM IS "<< f; } void read3(short *g, short *h); { cin>>*g>>*h; } short sum3(short g,short h); { short i; i=g+h; return i; } void print3(short i);

/* 391. SCOPE RESOLUTION OPERATOR */ #include<iostream.h> #include<stdio.h> int a,b,c; main() { int a,b,c; a=10,b=20; c=a+b; ::a=1; ::b=2;

::c = ::a + ::b ; cout<<c<<"\n"<<::c<<"\n"; } /* 392. AREA OF THE CIRCLE */ #include<iostream.h> float r,a; main() { float r,a; r=10; a=3.14*r*r; ::r=5; ::a=3.14*::r*::r; cout<<a<<"\n"<<::a<<"\n"; } /* BIGGEST OF THREE NUMBERS BY DEFAULT ARGUMENTS */ #include<iostream.h> int big(int=10,int=20,int=30); main() { int a,b,c,d,e,f,g,h,i,j; cout<<"enter a,b,c\n"; cin>>a>>b>>c; d=big(a,b,c); cout<<"biggest of a,b,c "<<d<<"\n"; cout<<"enter e,f\n"; cin>>e>>f; g=big(e,f); cout<<"biggest of e,f and 30 "<<g<<"\n"; cout<<"enter h\n"; cin>>h; i=big(h); cout<<"biggest of h,20,30\n"<<i<<"\n"; j=big(); cout<<"biggest of 10,20,30 "<<j<<"\n"; } int big(int a,int b,int c) { int d; d=a>b?a>c?a:c:b>c?b:c; return d; }

/* 394. SMALLEST OF THREE NUMBERS BY DEFAULT ARGUMENTS */ #include<iostream.h> int small(int=10,int=20,int=30); main() { int a,b,c,d,e,f,g,h,i,j; cout<<"enter a,b,c\n"; cin>>a>>b>>c; d=small(a,b,c); cout<<"smallest of a,b,c "<<d<<"\n"; cout<<"enter e,f\n"; cin>>e>>f; g=small(e,f); cout<<"smallest of e,f and 30 "<<g<<"\n"; cout<<"enter h\n"; cin>>h; i=small(h); cout<<"smallest of h,20,30\n"<<i<<"\n"; j=small(); cout<<"smallest of 10,20,30 "<<j<<"\n"; } int small(int a,int b,int c) { int d; d=a<b?a<c?a:c:b<c?b:c; return d; } /* 395. READ AND DISPLAY BIODATA BY PASSING ADDRESS */ #include<iostream.h> struct bio { char name[20],address[40]; int age; float salary; }a; void read(struct bio *a); void print(struct bio *a); main() { struct bio a; read(&a); print(&a); } void read(struct bio *a)

{ cin >> a->name >> a->address >> a->age >> a->salary ; } void print(struct bio *a) { cout<<"name = "<<a->name<<"\naddress = "<<a->address<<"\nage="<<a>age<<"\nsalar y="<<a->salary; } /* 396. AREA OF THE CIRCLE */ #include<iostream.h> struct area { float r,a; }x; void read(struct area *x); float find(struct area *x); void print(struct area *x); main() { struct area x; read(&x); find(&x); print(&x); } void read(struct area *x) { cin>>x->r; } float find(struct area *x) { x->a=3.14*x->r*x->r; } void print(struct area *x) { cout<<x->a; } /* 397. BIGGEST OF THREE NUMBERS */ #include<iostream.h> struct biggest { int a,b,c,d; }x; void read(struct biggest *x);

int find(struct biggest *x); void print(struct biggest *x); main() { struct biggest x; read(&x); find(&x); print(&x); } void read(struct biggest *x) { cin>>x->a>>x->b>>x->c; } int find(struct biggest *x) { x->d = x->a > x->b ? x->a > x->c ? x->a : x->c : x->b > x->c ? x->b : x->c; } void print(struct biggest *x) { cout<<"BIGGEST OF THREE NUMBERS : "<< x->d; } /* 398. READ AND DISPLAY BIODATA */ #include<iostream.h> struct bio { char name[20],address[40]; int age; float salary; void read(); void print(); }; void bio::read() { cin >> name >> address >> age >> salary ; } void bio::print() { cout<<"name = "<<name<<"\naddress = "<<address<<"\nage="<<age<<"\nsalary="<<sala ry; } main() {

struct bio a; a.read(); a.print(); } /* 399. AREA OF THE CIRCLE */ #include<iostream.h> struct area { float r,a; void read(); float find(); void print(); }; void area::read() { cin>>r; } float area::find() { a=3.14*r*r; } void area::print() { cout<<a; } main() { struct area x; x.read(); x.find(); x.print(); }

/* 400. BIGGEST OF THREE NUMBERS */ #include<iostream.h> struct biggest { int a,b,c,d; void read(); int find(); void print(); }; void biggest::read() {

cin>>a>>b>>c; } int biggest::find() { d = a > b ? a > c ? a : c : b > c ? b : c; } void biggest::print() { cout<<"BIGGEST OF THREE NUMBERS : "<< d; } main() { struct biggest x; x.read(); x.find(); x.print(); } /* 401. PRIVATE & PUBLIC - READ AND DISPLAY BIODATA */ #include<iostream.h> struct bio { private:char name[20],address[40]; int age; float salary; public:void read(); void print(); }; void bio::read() { cin >> name >> address >> age >> salary ; } void bio::print() { cout<<"name = "<<name<<"\naddress = "<<address<<"\nage="<<age<<"\nsalary="<<sala ry; } main() { struct bio a; a.read(); a.print();

} /* 402. PRIVATE & PUBLIC - AREA OF THE CIRCLE */ #include<iostream.h> struct area { private: float r,a; public: void read(); float find(); void print(); }; void area::read() { cin>>r; } float area::find() { a=3.14*r*r; } void area::print() { cout<<a; } main() { struct area x; x.read(); x.find(); x.print(); } /* 403. BIGGEST OF THREE NUMBERS */ #include<iostream.h> struct biggest { private: int a,b,c,d; public: void read(); int find(); void print(); }; void biggest::read() { cin>>a>>b>>c; }

int biggest::find() { d = a > b ? a > c ? a : c : b > c ? b : c; } void biggest::print() { cout<<"BIGGEST OF THREE NUMBERS : "<< d; } main() { struct biggest x; x.read(); x.find(); x.print(); } /* 404. PRIVATE & PUBLIC - READ AND DISPLAY BIODATA */ #include<iostream.h> class bio { char name[20],address[40]; int age; float salary; public:void read(); void print(); }; void bio::read() { cin >> name >> address >> age >> salary ; } void bio::print() { cout<<"name = "<<name<<"\naddress = "<<address<<"\nage="<<age<<"\nsalary="<<sala ry; } main() { bio a; a.read(); a.print(); } /* 405. CLASS - AREA OF THE CIRCLE */ #include<iostream.h> class area

{ float r,a; public: void read(); float find(); void print(); }; void area::read() { cin>>r; } float area::find() { a=3.14*r*r; } void area::print() { cout<<a; } main() { area x; x.read(); x.find(); x.print(); } /* 406. BIGGEST OF THREE NUMBERS IN CLASS*/ #include<iostream.h> class biggest { int a,b,c,d; public: void read(); int find(); void print(); }; void biggest::read() { cin>>a>>b>>c; } int biggest::find() { d = a > b ? a > c ? a : c : b > c ? b : c; } void biggest::print() {

cout<<"BIGGEST OF THREE NUMBERS : "<< d; } main() { biggest x; x.read(); x.find(); x.print(); } /* 407. INTEGER ARRAY - READ, DISPLAY, BIGGEST, SMALLEST, BIGPOSITION, SMALLPOSITION , INTERCHANGE*/ #include<iostream.h> class integer { int a[100]; public: void read(); void print(); int biggest(); int smallest(); int bigp(); int smallp(); int interchange(); }; void integer::read() { int i=0; cout<<"ENTER THE INTEGER -1000 AT LAST\n"; cin>>a[i]; while(a[i]!=-1000&&i<100) { i++; cin>>a[i]; } a[i]=-1; } void integer::print() { int i; for(i=0;a[i]!=-1;i++) cout<<a[i]; } int integer::biggest() {

int i, big; big=a[0]; for(i=0;a[i]!=-1;i++) big=big>a[i]?big:a[i]; return big; } int integer::smallest() { int i, small; small=a[0]; for(i=0;a[i]!=-1;i++) small=small<a[i]?small:a[i]; return small; } int integer::bigp() { int i,bigp; bigp=0; for(i=0;a[i]!=-1;i++) bigp=a[i]>a[bigp]?i:bigp; return bigp; } int integer::smallp() { int i, smallp; smallp=0; for(i=0;a[i]!=-1;i++) smallp=a[i]<a[smallp]?i:smallp; return smallp; } int integer::interchange() { int i,bigp,smallp,exch; bigp=0,smallp=0,exch=0; for(i=0;a[i]!=-1;i++) { smallp=a[i]<a[smallp]?i:smallp; bigp=a[i]>a[bigp]?i:bigp; } exch=a[bigp]; a[bigp]=a[smallp]; a[smallp]=exch; } main() { class integer x;

int big,small,bp,sp; x.read(); cout<<"THE NUMBERS ENTERED ARE:\n"; x.print(); big=x.biggest(); cout<<"biggest "<<big<<"\n"; small=x.smallest(); cout<<"smallest "<<small<<"\n"; bp=x.bigp(); cout<<"position of biggest"<<bp<<"\n"; sp=x.smallp(); cout<<"position of smallest"<<sp<<"\n"; x.interchange(); cout<<"THE NUMBERS AFTER EXCHANGE:\n"; x.print(); }

jp /* 408. CHARACTER ARRAY - READ, DISPLAY, COUNT U,L,D,S, COUNT W,L,C, ,C OPY, COPYN, COPYNFROMM,LENGTH,COPYLAST */ #include<iostream.h> class charac { char a[100],b[100],c[100],d[100],e[100],f[100]; int u,l,d,s,w,lines,c,n,m, public: void read(); void print(); int countulds(int *,int *,int *,int *); int countwlc(int *,int *,int *); void copy(char); void copyn(int,char); void copynm(int,int,char); int length(int); void copylast(int,char); void reverse(char); } void charac::read() { int i;

cout<<"ENTER THE TEXT:"; for(i=0;a[i]!='\0';i++) cin>>a[i]; a[i]='\0'; } void charac::print() { int i; cout<<"THE TEXT ENTERED IS :"; for(i=0;a[i]!='\0';i++) cout<<a[i]; } int charac::countulds(int *u, int *l,int *d, int *s) { int i; *u=0,*l=0,*d=0,*s=0; for(i=0;a[i]!='\0';i++) { if(a[i]>=48&&a[i]<=57) (*d)++; else if(a[i]>=65&&a[i]<=90) (*u)++; else if(a[i]>=97&&a[i]<=122) (*l)++; else (*s)++; } } void charac::countwlc(int *w,int *lines,int *c) { int i; for(i=0;a[i]!='\0';i++) { if((a[i]!=' ' && a[i+1]==' ')||(a[i]!='\t'&&a[i+1]=='\t')|| (a[i]!='\n'&&a[i+1]=='\n')) (*w)++; if(a[i]=='\n') (*lines)++; (*c)++; } } void charac::copy(char b[100]) { int i,j; for(i=0,j=0;a[i]!='\0';i++,j++) b[j]=a[i];

b[j]='\0'; } void charac::copyn(int n,char c[100]) { int i,j; for(i=0;i<n;i++) { c[j]=a[i]; j++; } c[j]='\0'; } void charac::copynm(int n, int m, char d[100]) { int i,j,k; k=0; for(i=m,j=m+n;i<j;i++) { d[k]=a[i]; k++; } d[k]='\0'; } void charac::length() { int i; for(i=0;a[i]!='\0';i++) ; return i; } void charac::copylast(int n, char e[100]) { int i,j,ln; int i,j; ln=length(); for(i=ln-n,j=0;a[i]!='\0';i++) { e[j]=a[i]; j++; } e[j]='\0'; } void charac::reverse(char f[100]) { int i,ln; ln=length();

for(i=ln,j=0;i>=0;i--) { f[j]=a[i]; j++; } f[j]='\0'; } main() { charac x; int u,l,d,s,w,lines,c; x.read(); x.print(); x.countulds(&u,&l,&d,&s); cout<<"UPPER = "<<u<<"LOWER = "<<l<<"DIGIT = "<<d<<"SPECIAL = "<<s; x.countwlc(&w,&lines,&c); cout<<"WORDS = "<<w<<"LINES = "<<lines<<"CHARACTERS = "<<c; x.copy(b); cout<<"COPIED TEXT \n"; puts(b); cout<<"ENTER N VALUE OF LEFT N COPY :\n"; cin<<n; x.copyn(n,c); cout<<"THE LEFT N CHAR OF TEXT:\n"; puts(c); cout<<"ENTER N,M VALUE:\n"; cin<<m<<n; x.copynm(n,m,d); cout<<"THE TEXT MTH TO N CHAR COPIED IS :\n" puts(d); ln=x.length(); cout<<"LENGTH OF STRING IS :\n"; cout<<ln; cout<<"LAST N CHAR : ENTER N VALUE : "; cin>>n; copylast(n,e); cout<<"\nLAST N CHARACTER COPIED IS\n"; puts(e); reverse(f); cout<<"\nTHE REVERSED TEXT : "; puts(f); }

/* 409. SUM OF TWO NUMBERS */ #include<iostream.h> class sum { int a,b,c; public: void read(); void add(); void display(); }; void sum::read() { cout<<"enter the two numbers: \n "; cin>>a>>b; } void sum::add() { c=a+b; } void sum::display() { cout<<"SUM IS "<<c; } main() { sum x; x.read(); x.add(); x.display(); } jp /* 409. SUM OF TWO NUMBERS */ #include<iostream.h> class sum { int a,b,c; public: void read(); void add(); void display(); }; void sum::read() { cout<<"enter two numbers\n";

cin>>a>>b; } void sum::add() { c=a+b; } void display() { cout<<"\nthe sum is "<<c; } main() { sum x; x.read(); x.add(); x.display(); } /* 410. SUM OF TWO NUMBERS USING CONSTRUCTORS */ #include<iostream.h> class sum { int a,b,c; public: sum() { a=10; b=20; } void add(); void display(); }; void sum::add() { c=a+b; } void sum::display() { cout<<"SUM IS "<<c; } main() { sum x; x.add(); x.display(); }

/* 411. AREA OF THE CIRCLE */ #include<iostream.h> class circle { float r,a; public: circle() { r=10; } void area(); void display(); }; void circle::area() { a=3.14*r*r; } void circle::display() { cout<<"\nAREA OF THE CIRCLE IS "<<a; } main() { circle x; x.area(); x.display(); } /* 412. BIGGEST OF THREE NUMBERS USING CONSTRUCTOR */ #include<iostream.h> class biggest { int a,b,c,d; public: biggest() { a=10,b=20,c=30; } void find(); void display(); }; void biggest::find() { d = a > b ? a > c ? a : c : b > c ? b : c; } void biggest::display() { cout<<"\nBIGGEST IS "<<d; } main()

{ biggest x; x.find(); x.display(); } /* 413. BIGGEST OF THREE NUMBERS OF 2 OBJECTS USING CONSTRUCTORS */ #include<iostream.h> class biggest { int a,b,c,d; public: biggest() { a=10,b=20,c=30; } biggest(int x, int y,int z) { a=x; b=y; c=z; } void find(); void display(); }; void biggest::find() { d = a > b ? a > c ? a : c : b > c ? b : c; } void biggest::display() { cout<<"\nBIGGEST IS "<<d<<"\n"; } main() { biggest x,y(11,22,33); x.find(); x.display(); y.find(); y.display(); } /* 414. SUM OF TWO NUMBERS OF 2 OBJECTS USING CONSTRUCTOR OVERLOADING */ #include<iostream.h> class sum

{ int a,b,c; public: sum() { a=10; b=20; } sum(int x, int y) { a=x,b=y; } void add(); void display(); }; void sum::add() { c=a+b; } void sum::display() { cout<<"\n\nSUM IS "<<c; } main() { sum x,y(10,20); x.add(); x.display(); y.add(); y.display(); } /* 415. AREA OF THE CIRCLE OF 2 OBJECTS - CONSTRUCTOR OVERLOADING*/ #include<iostream.h> class circle { float r,a; public: circle() { r=10; } circle(int x) { r=x; } void area(); void display(); }; void circle::area() {

a=3.14*r*r; } void circle::display() { cout<<"\nAREA OF THE CIRCLE IS "<<a; } main() { circle x,y(5); x.area(); x.display(); y.area(); y.display(); } /* 416. BIGGEST OF THREE NUMBERS WITHOUT CONSTRUCTOR */ #include<iostream.h> class biggest { int a,b,c,d; public: void read(); void find(); void display(); }; void biggest::read() { cout<<"ENTER THE THREE NUMBERS:\n"; cin>>a>>b>>c; } void biggest::find() { d = a > b ? a > c ? a : c : b > c ? b : c; } void biggest::display() { cout<<"\nBIGGEST IS "<<d; } main() { biggest x; x.read(); x.find(); x.display(); }

/* 417. BIGGEST OF THREE NUMBERS BY PRIVATE AND PUBLIC - BASE CLASS */ #include<iostream.h> class big3 { private:int a,b,c; protected:int big; public: void read(); void find(); void display(); }; void big3::read() { cout<<"ENTER THE THREE NUMBERS:\n"; cin>>a>>b>>c; } void big3::find() { big = a > b ? a > c ? a : c : b > c ? b : c; } void big3::display() { cout<<"\nBIGGEST IS "<<big; } main() { big3 x; x.read(); x.find(); x.display(); } /* 418. INHERITANCE - BIGGEST OF FOUR NUMBERS */ #include<iostream.h> class big3 { private:int a,b,c; protected:int big; public: void read(); void find(); // void display(); }; void big3::read() { cout<<"ENTER THE THREE NUMBERS:\n"; cin>>a>>b>>c;

} void big3::find() { big = a > b ? a > c ? a : c : b > c ? b : c; } /*void big3::display() { cout<<"\nBIGGEST IS "<<big; }*/ class big4:public big3 { int d; public: void read(); void find(); void display(); }; void big4::read() { big3::read(); cout<<"ENTER THE FOURTH NUMBER:\n"; cin>>d; } void big4::find() { big3::find(); cout<<"biggest of three"<<big<<"\n"; big=d>big?d:big; } void big4::display() { cout<<"\nBIGGEST IS "<<big; } main() { big4 y; y.read(); y.find(); y.display(); } /* 419. SMALLEST OF THREE NUMBERS BY PRIVATE AND PUBLIC - BASE CLASS */ #include<iostream.h> class small3 { private:int a,b,c;

protected:int small; public: void read(); void find(); void display(); }; void small3::read() { cout<<"ENTER THE THREE NUMBERS:\n"; cin>>a>>b>>c; } void small3::find() { small = a < b ? a < c ? a : c : b < c ? b : c; } void small3::display() { cout<<"\nSMALLEST IS "<<small; } main() { small3 x; x.read(); x.find(); x.display(); } /* 423. READ & DISPLAY STAFF - TWO DERIVED CLASSES ALLOWANCE, DEDUCTION */ #include<iostream.h> class person { private: char name[20],address[40],sex[10]; int age; public: void read(); void display(); }; void person::read() { cout<<"\nenter name, age, sex, address\n"; cin>>name>>age>>sex>>address; } void person::display() { cout<<"\nname = "<<name<<"\nage = "<<age<<"\nsex = "<<sex<<"\naddress = "<<address<<"\n" ; }

class staff:public person { private: char dep[10]; int accno; float salary; public: void readstaff(); void displaystaff(); }; void staff::readstaff() { person::read(); cout<<"enter int accno,char dep, float salary\n"; cin>>accno>>dep>>salary; } void staff::displaystaff() { person::display(); cout<<"\naccno = "<<accno<<"\ndep = "<<dep<<"\nsalary = "<<salary<<"\n"; } class allowance:public staff { private: float hra,cca; public: void calculateallow(); void displayallow(); }; class deduction:public staff { private:float pf,lic; public: void calculatededuc(); void displaydeduc(); }; void allowance::calculateallow() { staff::read(); hra=salary*0.14; cca=salary*0.07; } void allowance::displayallow() { cout<<"\nHRA = "<<hra<<"\nCCA = "<<cca; } void deduction::calculatededuc() {

pf=salary*0.56; lic=salary*0.01; } void deduction::display() { cout<<"\nPF = "<<pf<<"\nLIC = "<<lic; } main() { staff y; allowance A; deduction B; y.readstaff(); A.calculateallow(); A.displayallow(); B.calculatededuc(); B.displaydeduc(); } /* 425. READ A POINT, INCREMENT AND DISPLAY */ #include<iostream.h> class point { int x,y; public: void read(); void increment(); void display(); }; void point::read() { cout<<"ENTER X,Y "; cin>>x>>y; cout<<"\n THE POINT ENTERED IS ("<<x<<","<<y<<")"; } void point::increment() { x++; y++; } void point::display() { cout<<"\n THE POINT AFTER INCREMENT IS ("<<x<<","<<y<<")"; } main() { point A;

A.read(); A.increment(); A.display(); } /* 426. OPERATOR OVERLOADING - READ A POINT, INCREMENT AND DISPLAY */ #include<iostream.h> class point { int x,y; public: void read(); void operator++(); void display(); }; void point::read() { cout<<"ENTER X,Y "; cin>>x>>y; cout<<"\n THE POINT ENTERED IS ("<<x<<","<<y<<")"; } void point::operator++() { x++; y++; } void point::display() { cout<<"\n THE POINT AFTER INCREMENT IS ("<<x<<","<<y<<")"; } main() { point A; A.read(); ++A; A.display(); } /* 427. OPERATOR OVERLOADING - READ A POINT, DECREMENT AND DISPLAY */ #include<iostream.h> class point { int x,y; public: void read(); void operator--();

void display(); }; void point::read() { cout<<"ENTER X,Y "; cin>>x>>y; cout<<"\n THE POINT ENTERED IS ("<<x<<","<<y<<")"; } void point::operator--() { x--; y--; } void point::display() { cout<<"\n THE POINT AFTER DECREMENT IS ("<<x<<","<<y<<")"; } main() { point A; A.read(); --A; A.display(); } /* 428. READ AND DISPLAY COMPLEX NUMBER */ #include<iostream.h> class complex { int real,imag; public: void read(); void display(); }; void complex::read() { cout<<"enter real and imag no."; cin>>real>>imag; } void complex::display() { cout<<real<<"+j"<<imag<<"\n"; } main() { complex A; A.read();

A.display(); } /* 429. READ AND DISPLAY 2 COMPLEX NUMBERS */ #include<iostream.h> class complex { int real,imag; public: void read(); void display(); }; void complex::read() { cout<<"enter real and imag no."; cin>>real>>imag; } void complex::display() { cout<<real<<"+j"<<imag<<"\n"; } main() { complex A,B; A.read(); A.display(); B.read(); B.display(); } /* 430. READ 2 COMPLEX NUMBERS, DISPLAY SUM */ #include<iostream.h> class complex { int real,imag; public: void read(); complex sum(complex,complex); void display(); }; void complex::read() { cout<<"enter real and imag no."; cin>>real>>imag; } complex complex::sum(complex a, complex b) { complex c;

c.real=0,c.imag=0; c.real=a.real+b.real; c.imag=a.imag+b.imag; return c; } void complex::display() { cout<<real<<"+j"<<imag<<"\n"; } main() { complex a,b,c; a.read(); b.read(); c=c.sum(a,b); c.display(); } /* 431. READ 2 COMPLEX NUMBERS, DISPLAY DIFFERENCE */ #include<iostream.h> class complex { int real,imag; public: void read(); complex difference(complex,complex); void display(); }; void complex::read() { cout<<"enter real and imag no."; cin>>real>>imag; } complex complex::difference(complex a, complex b) { complex c; c.real=0,c.imag=0; c.real=a.real-b.real; c.imag=a.imag-b.imag; return c; } void complex::display() { cout<<real<<"+j"<<imag<<"\n"; } main() {

complex a,b,c; a.read(); b.read(); c=c.difference(a,b); c.display(); } /* 432. READ 2 COMPLEX NUMBERS, DISPLAY PRODUCT - OPERATOR OVERLOADING*/ #include<iostream.h> class complex { int real,imag; public: void read(); complex operator *(complex ); void display(); }; void complex::read() { cout<<"enter real and imag no."; cin>>real>>imag; } complex complex::operator *(complex b) { complex c; c=a*b; return c; } void complex::display() { cout<<real<<"+j"<<imag<<"\n"; } main() { complex a,b,c; a.read(); b.read(); c=a*b; c.display(); } /* 435. FILES - READ BIODATA FROM KEYBOARD AND WRITE IT IN FILE */ #include<iostream.h> #include<fstream.h> main() {

char name[20],address[40]; int age; float salary; ofstream bio("sm435.txt"); cout<<"enter name, age, salary, address\n"; cin>>name>>age>>salary>>address; bio<<"name = "<<name<<"\nage = "<<age<<"\nsalary = "<<salary<<"\naddress= "<<address; } /* 436. FILES - READ BIODATA FROM KEYBOARD AND WRITE IT IN FILE */ #include<iostream.h> #include<fstream.h> main() { char name[20],address[40]; int age; float salary; ofstream bio("sm435.txt"); cout<<"enter name, age, salary, address\n"; cin>>name>>age>>salary>>address; bio<<name<<"\n"<<age<<"\n"<<salary<<"\n"<<address; } /* 437. FILES - READ BIODATA FROM FILE AND DISPLAY ON SCREEN */ #include<iostream.h> #include<fstream.h> main() { char name[20],address[40]; int age; float salary; ifstream bio("sm435.txt"); bio>>name>>age>>salary>>address; cout<<name<<age<<salary<<address; } /* 438. FILES - READ BIODATA FROM KEYBOARD UNTIL $ AND WRITE IT IN FILE */ #include<iostream.h> #include<fstream.h> main() { char name[20],address[40]; int age; float salary;

ofstream bio("sm438.txt"); cout<<"enter name\n"; cin>>name; while(name[0]!='$') { cout<<"enter age, salary, address\n"; cin>>age>>salary>>address; bio<<name<<"\n"<<age<<"\n"<<salary<<"\n"<<address<<"\n"; cout<<"enter name\n"; cin>>name; } bio.close(); } /* 439. FILES - READ BIODATA FROM FILE UNTIL EOF AND DISPLAY */ #include<iostream.h> #include<fstream.h> main() { char name[20],address[40]; int age; float salary; ifstream bio("sm438.txt"); bio>>name>>age>>salary>>address; do { cout<<name<<age<<salary<<address<<"\n"; bio>>name>>age>>salary>>address; } while(bio.eof()==0); bio.close(); } /* 440. READ CHAR BY CHAR FROM KEYBOARD AND WRITE IT IN FILE */ #include<iostream.h> #include<fstream.h> main() { char a; ofstream bio("sm440.txt"); cout<<"enter char by char\n"; cin>>a; while(a!='$') { bio.put(a); cin>>a;

} bio.close(); }/* 441. READ CHAR BY CHAR FROM FILE UNTIL EOF AND DISPLAY */ #include<iostream.h> #include<fstream.h> main() { char a; ifstream bio("sm440.txt"); bio.get(a); do { cout<<a; bio.get(a); } while(bio.eof()==0); bio.close(); } /* 442. STUDENT BIODATA - READ FROM KEYBOARD AND WRITE IT IN FILE */ #include<iostream.h> #include<fstream.h> class student { char name[20],sex[10]; int marks,rollno; public:void read(); }; void student::read() { cout<<"enter name,sex,marks,rollno\n"; cin>>name>>sex>>marks>>rollno; } main() { student x; ofstream bio("sm442.txt"); x.read(); bio.write((char*)&x,sizeof(x)); } /* 443. STUDENT BIODATA - READ FROM FILE and DISPLAY*/ #include<iostream.h> #include<fstream.h> class student { char name[20],sex[10];

int marks,rollno; public:void display(); }; void student::display() { cout<<name<<sex<<marks<<rollno; } main() { student x; ifstream bio("sm442.txt"); bio.read((char*)&x,sizeof(x)); x.display(); } /* 444. STUDENT BIODATA - READ FROM KEYBOARD UNTIL $ AND WRITE IT IN FILE */ #include<iostream.h> #include<fstream.h> class student { char name[20],sex[10]; int marks,rollno; public:int read(); }; int student::read() { cout<<"enter name\n"; cin>>name; if(name[0]!='$') { cout<<"enter sex,marks,rollno\n"; cin>>sex>>marks>>rollno; return 1; } return 0; } main() { student x; int a; ofstream bio("sm444.txt"); a=x.read(); while(a!=0) { bio.write((char*)&x,sizeof(x)); a=x.read();

} bio.close(); } /* 445. STUDENT BIODATA - READ FROM FILE UNTIL EOF and DISPLAY*/ #include<iostream.h> #include<fstream.h> class student { char name[20],sex[10]; int marks,rollno; public:void display(); }; void student::display() { cout<<name<<sex<<marks<<rollno; } main() { student x; ifstream bio("sm444.txt"); bio.read((char*)&x,sizeof(x)); do { x.display(); bio.read((char*)&x,sizeof(x)); } while(bio.eof()==0); bio.close(); } /* 446. STUDENT BIODATA - READ FROM and DISPLAY NTH RECORD */ #include<iostream.h> #include<fstream.h> class student { char name[20],sex[10]; int marks,rollno; public:void display(); }; void student::display() { cout<<name<<sex<<marks<<rollno; } main() { student x; int n,ln;

ifstream bio("sm444.txt"); cout<<"enter the n value\n"; cin>>n; ln=(n-1)*sizeof(x); bio.seekg(ln); bio.read((char*)&x,sizeof(x)); x.display(); bio.close(); } /* 447. STUDENT BIODATA - READ FROM FILE AND EDIT N TH RECORD */ #include<iostream.h> #include<fstream.h> class student { char name[20],sex[10]; int marks,rollno; public: void read(); void display(); }; void student::read() { cin>>name>>sex>>rollno>>marks; } void student::display() { cout<<name<<sex<<marks<<rollno; } main() { student x; int n,ln; fstream bio; bio.open("sm444.txt",ios::in|ios::out); cout<<"enter the n value\n"; cin>>n; ln=(n-1)*sizeof(x); infile.seekp(ln,ios::cur); x.read(); bio.write((char*)&x,sizeof(x)); ln=-1*sizeof(x); seekg(ln,ios::cur); bio.read((char*)&x,sizeof(x)); x.display();

bio.close(); } 0+!112/!NVMUJQMJDBUJPO!PG!UXP!OVNCFST+0 nbjo)* !!!!!!| !!!!!!!!!!!gmpbu!b-c-d< !!!!!!!!!!!b> 21-c>3< !!!!!!!!!!!d>b+c< !!!!!!!!!!!qsjoug)#&g#-d*< !!!!!!~ !!!!!! murugan 24 3252.000000 dhsdhsdfhd dfhsdh 43 35763764.000000 dfhsdsdhjsdhs 222222222222222222222222222222222222 muruganananaannnannanananan muruganantham.s is cleverer than before. main() { char *pa,*pt; int i,n; printf("%u\n",pa); scanf("%d",&n); pa=pt=(char *)malloc(n); for(scanf("%c",&pa),i=0;i<n;scanf("%c",&pa)) { i++; pa++; printf("%u\n",pa); } *pa='\0'; for(pa=pt;*pa!='\0';pa++) printf("%c",*pa); printf("\n\n"); /* printf("\n%c",*pa); // printf("%u\n",pa);*/ } muruganantham.s@jfshlfhklfjasdhkljaklhadkljadfklTB@H

/* 408. CHARACTER ARRAY - READ, DISPLAY, COUNT U,L,D,S, COUNT W,L,C, , COPY, COPYN, COPYNFROMM,LENGTH,COPYLAST */ #include<iostream.h> class charac { char a[100],b[100],c[100],d[100],e[100],f[100],p[20],g[20],h[100],q[20]; int u,l,d1,s,w,lines,c1,n,m,pn; public: void read(); void print(); int countulds(int *,int *,int *,int *); int countwlc(int *,int *,int *); void copy(char b[]); void copyn(int n,char c[]); void copynm(int n,int m,char d[]); int length(); void copylast(int n,char e[]); void reverse(char f[]); /* void pattern(char p[]); void delete(char p[],char g[]); void replace(char p[],char q[],char h[]);*/ }; void charac::read() { int i; cout<<"\nENTER THE TEXT:\n"; for(i=0,cin>>a[i];a[i]!='$';i++,cin>>a[i]) ; a[i]='\0'; } void charac::print() { int i; cout<<"\nTHE TEXT ENTERED IS :\n"; for(i=0;a[i];i++) cout<<a[i]; } int charac::countulds(int *u, int *l,int *d1, int *s) { int i; *u=0,*l=0,*d1=0,*s=0; for(i=0;a[i]!='\0';i++) {

if(a[i]>=48&&a[i]<=57) (*d1)++; else if(a[i]>=65&&a[i]<=90) (*u)++; else if(a[i]>=97&&a[i]<=122) (*l)++; else (*s)++; } } int charac::countwlc(int *w,int *lines,int *c1) { int i; *w=0,*lines=0,*c1=0; for(i=0;a[i]!='\0';i++) { if((a[i]!=' ' && a[i+1]==' ')||(a[i]!='\t'&&a[i+1]=='\t')|| (a[i]!='\n'&&a[i+1]=='\n')) (*w)++; if(a[i]=='\n') (*lines)++; (*c1)++; } } void charac::copy(char b[]) { int i,j; for(i=0,j=0;a[i]!='\0';i++,j++) b[j]=a[i]; b[j]='\0'; } void charac::copyn(int n,char c[]) { int i,j; for(i=0,j=0;i<n;i++) { c[j]=a[i]; j++; } c[j]='\0'; } void charac::copynm(int n, int m, char d[])

{ int i,j,k; k=0; for(i=m,j=m+n;i<j;i++) { d[k]=a[i]; k++; } d[k]='\0'; } int charac::length() { int i; for(i=0;a[i]!='\0';i++) ; return i; } void charac::copylast(int n, char e[100]) { int i,j,ln; ln=length(); for(i=ln-n,j=0;a[i]!='\0';i++) { e[j]=a[i]; j++; } e[j]='\0'; } void charac::reverse(char f[100]) { int i,j,ln; ln=charac::length(); for(i=--ln,j=0;i>=0;i--) { f[j]=a[i]; j++; } f[j]='\0'; } /* int charac::pattern(char p[20]) { int i,j,k,pn;

for(i=0,j=0;a[i]!='\0';i++) { for(i=0,j=0;a[i]!='\0';i++) { for(j=0,k=i;p[j]==a[k]&&p[j]!='\0';j++,k++) ; if(p[j]=='\0') pn++; } } return pn; } void charac::delete(char p[20], char g[20]) { int i,j,k,l; l=0; for(i=0,j=0;a[i]!='\0';i++) { for(j=0,k=i ; p[j]==a[k] && p[j]!='\0' ; j++,k++) ; if(p[j]=='\0') i=k; else { g[l]=a[i]; l++; } } g[l]='\0'; } void charac::replace(char p[20], char q[20], char h[20]) { int i,j,k,l,m; for(i=0,j=0,k=0,l=0,m=0;a[i]!='\0';i++) { for(j=0,k=i;p[j]==a[k]&&p[j]!='\0';j++,k++) ; if(p[j]=='\0') { for(m=0;q[m]!='\0';m++) { h[l]=q[m]; l++; }

} else h[l]=a[i]; } h[l]='\0'; } */ main() { charac x; int u2,l2,d2,s2,w2,lines2,c2,n,m,ln,pn; char a3[100],b3[100],c3[100],d3[100],e3[100],f3[100],p3[20],g3[20],h3[100],q3[20]; x.read(); x.print(); x.countulds(&u2,&l2,&d2,&s2); cout<<"\nUPPER = "<<u2<<"LOWER = "<<l2<<"DIGIT = "<<d2<<"SPECIAL ="<<s2<<"\n"; x.countwlc(&w2,&lines2,&c2); cout<<"\nWORDS = "<<w2<<"LINES = "<<lines2<<"CHARACTERS = "<<c2<<"\n"; x.copy(b3); cout<<"\nCOPIED TEXT \n"; puts(b3); cout<<"\nENTER N VALUE OF LEFT N COPY :\n"; cin>>n; x.copyn(n,c3); cout<<"\nTHE LEFT N CHAR OF TEXT:\n"; puts(c3); cout<<"\nENTER N,M VALUE:\n"; cin>>m>>n; x.copynm(n,m,d3); cout<<"\nTHE TEXT MTH TO N CHAR COPIED IS :\n"; puts(d3); ln=x.length(); cout<<"\nLENGTH OF STRING IS :\n"; cout<<ln; cout<<"\nLAST N CHAR : ENTER N VALUE : \n"; cin>>n; x.copylast(n,e3); cout<<"\nLAST N CHARACTER COPIED IS\n"; puts(e3); x.reverse(f3); cout<<"\nTHE REVERSED TEXT :\n";

puts(f3); /* for(l=0;cin>>p3[l];p[l]!='$';cin>>p3[l]) l++; p3[l]='\0'; pn=x.pattern(p3); cout<<"\nPATTERN TOTAL : \n"; x.delete(p3,g3); puts(g3); for(l=0,cin>>q3[l];q3[l]!='$';cin>>q3[l]) l++; q3[l]='\0'; x.replace(p3,q3,h3); puts(h3);

*/ } Red Hat Linux release 9 (Shrike) Kernel 2.4.20-8 on an i686 login: mar050460 Password: Last login: Fri Mar 17 22:02:00 from 192.0.0.26 [mar050460@linsoft mar050460]$ cat product.C cat: product.C: No such file or directory [mar050460@linsoft mar050460]$ cat product.c cat: product.c: No such file or directory [mar050460@linsoft mar050460]$ cat p431product.C /* 431product. READ 2 COMPLEX NUMBERS, DISPLAY PRODUCT */ #include<iostream.h> class complex { int real,imag; public: void read(); complex product(complex,complex); void display(); }; void complex::read() { cout<<"enter real and imag no."; cin>>real>>imag; } complex complex::product(complex a, complex b) { complex c; c.real=0,c.imag=0; c.real=(a.real*b.real)-(a.imag*b.imag);

c.imag=(a.real*b.imag)+(b.real*a.imag); return c; } void complex::display() { cout<<real<<"+j"<<imag<<"\n"; } main() { complex a,b,c; a.read(); b.read(); c=c.product(a,b); c.display(); } [mar050460@linsoft mar050460]$ cat p66ab.c /* 66. WHILE LOOP - POSITION OF BIGGEST AND SMALLEST OF TEN NUMBERS */ main() { static int a[10],i=1,big=0,pbig=0,small=0,psmall=0; printf("enter the number:\n"); while( i <=10 ) { scanf("%d",&a[i]); i++; } i=1; big=a[i]; small=a[i]; while( i<=10 ) { if(a[i]>big) { big=a[i]; pbig=i; } if(a[i]<small) { small=a[i]; psmall=i; } i++; }

/*

i=1; small=a[i]; while(i<=10) { if(a[i]<small) { small=a[i]; psmall=i; } i++; }

*/ printf("POSITION OF BIGGEST OF TEN NUMBERS :%d no = %d\n",pbig,big); printf("POSITION OF SMALLEST OF TEN NUMBERS:%d no= %d",psmall,small); } sample.txt -bash: sample.txt: command not found cat sample.txt muruganantham.s25400000.000000jasdfghdjkshgjksdfhkjd cat sm172.c kk cat sm172.txt murugan 25 400000.000000 west-street,madurapuri,thuraiyur. cat sm174.txt murugan 25 400000.000000 jdfhgkjdhfkjgh siva 28 300000.000000 xbnfdkjhklsjkl sukumar 36 84763901952.000000 kdjkdflsjhkjdkjdskjhldk elaiyaraja 32 878769.000000 kdsjhdjfhklsdjhklsdjhkl [mar050460@linsoft mar050460]$ cat sm176.txt

muruganantham.s cat sm178.txt muruganantham.s 25 2155897.000000 mndfhjsdfkjsdfkljklsdfjklsdfj cat sm178.doc muruganantham.s25400000.000000bdfkljhlksdfjhkldfjlkhjsdfkljd cat sm180.txt murugan 25 400000.000000 kdfkhsdf;kdf;sk;lsdfk;k siva 28 300000.000000 kjkjfkjkjdfkjsdfkjksdjksdfj sukumar 34 889787.000000 ghlksdfl;hksdfk;lk;lk elaiyaraja 31 9890890.000000 dsjhsdfklhjklsdfjklhsdfjklsd cat sm182.txt ***111ASDmuruganantham.s is more active,cleverer than before. 111***AAAsecond ssssssssssssssssssssssssssssssssssssssssssss. 111AAA***third ttttttttttttttttttttttttttttttttttttttttttttt. 111AAAfou***rth ffffffffffffffffffffffffffffffffffffffffffff. 111AAAfifth ***fffffffffffffffffffffffffffffffffffffffffffff. 111AAAsixth sss***ssssssssssssssssssssssssssssssssssssssssss. 111AAAseventh ssss***sssssssssssssssssssssssssssssssssssssss, 111eightheeeeeeeeeeee***eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee, 111nineth nnnnnnnnnnnnnn***nnnnnnnnnnnnnnnnnnnnnnnnnnnnnn, 111tenth ttttttttttttttttttttttttttttttttttttttttttttt, 111eleventheeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee, ttttttttttttttttttAAAttttttttttttttttttttttttttttttttt, aaaaaaaaaaaaaaaAAAaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa, ffffffffffffAAAffffffffffffffffffffffffffffffffff, .........AAA......................................... ggggggAAAgggggggggggggggggggggggggggggggggggggggggggggg, hhhAAAhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh, AAA mmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmAAA uuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuAAA

rrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrAAA uuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuAAAuuu ggggggggggggggggggggggggggggggggggggggAAAggggggggggg aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaAAAaaaaaaaaaaaaaaaa nnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnAAAnnnnnnnnnnnnnnnnnnnn aaaaaaaaaaaaaaaaaaaaaaaa111aaaaaAAAaaaaaaaaaaaaaaaaaaaa nnnnnnnnnnnnnnnnnnnnn111nnnnnAAAnnnnnnnnnnnnnnnnnnnnn tttttttttttttttttt111tttttAFFtttttttttttttttttttttttttt hhhhhhhhhhhhhhh111hhhhhAFAhhhhhhhhhhhhhhhhhhhhhhhh aaaaaaaaaaaa111aaaaaAFAaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa mmmmmmmmm111mmmmmAFFmmmmmmmmmmmmmmmmmmmmmmmmmmm mmmmmmmmmmmm ......111.....AFA................................... sss111ssssASDFssssssssssssssssssssssssssssssssssssssssssssssss 111 111asjKJAKvaradaraajan..[mar050460@linsoft mar050460]$ cat sm185.txt murugan 25 400000.000000 wheghjgqh cat sm188.txt [Dnvsvhbo 36 511111/111111 xifhikhri [mar050460@linsoft mar050460]$ cat sm189.txt murugan 25 400000.000000 wheghjgqh cat sm190.txt muruganantham is in 190.c i dont know how long it will take to complete. cat sm192.txt sgasglsdgjl agk;akg;lks asdgjklasdjlk sadgkljsklad aaaaaaaaaaaaaa aaaaaaaaaaaaaaaaa sssssssssssss xxxxxxxxxxxxxxxx zzzzzzzzzzzzzzzz xxxxxxxxxxxxxxxx ccccccccccccccc vvvvvvvvvvvvvvvv

bbbbbbbbbbbbbbbbbbbbb fffffffffffffffffffff rrrrrrrrrrrrrrrrr tttttttttttttttttttt yyyyyyyyyyyyyyy uuuuuuuuuuuuuuu kkkkkkkkkkkkkkkkk ,,,,,,,,,,,,,,,,,,,, iiiiiiiiiiiiiiiii Yyyyyyyyyyyyyyyy KdfhlkjdklJ dshlsdlh sdfkhjsdklfj 'lskdjghklsdfj sdklfjklsdjf sdfhlsdfj ldskfjhklsdfj jksdhgjhdjkl ksdjfhklsdfjl sdfjhkl;sdfj dfhjskl;dfj fffffffffffffff fffffffffffffff ffffffffffffff aaaaaaaaaaaaaaa cccccccccccccc vvvvvvvvvvvvvv dddddddddddddddd eeeeeeeeeeeeeeeeee wwwwwwwwwwwwwwwwwwwwwww qqqqqqqqqqqqqqqqqqqqqq bbbbbbbbbbbbbbbbbbbb nnnnnnnnnnnnnnnnnn hhhhhhhhhhhhhhhhhh tttttttttttttttttttt rrrrrrrrrrrrrrrrrrrrrr eeeeeeeeeeeeeeeee wwwwwwwwwwwwwwwwwwwwww kkkkkkkkkkkkkkkk ,,,,,,,,,,,,,,,,,,,,, nnnnnnnnnnnnnnnnnnnnn bbbbbbbbbbbbbbbbb vvvvvvvvvvvvvvvvvvvvvv cat sm195.txt QQQ aaa

888 ((( cat sm196.txt muruganantham is cleverer than before. yyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyy yyyyyyyyyyyyyyyyyyyyy yyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyy cat sm204.txt murugan58Z@ asgkjakgjaskjgkljsTBB B PH[mar050460@linsoft mar050460]$ cat sm206.txt murugan58Z@ jsaghasjghjashgkTBB B PHsukumar58Z@ jsdfhasjklkjdakTBB B #PCHL.S.ELAIYARAJA@ JASJDHGJKSAHGJKHASKJGHAKSRAIYUR ,TRICHY. PGsivakumar8Z@ fkjdflkjhklsdfjhklsdflksdfjkljB B 01I[mar050460@linsoft mar050460]$ cat sm212acc.txt 10 20 30 40 cat sm212a.txt 1 2 3 4 5 6

cat sm212dat.txt murugan58Z@ dfjnhdsjkldsjkljdskljBB B PGsivaan58Z@ kldsjkdfjklsdjklsdjkldsklB B |HELAIYARAJA.L.S@ WESTSTREET,MADURAPURI,THURAIYUR.B PGsukua58Z@ dk fjklsdjfkjsdkljhsdklhjsdlkjdhk B ((PCG cat sm212d.txt murugan58Z@ jdsfhhjsdlhjsdlTBB B PHsivaan58Z@ jsdhgfjfhjjsdlTBB B #Lelaiya58Z@ jashgjhaghaasgasTBB B |Hsukua58Z@ agjajghsahghhkjhkhTBB B $|Hraja58Z@ dhasldlahjaljjhkhTBB B 'Isenthil58Z@ akrjsaklsjhlasjljTBB B 4 :I cat sm212na.txt

1 2 3 4 cat sm212nad.txt cat: sm212nad.txt: No such file or directory cat sm213.txt 1 2 3 4 5 6 7 8 9 cat sm217.txt muruganantham.s is cleverer than before. cat sm220.txt muruganantham.s is cleverer than before. cat sm221.txt /* 001. MULTIPLICATION OF TWO NUMBERS*/ main() { float a,b,c; a=10,b=2; c=a*b; printf("%f",c); } /*002. AREA OF THE CIRCLE */ #define pi 3.14 main() { int r; float a; r=10; a=pi*r*r; printf("%f",a); } [mar050460@linsoft mar050460]$ cat sm226.txt AAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAMURUGAN BBBBBBBBBBBBBBBBBBBBBBBBBBBB BBBBBBBBBBBBBBBmurugan 55555555555555555555555555555 555555555558478460

****************************** **********)(*&&&^ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAJFJFKLJJ$ KJDFKJHDKLSFJHKLSDJKLJSDKLJDFSKL JKLDFSJKLDQQQQQ AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAA BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB BBBBBBBBBBBBBBB CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC CCCCCCCCCCCCCC DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD DDDDDDDDDDDDD EEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEE EEEEEEEEEE FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF FFFFFFFFFFFFFFF GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG GGGGGGGGGGGGGG HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH HHHHHHHHHHHH IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII IIIIIIIIIIIII JJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJ JJJJJJJJJJJJJJJJJ kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk kkkkkkk llllllllllllllllllllllllllllllllllllllllllll lllll MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM MMMMM MMMM NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN NNNNNNN OOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO OOOOOOOOOOO PPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPP PPPPPPPPPPPPP QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ QQQQQQQQQQQQQQQQ RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR RRRRRRRRRRRRRRRRR SSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS SSSSSSSSSS TTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT TTTTTT MMMMMMMMMM MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM MMMM UUUUUUUUUUU UUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU RRRRRRRRRRRR RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR UUUUUUUUUUUUU UUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU GGGGGGGGGGGGGG GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG AAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA NNNNNNNNNNNNNNNN NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN AAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA

NNNNNNNNNNNNNNNNNN NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN TTTTTTTTTTTTTTTTTTT TTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT HHHHHHHHHHHHHHHHHHHH HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH AAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA MMMMMMMMMMMMMMMMMMMMMM MMMMMMMMMMMMMMMMMMMMMMMMMMMMMM DFHDFSH DSFHDSFH SDFHSDH DSD HDS HDS HDS HSD HD SH DSH D SHD D HDCVNXCN XCNCXN CNXCNC CNXCNCX CNCNC CNCXNC XCNXCNXC XCNXCN BBBBBBBBBBBBBB BBBBBBBBBBBBBBB BBBBBBBBBBBBBBBBB BBBBBBBBBBBBBBBBBBBB BBBBBBBBBBBBBBBBB (((( (((( (((( (((( (((( 574737373 773473474 47347474 47347347HJ dsdhjsdhjsd

dghsdghsdh dshdshdhds hdshdh cat sm227.txt murugan was a cleverer than before. muruganantham was a clever man. cat sm230.txt murugan was a cleverer than before. muruganantham was a clever man. cat sm231.txt murugan was a cleverer than before. muruganantham was a clever man. murugan was a cleverer than before. muruganantham was a clever man. cat sm232.txt muruganantham.sp@nmsdbgasdjkghsjkaghajkshksjaU@[@PG cat sm234.txt murugan-jkasdfakljklajklajks|LinuxPCHsivaan-lkasgjaskljklasjlkasjlk| LinuxPGelaiya ,y@p@thuraiyur@@,X@8 @,U@[@ PGsukumarkasfjgaskljaklsjgklasjgklasjklgjs& PGRAGHAV,y@p@USAi@,X@@,X@8 @,U@[@| H sm240.txt 1 2 3 4 5 6 7 8 9 10 cat sm288.txt muruganantham.s[mar050460@linsoft mar050460]$ cat sm292.txt muruganantham.s[mar050460@linsoft mar050460]$ cat sm293.txt murugan 25 murugan 400000.000000 west-street,madurapuri,thuraiyur. muruganantham.s murugan murugan murugan murugan

cat sm360.txt muruganantham.s@sjfaklgjasdfjkgkasjklgjaslgTBPG[mar050460@linsoft mar050460]$ cat s m362.txt MURUGANANTHAM.S@trichyklajhklasfklja@c@TB| HS.SIVAPB@CHENNAIRI,THURAIYUR@c@ TBGS.ELAIYARAJA.S@CHITHIRAIPATTIAIYUR@c@T B$PG $ cat sm435.txt murugan 25 10000 chennai