Being Coders | Be A Problem Solver

Dec Hex Oct Char Description 0 0 000 null 1 1 001 start of heading 2 2 002 start of text 3 3 003 end of text 4 4 004 end of transmission 5 5 005 enquiry 6 6 006 acknowledge 7 7 007 bell 8 8 010 backspace 9 9 011 horizontal tab 10 A 012 new line 11 B 013 vertical tab 12 C 014 new page 13 D 015 carriage return 14 E 016 shift out 15 F 017 shift in 16 10 020 data link escape 17 11 021 device control 1 18 12 022 device control 2 19 13 023 device control 3 20 14 024 device control 4 21 15 025 negative acknowledge 22 16 026 synchronous idle 23 17 027 end of trans. block 24 18 030 cancel 25 19 031 end of medium 26 1A 032 substitute 27 1B 033 escape 28 1C 034 file separator 29 1D 035 group separator 30 1E 036 record separator 31 1F 037 unit separator 32 20 040 space 33 21 041 ! 34 22 042 " 35 23 043 # 36 24 044 $ 37 25 045 % 38 26 046 & 39 27 047 ' 40 28 050 ( 41 29 051 ) 42 2A 052 * 43 2B 053 + 44 2C 054 , 45 2D 055 - 46 2E 056 . 4...

/* Transpose the matrix */ #include<stdio.h> int main() { int a[4][4],i,j,b; for(i=0;i<4;i++) { printf("\nEnter elements of %d row of Matrix: ",i+1); for(j=0;j<4;j++) scanf("%d",&a[i][j]); } for(i=0;i<4;i++) { for(j=i+1;j<4;j++) { b=a[i][j]; a[i][j]=a[j][i]; a[j][i]=b; } } printf("\nTransposed Matrix:\n\n"); for(i=0;i<4;i++) { for(j=0;j<4;j++) printf("%4d",a[i][j]); printf("\n"); } return 0; }

/* Sum of two Matrix */ #include<stdio.h> int main() { int a[5][5],b[5][5],c[5][5]; int i,j; for(i=0;i<5;i++) { printf("\nEnter elements of %d row of first Matrix: ",i+1); for(j=0;j<5;j++) scanf("%d",&a[i][j]); } for(i=0;i<5;i++) { printf("\nEnter elements of %d row of 2nd Matrix: ",i+1); for(j=0;j<5;j++) scanf("%d",&b[i][j]); } printf("\nSum of Matrix:\n\n"); for(i=0;i<5;i++) { for(j=0;j<5;j++) { c[i][j]=a[i][j]+b[i][j]; printf("%3d ",c[i][j]); } printf("\n"); } return 0; }

/* Matrix multiplication */ #include<stdio.h> int main() { int arr1[3][3],arr2[3][3],arr3[3][3]={0},i,j,k; printf("Type a matrix of 3 rows & 3 colomns :\n"); for(i=0;i<3;i++) for(j=0;j<3;j++) scanf("%d",&arr1[i][j]); printf("Type another matrix of 3 rows & 3 colomns :\n"); for(i=0;i<3;i++) for(j=0;j<3;j++) scanf("%d",&arr2[i][j]); for(i=0;i<3;i++) { for(j=0;j<3;j++) { for(k=0;k<3;k++) arr3[i][j]=arr3[i][j]+arr1[i][k]*arr2[k][j]; } } printf("\n\nOutput:\n"); for(i=0;i<3;i++) { for(j=0;j<3;j++) printf("%5d",arr3[i][j]); printf("\n\n"); } return 0; }

/* Sort array of 10 strings. */ #include<string.h> #include<stdio.h> int main() { int i,j; char str[10][10],temp[10]; printf("Type 10 names :\n"); for(i=0;i<10;i++) { // gets(str[i]); // fgets is a better option over gets to read multiword string . fgets(str[i], 10, stdin); } for(i=0;i<10;i++) { for(j=0;j<10-1-i;j++) { if(strcmpi(str[j],str[j+1])>0) { strcpy(temp,str[j]); strcpy(str[j],str[j+1]); strcpy(str[j+1],temp); } } } printf("\nSorted Names :\n"); for(i=0;i<10;i++) puts(str[i]); return 0; }

/* Insertion Sort */ #include<stdio.h> int main() { int arr[10],i,j,new; printf("Please enter 10 values:\n"); for(i=0;i<10;i++) scanf("%d",&arr[i]); for(i=1;i<10;i++) { new=a[i]; for(j=i-1;j>=0&&new<a[j];j--) { a[j+1]=a[j]; } a[j+1]=new; } printf("Sorted Array is:\n"); for(i=0;i<10;i++) printf("%d\n",arr[i]); return 0; }

/* Selection Sort */ #include<stdio.h> int main() { int arr[10],i,j,k,t; printf("Please enter 10 values:\n"); for(i=0;i<10;i++) scanf("%d",&arr[i]); for(i=0;i<10;i++) { k=i; for(j=i;j<10;j++) { if(a[k]>a[j]) k=j; } if(k!=i) { t=a[k]; a[k]=a[i]; a[i]=t; } } printf("Sorted Array is:\n"); for(i=0;i<10;i++) printf("%d\n",arr[i]); return 0; }

/* Bubble Sort */ #include<stdio.h> int main() { int arr[10],i,j,t; printf("Please enter 10 values:\n"); for(i=0;i<10;i++) scanf("%d",&arr[i]); for(i=0;i<9;i++) { for(j=0;j<9-i;j++) { if (arr[j]>arr[j+1]) { t=arr[j]; arr[j]=arr[j+1]; arr[j+1]=t; } } } printf("Sorted Array is:\n"); for(i=0;i<10;i++) printf("%d\n",arr[i]); return 0; }

/* Binary Search */ #include<stdio.h> int main() { int arr[10],i,max,min,mid,val,index; printf("Please enter 10 values in ascending order:\n"); for(i=0;i<10;i++) scanf("%d",&arr[i]); printf("\nEnter a value to be searched: "); scanf("%d",&val); max=9; min=0; index=-1; while(min<=max) { mid=(max+min)/2; if(val==arr[mid]) { index=mid; break; } if(arr[mid]>val) max=mid-1; else min=mid+1; } if(index>=0) printf("Value found in Array at %d location",index); else printf("Value not found in Array"); return 0; }

/* File Copy using command line arguments */ #include<stdio.h> int main(int argc,char *argv[]) { FILE *fs,*ft; int ch; if(argc!=3) { printf("Invalide numbers of arguments."); return 1; } fs=fopen(argv[1],"r"); if(fs==NULL) { printf("Can't find the source file."); return 1; } ft=fopen(argv[2],"w"); if(ft==NULL) { printf("Can't open target file."); fclose(fs); return 1; } while(1) { ch=fgetc(fs); if (feof(fs)) break; fputc(ch,ft); } fclose(fs); fclose(ft); return 0; }

/* File to upper case using command line arguments */ #include<stdio.h> int main(int n,char *a[]) { int c; FILE *fr,*fw; if(n!=3) { printf("Invalide numbers of arguments."); return 1; } if((fr=fopen(a[1],"r"))==NULL) { printf("File can't be open."); return 1; } if((fw=fopen(a[2],"r+"))==NULL) { printf("File can't be open."); fclose(fr); return 1; } while(1) { c=fgetc(fr); if(feof(fr)) break; c=~c; fputc(c,fw); } fclose(fr); fclose(fw); return 0; }

/* Count characters of file */ #include<stdio.h> int main() { FILE *fp; char a[10]; long cnt=0; int c; printf("Type a file name : "); gets(a); if((fp=fopen(a,"r"))==NULL) printf("File dosen't exist."); else { while(1) { c=fgetc(fp); if(feof(fp)) break; cnt++; } printf("\nfile have %ld characters",cnt); } fclose(fp); return 0; }

/* Write to text file */ #include<stdio.h> int main() { FILE *fp; char mystr[100]; fp=fopen("mytext.txt","w"); if(fp==NULL) { puts("Some error occured."); return 1; } printf("\nEnter some lines:\n"); while(strlen(gets(mystr))>0) { fputs(mystr,fp); fputs("\n",fp); } fclose(fp); return 0; }

/* Read text file */ #include<stdio.h> int main() { FILE *fp; int ch; fp=fopen("myfile.txt","r"); if(fp==NULL) { printf("Can't find the source file."); return 1; } while(1) { ch=fgetc(fp); if(feof(fp)) break; printf("%c",ch); } fclose(fp); return 0; }

/* Towers of Hanoi by recursion */ #include<stdio.h> void toh(int,char,char,char); int main() { int n=3; toh(n,'A','B','C'); return 0; } void toh(int n,char a,char b,char c) { if(n==1) printf("\nMoved from %c to %c",a,c); else { toh(n-1,a,c,b); toh(1,a,' ',c); toh(n-1,b,a,c); } }

/* Binary by recursion */ #include<stdio.h> void binary(long); int main() { long n; printf("Type a value : "); scanf("%ld",&n); binary(n); return 0; } void binary(long n) { if(n>1) binary(n/2); printf("%ld",n%2); }

/* greatest common divisor by recursion */ #include<stdio.h> int gcd(int,int); int main() { int a,b; printf("Type 2 values to find GCD :\n"); scanf("%d %d",&a,&b); printf("GCD : %d",gcd(a,b)); return 0; } int gcd(int m,int n) { if(n>m) return gcd(n,m); if(n==0) return m; return gcd(n,m%n); }  

/* Sum of digit by recursion */ #include<stdio.h> int sod(int); int main() { int i; printf(" Type any value : "); scanf("%d",&i); printf("Sum of digit : %d",sod(i)); return 0; } int sod(int n) { if(n<1) return 0; return(n%10+sod(n/10)); }

/* Reverse by Recursion */ #include<stdio.h> int rev(int,int); int main() { int a; printf("Type a value : "); scanf("%d",&a); printf("Reverse: %d",rev(a,0)); return 0; } int rev(int i,int r) { if(i > 0) return rev(i/10,(r*10)+(i%10)); return r; }

/* Fibonacci by Recursion */ #include<stdio.h> int fib(int); int main() { printf("Type any value : "); printf("\nNth value: %d",fib(getche()-'0')); return 0; } int fib(int n) { if(n<=1) return n; return(fib(n-1)+fib(n-2)); }

/* Power by Recursion */ #include<stdio.h> int pow(int,int); int main() { int i,j; printf("Type two values : \n"); scanf("%d %d",&i,&j); printf("i pow j = %d",pow(i,j)); return 0; } int pow(int i,int j) { if(j==1) return i; return (i*pow(i,j-1)); }

/* Factorial by Recursion */ #include<stdio.h> int fact(int); int main() { int n; printf("Type any value : "); scanf("%d",&n); n=fact(n); printf("\nFactorial : %d ",n); return 0; } int fact(int x) { if(x==1) return(x); else x=x*fact(x-1); }

1 3 8 15 27 50 92 169 311 void main() { int a=1, b=3, c=4, n=10, sum, i; printf("%d %d ",a,b,c); for(i=4; i<=n; i++) { sum = a+b+c; printf("%d ",sum); a = b; b = c; c = sum; } }

2 15 41 80 132 197 275 366 470 587   int main() { int a=2,i,n=10; for(i=1;i<=n;i++) { printf("%d ",a); a+=13*i; } return 0; }

1 2 3 6 9 18 27 54... int main() { int a=1,b=2,i,n=10; printf("%d %d ",a, b); for(i=3;i<=n;i++) { if(i%2==1) { a=a*3; printf("%d ",a); } else { b=b*3; printf("%d ",b); } } return 0; }

1/2 - 2/3 + 3/4 - 4/5 + 5/6 - ...... n int main() { double i, n,sum=0; n=10; for(i=1;i<=n;i++) { if ((int)i%2==1) sum+=i/(i+1); else sum-=i/(i+1); } printf("Sum: %lf",sum); return 0; }

[(1^1)/1] + [(2^2)/2] + [(3^3)/3] + [(4^4)/4] + [(5^5)/5] + ... + [(n^n)/n] long power(int a, int b) { long i, p=1; for(i=1;i<=b;i++) { p=p*a; } return p; } int main() { long i,n; double sum=0; n=5; for(i=1;i<=n;i++) { sum=sum+(power(i,i)/i); } printf("Sum: %lf",sum); return 0; }

(1!/1) + (2!/2) + (3!/3) + (4!/4) + (5!/5) + ... + (n!/n) long fact(int n) { long i, f=1; for(i=1;i<=n;i++) { f=f*i; } return f; } int main() { long i,n; double sum=0; n=5; for(i=1;i<=n;i++) { sum=sum+(fact(i)/i); } printf("Sum: %lf",sum); return 0; }

(1^1) + (2^2) + (3^3) + (4^4) + (5^5) + ... + (n^n) long power(int a, int b) { long i, p=1; for(i=1;i<=b;i++) { p=p*a; } return p; } int main() { long i,n,sum=0; n=5; for(i=1;i<=n;i++) { sum=sum+power(i,i); } printf("Sum: %d",sum); return 0; }

1! + 2! + 3! + 4! + 5! + ... + n! long fact(int n) { long i, f=1; for(i=1;i<=n;i++) { f=f*i; } return f; } int main() { long i,n,sum=0; n=5; for(i=1;i<=n;i++) { sum=sum+fact(i); } printf("Sum: %d",sum); return 0; }

(1) + (1+2) + (1+2+3) + (1+2+3+4) + ... + (1+2+3+4+...+n) int main() { int i,j,n,sum=0; n=10; for(i=1;i<=n;i++) { for(j=1;j<=i;j++) { sum+=j; } } printf("Sum: %d",sum); return 0; }

(1*1) + (2*2) + (3*3) + (4*4) + (5*5) + ... + (n*n) int main() { int i,n,sum=0; n=10; for(i=1;i<=n;i++) { sum+=i*i; } printf("Sum: %d",sum); return 0; }

1 + 2 + 3 + 4 + 5 + ... + n int main() { int i,n,sum=0; n=10; for(i=1;i<=n;i++) { sum+=i; } printf("Sum: %d",sum); return 0; }

ABCDE ABCD ABC AB A #include <stdio.h> int main() { int i, j; for(i=5;i>=1;i--) { for(j=1;j<=i;j++) { printf("%c",'A' + j-1); } printf("\n"); } return 0; }

ABCDE BCDE CDE DE E #include <stdio.h> int main() { int i, j; for(i=1;i<=5;i++) { for(j=i;j<=5;j++) { printf("%c", 'A'-1 + j); } printf("\n"); } return 0; }

EDCBA DCBA CBA BA A #include <stdio.h> int main() { int i, j; for(i=5;i>=1;i--) { for(j=i;j>=1;j--) { printf("%c",'A'-1 + j); } printf("\n"); } return 0; }

EDCBA EDCB EDC ED E #include <stdio.h> int main() { int i, j; for(i=1;i<=5;i++) { for(j=5;j>=i;j--) { printf("%c",'A'-1 + j); } printf("\n"); } return 0; }

A BB CCC DDDD EEEEE #include <stdio.h> int main() { int i, j; for(i=1;i<=5;i++) { for(j=1;j<=i;j++) { printf("%c",'A'-1 + i); } printf("\n"); } return 0; }

E DD CCC BBBB AAAAA #include <stdio.h> int main() { int i, j; for(i=5;i>=1;i--) { for(j=5;j>=i;j--) { printf("%c",'A'-1 + i); } printf("\n"); } return 0; }

EEEEE DDDD CCC BB A #include <stdio.h> int main() { int i, j; for(i=5;i>=1;i--) { for(j=1;j<=i;j++) { printf("%c",'A'-1 + i); } printf("\n"); } return 0; }

AAAAA BBBB CCC DD E #include <stdio.h> int main() { int i, j; for(i=1;i<=5;i++) { for(j=5;j>=i;j--) { printf("%c",'A'-1 + i); } printf("\n"); } return 0; }

A AB ABC ABCD ABCDE #include <stdio.h> int main() { int i, j; for(i=1;i<=5;i++) { for(j=1;j<=i;j++) { printf("%c",'A' + j-1); } printf("\n"); } return 0; }

E DE CDE BCDE ABCDE #include <stdio.h> int main() { int i, j; for(i=5;i>=1;i--) { for(j=i;j<=5;j++) { printf("%c",'A' + j-1); } printf("\n"); } return 0; }

A BA CBA DCBA EDCBA #include <stdio.h> int main() { int i, j; for(i=1;i<=5;i++) { for(j=i;j>=1;j--) { printf("%c",'A' + j-1); } printf("\n"); } return 0; }

E ED EDC EDCB EDCBA #include <stdio.h> int main() { int i, j; for(i=5;i>=1;i--) { for(j=5;j>=i;j--) { printf("%c",'A' + j-1); } printf("\n"); } return 0; }