Formula

Fahrenheit To Celsius
Celsius=(Fahrenheit-32.0)/1.8
C=(F-32)/1.8
(5/9)*(F-32)
Celsius To Fahrenheit
C*(9/5)+32
Area of Triangle= ½ lb => 0.5*l*b
Area of Circle = 3.14*r*r
Area of Rectangle = l*b
Area of Square = a*a
Circumference of rectangle = 2*(l*b)
Circumference of Circle = 2*3.14*r
Circumference of Triangle = l+b+sqrt(l*l+b*b)

E=1+1/1!+1/2!+1/3!+.. .. .. .. .

main()
{
float e=1;
int n=5,i;
int fact(int);
for(i=1;i<=n;i++)
e=e+1/fact(i);
printf("%f",e)
}
int fact(int n)
{
int i,f=1;
for(i=1;i<=n;i++)
f=f*i;
return(f);
}

e^x =1+x/1! + x(square)/2!+ x(cube)/3! +.. .. .. .. ..

main()
{
float e=0;
int n=5,i,x=2;
int fact(int);
for(i=1;i<=n;i++)
e=e+Math.Pow(x,i)/fact(i);//or use Math in #include
printf("%f",e)
}
int fact(int n)
{
int i,f=1;
for(i=1;i<=n;i++)
f=f*i;
return(f);
}

Pascal Triangle

Void main()
{
int n = 5,i,j;
for (i=1;i<=n;i++)
{
printf("\n*\n");
for (j = 1; j <= i * 2; j++)
printf("*");
(or)
/*
for (j = 1; j <= i; j++)
printf("**");
*/
}
}

Output
*
**
*
****
*
*******

Find Number of Occurance Characters

#include
#include
#include
void main()
{
int i=0,len=0,temp=0,count=0,temp1=0;
char a[25],ch,s,con='\0';
clrscr();
printf("\n\t Enter the name: ");
scanf("%s",a);
len=strlen(a);
printf("\n\t The length of the given name is: %d\n",len);
do
{
count=0;
printf("\n\t Enter the character to find : ");
s=getchar();
for(i=0;i {
if(s==a[i])
count++;
}
printf("\n\t Occurance is : %d",count);
getch();
printf("\n\t Do you want to find the occurance of characters (Y/y) : ");
con=getchar();
getch();
}while(con=='y'con=='Y');
}

/*
(OR)
printf("\n\t Enter the name: ");
ch=getchar();
a[len]=ch;
while(ch!='\n')
{
len++;
ch=getchar();
printf("\n%c",ch);
a[len]=ch;

}
printf("\n\t The length of the given name is: %d\n",len);
temp1=temp=len;
while(temp!=-1)
{
printf("%c",a[temp]);
temp--;
}

do
{
count=0;
printf("\n\t Enter the character to find : ");
s=getchar();
while(temp1!=0)
{
printf("%c",a[temp1]);
if(s==a[temp1-1])
{
count++;
temp1--;
}
else
temp1--;

}
printf("\n\t Occurance is : %d",count);
getch();
printf("\n\t Do you want to find the occurance of characters (Y/y) : ");
con=getchar();
getch();
}while(con=='y'con=='Y');
*/
Output
Enter the name: haiiii
The length of the given name is: 6
Enter the character to find :i
Occurance is : 4
Do you want to find the occurance of characters (Y/y) :n

Swapping of Two Number

#include
#include
void main()
{
int a=10,b=20,t;
clrscr();
printf("\nGiven Value A = %d and B = %d",a,b);
a=a+b;
b=a-b;
a=a-b;
printf("\nSwap Value Without Using Temporary Variable A = %d and B = %d",a,b);
t=a;
a=b;
b=t;
printf("\nSwap Value Using Temporary Variable A = %d and B = %d",a,b);
getch();
}
Output
Given Value A = 10 and B = 20
Swap Value Without Using Temporary Variable A = 20 and B = 10
Swap Value Using Temporary Variable A = 10 and B = 20

Sum of Series (/* (1/(2!))+(2/(3!))(3/(4!))(4/(5!))+....+(n/(n+1!)))

/* (1/(2!))+(2/(3!))(3/(4!))(4/(5!))+....+(n/(n+1!))*/
#include
#include
#include
void main()
{
int i,n;
float sum=0;
int factorial(int);/*Prototype*/
clrscr();
printf("Enter Value 'n' to Find Series(1/(2!))+(2/(3!))+(3/(4!))+...+(n/(n+1!)) : ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
sum=sum+(i/factorial(i+1));
}
printf("\n\tSum is : %.2f",sum);
getch();
}
int factorial(int n)
{
int i,fact=1;
for(i=1;i<=n;i++)
fact=fact*i;
return(fact);
}
Output
Enter Value 'n' to Find Series(1/(2!))+(2/(3!))+(3/(4!))+...+(n/(n+1!)) : 3
Sum is :

Sum of Series (1^3+3^3+5^3+.....+n^3)

1^3+3^3+5^3+.....+n^3
#include
#include
#include
void main()
{
int i,n,s=0;
clrscr();
printf("Enter Value 'n' to Find Series 1^3+3^3+5^3+...+n^3 : ");
scanf("%d",&n);
for(i=1;i<=n;i+=2)
s=s+pow(i,3);
printf("\n\tSum of Series is %d",s);
getch();
}
Output
Enter Value 'n' to Find Series 1^3+3^3+5^3+...+n^3 : 5
Sum of Series is 153

Sum of Digits

#include
#include
void main()
{
int sum=0,n;
clrscr();
printf("Enter Value for Sum of Digits : ");
scanf("%d",&n);
do
{
sum=sum+(n%10);
n=n/10;
}while(n!=0);
printf("\tSum of Digits is %d",sum);
getch();
}

Output
Enter Value for Sum of Digits : 123

Sum of Digits is 6

Sorting

#include
#include
void main()
{
int i,j,n,t,a[50],b[50];
clrscr();
printf("Enter Number Values To Sort : ");
scanf("%d",&n);
for(i=0;i {
printf("Enter Value [%d] : ",i+1);
scanf("%d",&a[i]);
b[i]=a[i];
}
for(i=0;i for(j=i+1;j {
if(a[i]>a[j])
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
}
printf("\nGiven\tAscending\tDescending");
for(i=0;i printf("\n%d\t%d\t\t%d",b[i],a[i],a[n-i-1]);
getch();
}
Output
Enter Number Values To Sort : 4
Enter Value [1] : 2
Enter Value [2] : 3
Enter Value [3] : 1
Enter Value [4] : 4
Given Ascending Descending
2 1 4
3 2 3
1 3 2
4 4 1

Reverse of Digits / Palindrome or Not

#include
#include
void main()
{
int a,n,rev=0,p;
clrscr();
printf("Enter Value to Reverse the Digits and Find is Palindrome : ");
scanf("%d",&n);
p=n;
while(n!=0)
{
a=n%10;
rev=rev*10+a;
n=n/10;
}
printf("\n\tReverse of %d is %d",p,rev);
if(p==rev)
printf("\n\t%d is Palindrom.",p);
else
printf("\n\t%d is Not a Palindrom.",p);
getch();
}
Output
Enter Value to Reverse the Digits and Find is Palindrome: 535
Reverse of 535 is 535
535 is Palindrome.

Quadratic Equation

Formula : x=(-b(+or-sqrt(b^2-(4*a*c)))/(2*a))
#include
#include
#include
void main()
{
int a,b,c,d;
float x1,x2;
clrscr();
printf("Enter Value for A,B,C : ");
scanf("%d%d%d",&a,&b,&c);
d=(b*b)-(4*a*c);
if(d>0)
{
printf("Roots are Real and Unequal");
x1=b+sqrt(d)/(2*a);
x2=-b-sqrt(d)/(2*a);
}
else if(d<0)
{
printf("Roots are Real and Imaginary");
d=-d;
x1=-b/(2*a);
x2=sqrt(d)/(2*a);
}
else if(d==0)
{
printf("Roots are Real And Equal");
x1=-b/(2*a);
x2=x1;
}
printf("\n\tX1 = %.2f",x1);
printf("\n\tX2 = %.2f",x2);
getch();
}

Output
Enter Value for A,B,C : 2 3 4
Roots are Real and Imaginary
X1 = 0.00
X2 = 1.20

Prime Number or Not

#include
#include
void main()
{
int a,i,n,flag=0;
clrscr();
printf("Enter Value to Find Prime Number or Not : ");
scanf("%d",&n);
for(i=2;i {
if((n%i)==0)
{
flag=1;
break; /*or i=i+a; */
}
}
if(flag==1)
printf("\t%d is Not a Prime Number",n);
else
printf("\t%d is Prime Number",n);
getch();
}
/* OR
void main()
{
int n,i=2;
clrscr();
printf("Enter Value to Find Prime or Not : ");
scanf("%d",&n);
while(i<=n-1)
{
if((n%i)==0)
{
printf("\t%d is Not a Prime Number",n);
break;
}
else
{
++i;
}
if(i==n)
printf("\t%d is Prime Number",n);
}
getch();
}
*/
Output
Enter Value to Find Prime Number or Not : 3
3 is Prime Number
Enter Value to Find Prime Number or Not : 6
6 is Not a Prime Number

Add Two Number Using Pointer

#include
#include
void main()
{
int a,b;
clrscr();
printf("\n\t Enter First Value : ");
scanf("%d",&a);
printf("\t Enter Second Value : ");
scanf("%d",&b);
printf("\n\t The Sum of %d + %d = %d",a,b,add(&a,&b));
getch();
}
int add(c,d)
int *c,*d;
{
int sum=0;
sum=*c+*d;
return(sum);
}
Output
Enter First Value : 2
Enter Second Value : 3
The Sum of 2 + 3 = 5

Pointer

#include
#include
void main()
{
int a;
int *ptr,**tmp,*se;
clrscr();
ptr=&a;
tmp=&ptr;
se=ptr;
a=5555;
printf("\n Value: %d",a);
printf("\n Address: %u",ptr);
printf("\n Indirect: %d",**tmp);
printf("\n Indirect Address: %u",&tmp);
printf("\n Value: %d",*se);
getch();
}
Output
Value: 5555
Address: 65480
Indirect: 5555
Indirect Address: 65484
Value: 5555

Pascal Triangle

#include
#include
void main()
{
int s,n=5,i,j,k;
clrscr();
s=n;
for(i=1;i<=n;i++)
{
for(j=1;j<=s;j++)
printf(" %d",s);
printf("\n");
for(k=1;k<=i;k++)
printf(" ");
s--;
}
getch();
}
Output
5 5 5 5 5
4 4 4 4
3 3 3
2 2
1

Pascal Triangle

#include
#include
void main()
{
int i,j,n=5;
clrscr();
for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
printf("%d",i);
printf("\n");
}
getch();
}
Output
1
22
333
4444
55555

Pascal Triangle

#include
#include
void main()
{
int i,j,n=5;
clrscr();
for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
printf("%d",j);
printf("\n");
}
getch();
}
Output
1
12
123
123412345

Pascal Triangle

#include
#include
void main()
{
int i,j,n=5;
clrscr();
for(i=1;i<=n;i++)
{
for(j=i;j<=n;j++)
printf("%d ",i);
printf("\n");
}
getch();
}
Output
1 1 1 1 1
2 2 2 2
3 3 3
4 4
5

Pascal Triangle (Premed)

#include
#include
void main()
{
int s,n=5,i,j,k;
clrscr();
s=n;
for(i=1;i<=n;i++)
{
printf("\n");
for(j=1;j<=s;j++)
printf(" ");
for(k=1;k<=i;k++)
printf("%d ",i);
s--;
}
getch();
}
Output
1
2 2
3 3 3
4 4 4 4
5 5 5 5 5

Binary Pascal Tryangle

#include
#include
void main()
{
int i,j;
clrscr();
for(i=1;i<=5;i++)
{
printf("\n\t");
for(j=1;j<=i;j++)
{
if((i+j)%2==0)
printf("1");
else
printf("0");
}
}
getch();
}
Output
1
01
101
0101
10101

Pascal Triangle

#include
#include
void main()
{
int i,j,n;
clrscr();
printf("Enter Value for pascal Triangle : ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
printf(" %d",i*j);
printf("\n");
}
getch();
}
Output
Enter Value for pascal Triangle : 5
1
2 4
3 6 9
4 8 12 16
5 10 15 20 25

Odd or Even Number

#include
#include
void main()
{
int n;
clrscr();
printf("Enter Value to Find Odd or Even Number : ");
scanf("%d",&n);
if((n%2)==0)
printf("\n\t%d is Even Number",n);
else
printf("\n\t%d is Odd Number",n);
getch();
}

Output
Enter Value to Find Odd or Even Number : 3
3 is Odd Number
Enter Value to Find Odd or Even Number : 2

2 is Even Number

Sum of Diagonal Matrix

#include
#include
void main()
{
int i,j,n,sum=0,sum2=0,a[50][50];
clrscr();
printf("Enter Matrix Row & Column, Row and Column must be same : ");
scanf("%d",&n);
for(i=0;i for(j=0;j {
printf("Enter Martix Value [%d][%d] : ",i,j);
scanf("%d",&a[i][j]);
sum2=sum2+a[i][j];
}
for(i=0;i sum=sum+a[i][i];
/*OR
for(i=0;i for(j=0;i {
if(i==j)
sum=sum+a[i][i];
}
*/
clrscr();
printf("Given Matrix :-\n");
for(i=0;i {
for(j=0;j printf("\t%d",a[i][j]);
printf("\n");
}
printf("\nSum of Diagonal Matrix is %d",sum);
printf("\nSum of Matrix is %d",sum2);
getch();
}
Output
Enter Matrix Row & Column, Row and Column must be same : 3
Enter Martix Value [0][0] : 1
Enter Martix Value [0][1] : 2
Enter Martix Value [0][2] : 3
Enter Martix Value [1][0] : 4
Enter Martix Value [1][1] : 5
Enter Martix Value [1][2] : 6
Enter Martix Value [2][0] : 7
Enter Martix Value [2][1] : 8
Enter Martix Value [2][2] : 9
Given Matrix :-
1 2 3
4 5 6
7 8 9
Sum of Diagonal Matrix is 15
Sum of Matrix is 45

Matrix Row and Column Sort

#include
#include
void main()
{
int a[10][10],b[10][10],i,j,k,r,c,t;
clrscr();
printf("Enter Number of Row : ");
scanf("%d",&r);
printf("Enter Number of Column : ");
scanf("%d",&c);
printf("\n\tEnter Matrix :-\n");
for(i=0;i for(j=0;j {
printf("Enter First Matrix Value[%d][%d] : ",i,j);
scanf("%d",&a[i][j]);
b[i][j]=a[i][j];
}
clrscr();
printf("\n\tGiven Matrix :-");
for(i=0;i {
printf("\n");
for(j=0;j {
printf("\t%d",a[i][j]);
}
}

printf("\n\n\tRow Sort :-");
for(i=0;i for(j=0;j for(k=j;k {
if(a[i][j]>a[i][k])
{
t=a[i][j];
a[i][j]=a[i][k];
a[i][k]=t;
}
}
for(i=0;i {
printf("\n");
for(j=0;j {
printf("\t%d",a[i][j]);
}
}

printf("\n\n\tColumn Sort :-");
for(i=0;i for(j=0;j for(k=j;k {
if(b[j][i]>b[k][i])
{
t=b[j][i];
b[j][i]=b[k][i];
b[k][i]=t;
}
}
for(i=0;i {
printf("\n");
for(j=0;j {
printf("\t%d",b[i][j]);
}
}

/*Column Sort for Matrix 'A' Sorted by Row*/
for(i=0;i for(j=0;j for(k=j;k {
if(a[j][i]>a[k][i])
{
t=a[j][i];
a[j][i]=a[k][i];
a[k][i]=t;
}
}
printf("\n\n\tGiven Matrix Row and Column Sort :-");
for(i=0;i {
printf("\n");
for(j=0;j {
printf("\t%d",a[i][j]);
}
}
getch();
}

Output
Enter Number of Row : 3
Enter Number of Column : 3
Enter Matrix :-
Enter First Matrix Value[0][0] : 9
Enter First Matrix Value[0][1] : 8
Enter First Matrix Value[0][2] : 7
Enter First Matrix Value[1][0] : 6
Enter First Matrix Value[1][1] : 5
Enter First Matrix Value[1][2] : 4
Enter First Matrix Value[2][0] : 3
Enter First Matrix Value[2][1] : 2
Enter First Matrix Value[2][2] : 1
Given Matrix :-
9 8 7
6 5 4
3 2 1
Row Sort :-
7 8 9
4 5 6
1 2 3
Column Sort :-
3 2 1
6 5 4
9 8 7
Given Matrix Row and Column Sort :-
1 2 3
4 5 6
7 8 9

Matrix Multiplication

#include
#include
void main()
{
int a[50][50],b[50][50],mmul[50][50],i,j,k,n,m,p;
clrscr();
printf("Enter Number of Rows in First Matrix : ");
scanf("%d",&m);
printf("Enter Number of Column in First Matrix : ");
scanf("%d",&n);
printf("\nNumber of Rows in Second Matrix is %d",n);
/*Number of Comumn in First Matirx and Number of Rows in Second Matirx Must be Same*/
printf("\nEnter Number of Column in Second Matrix : ");
scanf("%d",&p);
printf("\n\tEnter First Matrix :-\n");
for(i=0;i for(j=0;j {
printf("Enter First Matrix Value[%d][%d] : ",i,j);
scanf("%d",&a[i][j]);
}
printf("\tEnter Second Matrix :-\n");
for(i=0;i for(j=0;j {
printf("Enter Second Matrix Value[%d][%d] : ",i,j);
scanf("%d",&b[i][j]);
}
clrscr();
printf("\n\n\tFirst Matrix :-");
for(i=0;i {
printf("\n");
for(j=0;j {
printf("\t%d",a[i][j]);
}
}
printf("\n\n\tSecond Matrix :-");
for(i=0;i {
printf("\n");
for(j=0;j {
printf("\t%d",b[i][j]);
}
}
for(i=0;i for(j=0;j {
mmul[i][j]=0;
for(k=0;k mmul[i][j]=mmul[i][j]+a[i][k]*b[k][j];
/*In Pointer mmul[i][j]= (*(*(a+i)+k)*(*(*(b*k)+j)); */
}
printf("\n\n\tMatrix Multiplication :-");
for(i=0;i {
printf("\n");
for(j=0;j {
printf("\t%d",mmul[i][j]);
}
}
getch();
}

Output
Enter Number of Rows in First Matrix : 2
Enter Number of Column in First Matrix : 3

Number of Rows in Second Matrix is 3
Enter Number of Column in Second Matrix : 2
Enter First Matrix :-
Enter First Matrix Value[0][0] : 1
Enter First Matrix Value[0][1] : 2
Enter First Matrix Value[0][2] : 3
Enter First Matrix Value[1][0] : 4
Enter First Matrix Value[1][1] : 5
Enter First Matrix Value[1][2] : 6
Enter Second Matrix :-
Enter Second Matrix Value[0][0] : 7
Enter Second Matrix Value[0][1] : 8
Enter Second Matrix Value[1][0] : 9
Enter Second Matrix Value[1][1] : 3
Enter Second Matrix Value[2][0] : 4
Enter Second Matrix Value[2][1] : 5
First Matrix :-
1 2 3
4 5 6
Second Matrix :-
7 8
9 3
4 5
Matrix Multiplication :-
25 14
73 47

2D Matrix Addition And Subtraction

#include
#include
void main()
{
int a[10][10],b[10][10],madd[10][10],msub[10][10],i,j,n,m;
void funMatrixAdd(int m,int n,int a[10][10],int b[10][10],int madd[10][10]);/*Prototype*/
void funMatrixSub(int m,int n,int a[10][10],int b[10][10],int msub[10][10]);/*Prototype*/
clrscr();
printf("Enter Number of Row : ");
scanf("%d",&m);
printf("Enter Number of Column : ");
scanf("%d",&n);
printf("\tEnter First Matrix :-\n");
for(i=0;i for(j=0;j {
printf("Enter First Matrix Value[%d][%d] : ",i,j);
scanf("%d",&a[i][j]);
}
printf("\tEnter Second Matrix :-\n");
for(i=0;i for(j=0;j {
printf("Enter Second Matrix Value[%d][%d] : ",i,j);
scanf("%d",&b[i][j]);
}
clrscr();
printf("\n\n\tFirst Matrix :-");
for(i=0;i {
printf("\n");
for(j=0;j {
printf("\t%d",a[i][j]);
}
}
printf("\n\n\tSecond Matrix :-");
for(i=0;i {
printf("\n");
for(j=0;j {
printf("\t%d",a[i][j]);
}
}
funMatrixAdd(m,n,a,b,madd);
funMatrixSub(m,n,a,b,msub);
printf("\n\n\tMatrix Addition:-");
for(i=0;i {
printf("\n");
for(j=0;j {
printf("\t%d",madd[i][j]);
}
}
printf("\n\n\tMatrix Subtraction :-");
for(i=0;i {
printf("\n");
for(j=0;j {
printf("\t%d",msub[i][j]);
}
}
getch();
}
void funMatrixAdd(int m,int n,int a[10][10],int b[10][10],int madd[10][10])/*Matrix Addition*/
{
int i,j;
for(i=0;i for(j=0;j madd[i][j]=a[i][j]+b[i][j];
}
void funMatrixSub(int m,int n,int a[10][10],int b[10][10],int msub[10][10])/*Matrix Subtraction*/
{
int i,j;
for(i=0;i for(j=0;j msub[i][j]=a[i][j]-b[i][j];
}
Output
Enter Number of Row : 3
Enter Number of Column : 3
Enter First Matrix :-
Enter First Matrix Value[0][0] : 2
Enter First Matrix Value[0][1] : 1
Enter First Matrix Value[0][2] : 3
Enter First Matrix Value[1][0] : 4
Enter First Matrix Value[1][1] : 5
Enter First Matrix Value[1][2] : 6
Enter First Matrix Value[2][0] : 7
Enter First Matrix Value[2][1] : 7
Enter First Matrix Value[2][2] : 8
Enter Second Matrix :-
Enter Second Matrix Value[0][0] : 1
Enter Second Matrix Value[0][1] : 2
Enter Second Matrix Value[0][2] : 3
Enter Second Matrix Value[1][0] : 4
Enter Second Matrix Value[1][1] : 5
Enter Second Matrix Value[1][2] : 6
Enter Second Matrix Value[2][0] : 7
Enter Second Matrix Value[2][1] : 8
Enter Second Matrix Value[2][2] : 9
First Matrix :-
2 1 3
4 5 6
7 7 8
Second Matrix :-
2 1 3
4 5 6
7 7 8
Matrix Addition:-
3 3 6
8 10 12
14 15 17
Matrix Subtraction :-
1 -1 0
0 0 0
0 -1 -1

Largest of 2 and 3 Number

Using Ternary Operator or Conditional Operator
#include
#include
void main()
{
int a,b,c,lar2,lar3;
clrscr();
printf("Enter Value for A : ");
scanf("%d",&a);
printf("Enter Value for B : ");
scanf("%d",&b);
printf("Enter Value for C : ");
scanf("%d",&c);
lar2=(a>b)?a:b;
lar3=(a>b?((a>c)?a:c):(b>c?b:c));
printf("\nLargest of Two Number %d and %d is %d",a,b,lar2);
printf("\nLargest of Three Number %d , %d and %d is %d",a,b,c,lar3);
getch();
}
Enter Value for A : 3
Enter Value for B : 2
Enter Value for C : 1

Largest of Two Number 3 and 2 is 3
Largest of Three Number 3 , 2 and 1 is 3

/*Largest of 'N' Number*/
#include
#include
void main()
{
int i,n,a[50];/*a[]={5,3,2,9,4};*/
int lar=0;
clrscr();
printf("Enter Number of Value : ");
scanf("%d",&n);
for(i=0;i {
printf("Enter Value %d : ",i+1);
scanf("%d",&a[i]);
}
lar=a[0];
for(i=1;i {
if(a[i]>lar)
lar=a[i];
}
printf("Largest of given %d Number is %d",n,lar);
getch();
}
Output
Enter Number of Value : 4
Enter Value 1 : 3
Enter Value 2 : 2
Enter Value 3 : 1
Enter Value 4 : 4
Largest of given 4 Number is 4

Linear Search

#include
#include
void main()
{
int age[50],n,i,sage,flag=0;
char yn,name[50][50];
clrscr();
printf("Enter Number of Student : ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
printf("Enter Name of Student %d : ",i);
scanf("%s",name[i]);
printf("Enter Age of %s : ",name[i]);
scanf("%d",&age[i]);
}
do
{
clrscr();
flag=0;
printf("\tS.No\tNAME\tAGE");
for(i=1;i<=n;i++)
{
printf("\n\t%d\t%s\t%d",i,name[i],age[i]);
}
printf("\nEnter Student Age to Find Name and S.No : ");
scanf("%d",&sage);
for(i=1;i<=n;i++)
{
if(age[i]==sage)
{
printf("\n\tS.No : %d\n\tName : %s\n\tAge : %d\n",i,name[i],age[i]);
flag=1;
}
}
if(flag==0)
printf("\nStudent Age %d is not in our record.",sage);
printf("\nDo you Want to Continue (Y/y) : ");
yn=getchar();
}while((yn=='Y')(yn=='y'));
getch();
}

Output
Enter Number of Student : 3
Enter Name of Student 1 : c
Enter Age of c : 1
Enter Name of Student 2 : b
Enter Age of b : 3
Enter Name of Student 3 : a
Enter Age of a : 2
S.No NAME AGE
1 c 1
2 b 3
3 a 2
Enter Student Age to Find Name and S.No : 3
S.No : 2
Name : b
Age : 3
Do you Want to Continue (Y/y) :n

Binary Search

#include
#include
void main()
{
int age[50],n,j,i,sage,tage,flag=0;
int low,mid,high;
char yn,name[50][50],tname[50];
clrscr();
printf("Enter Number of Student : ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
printf("Enter Name of Student %d : ",i);
scanf("%s",name[i]);
printf("Enter Age of %s : ",name[i]);
scanf("%d",&age[i]);
}
do
{
clrscr();
flag=0;
/*For Binary Search First We Must Sort Array*/
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(age[i] {
tage=age[i];
age[i]=age[j];
age[j]=tage;
strcpy(tname,name[i]);
strcpy(name[i],name[j]);
strcpy(name[i],tname);
}
}
printf("\tS.No\tNAME\tAGE");
for(i=1;i<=n;i++)
{
printf("\n\t%d\t%s\t%d",i,name[i],age[i]);
}
printf("\nEnter Student Age to Find Name and S.No : ");
scanf("%d",&sage);
low=1;
high=n;
while(low<=high)
{
mid=(low+high)/2;
if(sage high=mid-1;
if(sage>age[mid])
low=mid+1;
if(sage==age[mid])
{
printf("\n\tS.No : %d\n\tName : %s\n\tAge : %d\n",mid,name[mid],age[mid]);
flag=1;
break;
}
}
if(flag==0)
printf("\nStudent Age %d is not in our record.",sage);
printf("\nDo you Want to Continue (Y/y) : ");
yn=getchar();
}while((yn=='Y')(yn=='y'));
getch();
}

Output
Enter Number of Student : 3
Enter Name of Student 1 : C
Enter Age of C : 3
Enter Name of Student 2 : B
Enter Age of B : 2
Enter Name of Student 3 : A
Enter Age of A : 1
S.No NAME AGE
1 C 1
2 B 2
3 A 3
Enter Student Age to Find Name and S.No : 2
S.No : 2
Name : B
Age : 2Do you Want to Continue (Y/y) :N

Fibonacci Search

#include
#include
void main()
{
int age[50],n,j,i,sage,tage,flag=0;
int p,q,m,t;
char yn,name[50][50],tname[50];
int fib(int);
clrscr();
printf("Enter Number of Student : ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
printf("Enter Name of Student %d : ",i);
scanf("%s",name[i]);
printf("Enter Age of %s : ",name[i]);
scanf("%d",&age[i]);
}
do
{
clrscr();
flag=0;
/*For Fibonacci Search First We Must Sort Array*/
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(age[i] {
tage=age[i];
age[i]=age[j];
age[j]=tage;
strcpy(tname,name[i]);
strcpy(name[i],name[j]);
strcpy(name[i],tname);
}
}
printf("\tS.No\tNAME\tAGE");
for(i=1;i<=n;i++)
{
printf("\n\t%d\t%s\t%d",i,name[i],age[i]);
}
printf("\nEnter Student Age to Find Name and S.No : ");
scanf("%d",&sage);
i=fib(n);
p=fib(n-1);
q=fib(n-2);
m=n+1-(i+p);
if(sage>age[i])
i=i+m;
while(i!=0)
{
if(sage {
if(q==0)
i=0;
else
{
i=i-q;
t=p;
p=q;
q=t-q;
}
}
if(sage==age[i])
{
printf("\n\tS.No : %d\n\tName : %s\n\tAge : %d\n",i,name[i],age[i]);
flag=1;
break;
}
if(sage>age[i])
{
if(p==1)
i=0;
else
{
i=i+q;
p=p-q;
q=q-p;
}
}
}
if(flag==0)
printf("\nStudent Age %d is not in our record.",sage);
printf("\nDo you Want to Continue (Y/y) : ");
yn=getchar();
}while((yn=='Y')(yn=='y'));
getch();
}
int fib(int f)
{
if(f<=1)
return(f);
else
return(fib(f-1)+fib(f-2));
}
Output
Enter Number of Student : 3
Enter Name of Student 1 : c
Enter Age of c : 3
Enter Name of Student 2 : b
Enter Age of b : 2
Enter Name of Student 3 : a
Enter Age of a : 1
S.No NAME AGE
1 c 1
2 b 2
3 a 3
Enter Student Age to Find Name and S.No : 3
S.No : 3
Name : a
Age : 3
Do you Want to Continue (Y/y) :n

Fibonacci using Recussion

/*0 1 1 2 3 5 8 13.....*/
#include
#include
void main()
{
int n,i;
int fib(int);/*Prototype*/
clrscr();
printf("Enter value to Find Fibonacci : ");
scanf("%d",&n);
for(i=1;i<=n;i++)
printf("\n\t%d",fib(i));
getch();
}
int fib(int i)
{
if((i==1)(i==2))
return(1);
else
return(fib(i-1)+fib(i-2));
}
Output
Enter value to Find Fibonacci : 5
1
1
2
3
5

Fibonacci

/*0 1 1 2 3 5 8 13.....*/
void main()
{
int n,i;
int a=0,b=1,c=0;
clrscr();
printf("Enter value to Find Fibonacci : ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
printf("\n\t%d",c);
c=a+b;
b=a;
a=c;
}
getch();
}
Output
Enter value to Find Fibonacci : 5
0
1
1
2
3

Factorial using Recussion

1*2*3*4*5=120
#include
#include
void main()
{
int n;
long int fact(int);/*Prototype*/
clrscr();
printf("Enter value to Find Factorial : ");
scanf("%d",&n);
printf("Factorial of %d is %d.",n,fact(n));
getch();
}
long int fact(int n)
{
if(n<=1) return(1); else return(n*fact(n-1)); }
Output
Enter value to Find Factorial : 5
Factorial of 5 is 120.

Factorial

1*2*3*4*5=120
#include
#include
void main()
{
int i,n,fact=1;
clrscr();
printf("Enter value to Find Factorial : ");
scanf("%d",&n);
for(i=1;i<=n;i++)
fact=fact*i;
printf("Factorial of %d is %d.",n,fact);
getch();
}
Output
Enter value to Find Factorial : 5
Factorial of 5 is 120.

Decimal(2) To Octal(8)

#include
#include
#include
#include
void main()
{
int n=12,n1,i=0,r,j;
int a[20];
n1=n;
clrscr();
while(n!=0)
{
r=n%8;
n=n/8;
a[i]=r;
i++;
}
/* a[i]='\0';Convert char array to string*/
printf("Decimal(2) %d Equalent Octal(8) is ",n1);
for(j=i-1;j>=0;j--)
printf("%d",a[j]);
getch();
}
Output
Decimal(2) 12 Equalent Octal(8) is 14

Decimal(2) To Binary(0,1)

#include
#include
#include
void main()
{
int n=12,n1,i=0,r,j;
int a[20];
n1=n;
clrscr();
while(n!=0)
{
r=n%2;
n=n/2;
a[i]=r;
i++;
}
printf("\nDecimal(2) %d Equalent Binary(0,1) is ",n1);
for(j=i;j>=0;j--)
printf("%d",a[j]);
getch();
}
Output
Decimal(2) 12 Equalent Binary(0,1) is 01100

Binary(0,1) To Decimal(2)

#include
#include
#include
void main()
{
int n=1101,n1,sum=0,i=0,r;
clrscr();
n1=n;
while(n!=0)
{
r=n%10;
n=n/10;
sum=sum+(r*pow(2,i));
i++;
}
printf("\nBinary(0,1) %d Equalent Decimal(2) is %d",n1,sum);
getch();
}
Output
Binary(0,1) 1101 Equalent Decimal(2) is 13

Octal(8) To Decimal(2)

#include
#include
#include
void main()
{
char oct[10]="14";
int n,sum=0,i=0,len,r;
clrscr();
n=atoi(oct);
len=strlen(oct);
while(i<=len)
{
r=n%10;
n=n/10;
sum=sum+(r*pow(8,i));
i++;
}
printf("\nOctal(8) %s Equalent Decimal(2) is %d",oct,sum);
getch();
}
Output
Octal(8) 14 Equalent Decimal(2) is 12

e^x

Formula : 1+(x/1!)+(x^2/2!)+(x^3/3!)+...+(x^n/n!)
#include
#include
#include
void main()
{
float x=4,x1=x,f,s=0;
int i,j,n=4;
clrscr();
x=3.14/180*x;
for(i=1;i<=n;i++)
{
f=1;
for(j=1;j<=i;j++)
f=f*j;
s=s+pow(x,i)/f;
}
printf("\ne^x %.2f is %.2f",x1,s);
getch();
}
Output
e^x 4.00 is 0.07

COS

Formula : 1-(x^2/2!)+(x^4/4!)+(x^6/6!)+...+(x^n/n!)
#include
#include
#include
void main()
{
float x=4,xt,f,s=0;
int i,j,n=4;
xt=x;
clrscr();
x=3.14/180*x;
for(i=2;i<=n;i+=2)
{
f=1;
for(j=1;j<=i;j++)
f=f*j;
s=s+pow(x,i)/f;
}
printf("COS %f is %f",xt,1-s);
getch();
}
Output
COS 4.000000 is 0.997565

SIN

Formula : x-(x^3/3!)+(x^5/5!)-(x^7/7!)+...+(x^n/n!)
#include
#include
#include
void main()
{
float x=4,xt,f,s=0;
int i,j,n=4,v=1;
xt=x;
clrscr();
x=3.14/180*x;
for(i=1;i<=n;i+=2)
{
f=1;
for(j=1;j<=i;j++)
f=f*j;
s=s+pow(x,i)/f*v; /* v for sign + or -*/
v=v*-1;
}
printf("SIN %.2f is %.2f",xt,s);
getch();
}
Output
SIN 4.00 is 0.07

Combination of ABC

#include
#include
void main()
{
char st[]={'A','B','C'};
int i,t=0,Tval=0,val=123;
clrscr();
printf("Combination of ABC\n");
for(i=0;i<=5;i++)
{
Tval=val;
while(Tval!=0)
{
t=Tval%10;
/*printf("%d",t);*/
printf("%c",st[t-1]);
Tval=Tval/10;
}
printf("\n");
switch(i)
{
case 0:
case 4:
val=val+9;
break;
case 1:
case 3:
val=val+81;
break;
case 2:
val=val+18;
break;
}
}
getch();
}
Output
Combination of ABC
CBA
BCA
CAB
ACB
BAC
ABC

Character Pointer

#include
#include
void main()
{
char a[15]="senthilkumar";
char *tmp,*se;
tmp=a;
se=tmp;
clrscr();
printf("%c\n",*(1+a));
printf("%c\n",1[a]);
while(*se !='\0')
{
printf("\n%c",*se);
printf("\t%u",&se);
se++;
}
getch();
}
Output
e
e
s 65484
e 65484
n 65484
t 65484
h 65484
i 65484
l 65484
k 65484
u 65484
m 65484
a 65484
r 65484

Amstrong Number Between 1-999

#include
#include
void main()
{
int i,d,n,s;
clrscr();
printf("Amstrong Number Between 1 to 999.\n");
for(i=1;i<=999;i++)
{
n=i;
s=0;
while(n!=0)
{
d=n%10;
s=d*d*d+s;
n=n/10;
}
if(i==s)
printf("%d\n",s);
}
getch();
}
Output
Amstrong Number Between 1 to 999.
1
153
370
371
407