HA-01

#include <stdio.h>
void main()
{
int n,i,c=0;
printf("Enter number-");
scanf("%d",&n);
for(i=2;i<=sqrt(n);i++)
if(n%i==0)
{c=1;break;
}
if(c==0)
printf("Prime no.");
else
printf("Not an Prime no.");
}

HA-02
#include <stdio.h>
void main()
{
float a,b,c,d=0,d1=0,r1=0,r2=0;
printf("Enter a,b,c\n");
scanf("%f%f%f",&a,&b,&c);
d=b*b-4*a*c;
if(d>=0)
{
d1=sqrt(d);
 r1=(-b+d1)/2.0;
r2=(-b-d1)/2.0;
printf("\nRoots are \n%.2f\n %.2f",r1,r2);
}
else
{
d1=sqrt(-d);
printf("\nRoots are\n %.2f+%.2fi\n %.2f-%.2fi",(-b/2.0),(d1/2.0),(-b/2.0),(d1/2.0));
}
}

HA-03
#include <stdio.h>
int fact(int n);
int fact(int n)
{
if(n==1)
return 1;
return n*fact(n-1);
}
void main()
{
float s=0,x,t;
int n,i,c,ch;
printf("Enter x: ");
scanf("%f",&x);
printf("1-Original 2-Modified\nEnter Choice- ");
scanf("%d",&ch);
if(ch==1)
{printf("Enter n: ");
scanf("%f",&n);}
for(i=1;c<n;i+=2)
{
t=pow(x,i)/fact(i);
if(t>100000&&ch==2)
 break;
s+=pow(-1,c)*t;
++c;
}
printf("value=%f",s);
}

HA-04
#include <stdio.h>
#include <stdlib.h>
void main()
{
int *a,n,hi=0,lo=40,s=0;
float avg=0.0;
printf("Enter no. of elements: ");
scanf("%d",&n);
a=(int*)calloc(n,sizeof(int));
printf("\nEnter Marks-\n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(hi<a[i])
hi=a[i];
if(lo>a[i])
lo=a[i];
s+=a[i];
}
avg=s/n;
printf("Highest=%d\nLowest=%d\nAverage=%d",hi,lo,avg);
}

HA-05
#include <stdio.h>
#include <string.h>
void main()
{
char s[100],ch;
int l,i;
printf("Enter string-");
gets(s);
l=strlen(s);
for(i=0;i<l/2;i++)
{
ch=s[i];
s[i]=s[l-i-1];
s[l-i-1]=ch;
}
printf("Reversed String-%s",s);
}

HA-06
#include <stdio.h>
#include <stdlib.h>
int ssrch(int a[],int n,int key)
{
int i;
for(i=0;i<n;i++)
if(a[i]==key)
{printf("%d found at %d",key,i);return;}
printf("%d not found",key);
}
void bsrch(int a[], int n, int key)
{
int b=0, e=n-1, mid;
while(b<=e)
{
mid=(b+e)/2;
if(a[mid]<key)
b=mid+1;
else if(a[mid]>key)
e=mid-1;
else {printf("%d found at %d",key,mid);return;}
}
printf("%d not found",key);
}
void bsort(int a[], int n)
{
int i,j,t;
for(i=0;i<n-1;i++)
for(j=0;j<n-i-1;j++)
if(a[j]>a[j+1])
{ t=a[j];a[j]=a[j+1];a[j+1]=t;}
}
void ssort(int a[], int n)
{
int i,j,t,idx;
for(i=0;i<n-1;i++)
{
idx=i;
for(j=i+1;j<n;j++)
if(a[j]<a[idx])
idx=j;
t=a[idx];a[idx]=a[i];a[i]=t;
}
}
void isort(int a[], int n)
{
int i, key, j;
for(i=1;i<n;i++)
{

key=a[i];
j=i-1;
while(j>=0&&a[j]>key)
{
 a[j+1]=a[j];
j=j-1;
}
a[j+1]=key;
}
}
void main()
{
int *a,k,hi=0,min=100,max=0,f1,f,mode,median,i,j,ch,key;
float mean,stdv,s=0.0;
printf("Enter no. of elements: ");
scanf("%d",&k);
a=(int*)calloc(k,sizeof(int));
printf("\nEnter elements-\n");
for(i=0;i<k;i++)
{
scanf("%d",&a[i]);
if(max<a[i])
max=a[i];
if(min>a[i])
min=a[i];
s+=a[i];
}
mean=s/k;
printf("Enter Choice\n");
scanf("%d",&ch);
switch(ch)
{
case 1:
printf("Maximum=%d\nMinimum=%d\n",max,min);
break;
case 2:
mode=a[0];
median=a[k/2];
for(i=0;i<k;i++)
{f1=1;
for(j=i+1;j<k;j++)
if(i==a[j])
{++f1;a[j]=-1;}
if(f1>f)
{f=f1;mode=a[i];}
}
printf("Mean=%f\nMode=%d\nMedian=%d",mean,mode,median);
break;
case 3:
s=0;
for(i=0;i<k;i++)
s+=pow((a[i]-mean),2.0);
stdv=sqrt(s/(k-1));
printf("Standard Deviation=%.2f",stdv);
break;
case 4:
printf("Enter Key\n");
scanf("%d",&key);
ssrch(a,k,key);
break;
case 5:
printf("Enter Key\n");
scanf("%d",&key);
bsrch(a,k,key);
break;
case 6:
bsort(a,k);
break;
case 7:
ssort(a,k);
break;
case 8:
isort(a,k);
break;
default:printf("Sorry, wrong Choice");
}
if(ch==6||ch==7||ch==8)
{
printf("Sorted Array\n");
for(i=0;i<k;i++)
 printf("%d, ",a[i]);
}
}

HA-07
#include <stdio.h>
void main()
{
int r,c,i,j,a[10][10], b[10][10];
printf("Enter no. of rows: ");
scanf("%d",&r);
printf("\nEnter no. of columns: ");
scanf("%d",&c);
printf("\nEnter elements\n");

for(i=0;i<r;i++)
for(j=0;j<c;j++)
{
scanf("%d",&a[i][j]);
b[j][i]=a[i][j];
}
printf("\nEntered Array\n");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
printf("%d ",a[i][j]);
printf("\n");
}
printf("\nTransposed Array\n");
for(i=0;i<c;i++)
{
for(j=0;j<r;j++)
printf("%d ",b[i][j]);
printf("\n");
}
}
 HA-08
#include <stdio.h>
void main()
{
int r,c,i,j,a[10][10], b[10][10],s[10][10];
printf("Enter no. of rows: ");
scanf("%d",&r);
printf("\nEnter no. of columns: ");
scanf("%d",&c);
printf("\nEnter Matrix 1-\n");
for(i=0;i<r;i++)
for(j=0;j<c;j++)
scanf("%d",&a[i][j]);
printf("\nEnter Matrix 2-\n");
for(i=0;i<r;i++)
for(j=0;j<c;j++)
scanf("%d",&b[i][j]);
printf("\nArray 2:\n");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
s[i][j]=a[i][j]+b[i][j];
printf("%d ",s[i][j]);
}
printf("\n");
}
}

HA-09
#include <stdio.h>
void main()
{
int r,c,m,n,i,j,k,a[10][10], b[10][10],p[10][10];
printf("Enter no. of rows of Matrix 1: ");
scanf("%d",&r);
printf("Enter no. of columns of Matrix 1: ");
scanf("%d",&c);
printf("Enter no. of rows of Matrix 2: ");
scanf("%d",&m);
printf("Enter no. of columns of Matrix 2: ");
scanf("%d",&n);
if(r!=n)
printf("Multiplication not possible");
else
{
printf("\nEnter Matrix 1-\n");
for(i=0;i<r;i++)
for(j=0;j<c;j++)
scanf("%d",&a[i][j]);
printf("\nEnter Matrix 2-\n");
for(i=0;i<m;i++)
for(j=0;j<n;j++)
scanf("%d",&b[i][j]);
for(i=0;i<r;i++)
for(j=0;j<n;j++)
{
p[i][j]=0;
for(k=0;k<c;k++)
p[i][j]+=a[i][k]*b[k][j];
}
for(i=0;i<r;i++)
{
for(j=0;j<n;j++)
printf("%d ",p[i][j]);
printf("\n");
}}}

HA-10
#include <stdio.h>
void main()
{
int n,s=0;
printf("Enter n: ");
scanf("%d",&n);
while(n)
{
s+=n%10;
n/=10;
}
printf("Sum Of Digits=%d",s);
}

HA-11
#include <stdio.h>
void main()
{
int a, b,s,lcm,hcf,i,j;
printf("Enter a and b\n");
scanf("%d%d",&a,&b);
s=(a<b)?a:b;
for(i=1;i<=s;i++)
if(a%i==0&&b%i==0)
hcf=i;
lcm=a*b/hcf;
printf("LCM=%d\n",lcm);
printf("HCF=%d",hcf);
}

HA-12
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
float dst(int x1,int y1, int x2,int y2)
{
float d;
d=sqrt(pow((x1-x2), 2.0)+pow((y1-y2),2.0));
return d;
}
float arr(float d1,float d2,float d3)
{
float p,area;
p=(d1+d2+d3)/2;
area=sqrt(p*(p-d1)*(p-d2)*(p-d3));
printf("\nArea of Triangle=%.2f",area);
return(area);
}
void type(float d1,float d2,float d3)
{
if(d1==d2&&d1==d3)
printf("\nEquilateral Triangle");
else if(d1!=d2&&d1!=d2&&d2!=d3)
printf("\nScalene Triangle");
else printf("\nIsoseles Triangle");
}
int collinear(float d1,float d2,float d3)
{
if(d1+d2==d3||d1+d3==d2||d2+d3==d1)
return 1;
return 0;
}
float lrgt(float d1,float d2,float d3)
{
float ang,a,b,c,a1;
if(d1>=d2&&d1>=d3)
{a=d1;b=d2;c=d3;}
else if(d2>=d1&&d2>=d3)
{a=d2;b=d1,c=d3;}
else {a=d3;b=d1,c=d3;}
ang=acos((b*b+c*c-a*a)/(2*b*c));
a1=ang*180/3.14;
 printf("\nLargest Angle=%.2f",a1);
if(a1==90)
printf("\nRight Angle");
if(a1>=90)
printf("\nObtuse Angle");
else printf("\nAcute Angle");
return(a1);
}
void circle(int x1,int y1, int x2, int y2, int x3, int y3)
{
float p, q, r;
p=((x1*x1+y1*y1)*(y2-y3)+(x2*x2+y2*y2)*(y3-y1)+(x3*x3+y3*y3)*(y1-y2))/(2*(x1*(y2-y3)-
y1*(x2-x3)+x2*y3-x3*y2));
q=((x1*x1+y1*y1)*(x3-x2)+(x2*x2+y2*y2)*(x1-x3)+(x3*x3+y3*y3)*(x2-x1))/(2*(x1*(y2-y3)-
y1*(x2-x3)+x2*y3-x3*y2));
r=dst(p,q,x1,y1);
printf("\nCenter of Circle=(%.2f,%.2f)",p,q);
printf("\nRadius of Circle=%.2f",r);
}
void main()
{
float dst(int,int,int,int);
float arr(float,float,float);
void type(float,float,float);
int collinear(float,float,float);
int lrgtAng(float,float,float);
void circle(int,int,int,int,int,int);
int x[3],y[3],i;
float d1,d2,d3;
for(i=0;i<3;i++)
{printf("Enter x%d and y%d:\n",i+1,i+1);
scanf("%d%d",&x[i],&y[i]);}
d1=dst(x[0],y[0],x[1],y[1]);
d2=dst(x[1],y[1],x[2],y[2]);
d3=dst(x[2],y[2],x[3],y[3]);
if(collinear(d1,d2,d3))
printf("Points are Collinear");
else
 {
printf("AB=%.2f\nBC=%.2f\nCA=%.2f",d1,d2,d3);
arr(d1,d2,d3);
type(d1,d2,d3);
lrgt(d1,d2,d3);
circle(x[0],y[0],x[1],y[1],x[2],y[2]);
}
}

HA-13
#include <stdio.h>
void main()
{
int x1,x2,i,j,c=0,f=0;
printf("Enter x1 and x2\n");
scanf("%d%d",&x1,&x2);
for(i=x1;i<=x2;i++)
{c=0;
for(j=2;j<=sqrt(i);j++)
if(i%j==0)
++c;
if(c==0)
++f;
}
printf("No. of prime nos. b/w %d and %d=%d",x1,x2,f);
}

HA-14
#include <stdio.h>
#include <string.h>
void main()
{
char s[100];
int l,i,c=1;
 printf("Enter string-");
gets(s);
l=strlen(s);
for(i=0;i<l/2;i++)
if(s[i]!=s[l-i-1])
{
c=0;
printf("Not Pallindrome");
break;
}
if(c)
printf("Pallindrome");
}

HA-15
#include <stdio.h>
void main()
{
int n,n1,d,r=0,s,t;
printf("Enter no.-");
scanf("%d",&n);
n1=n;
do
{
d=n1%10;
r=r*10+d;
s+=d;
n1=n1/10;
}while(n1);
t=r+n;
printf("\nSum of Digits-%d",s);
printf("\nReversed no.-%d",r);
printf("\nSum of Original and Reversed no.-%d",t);
}
 HA-16
#include <stdio.h>
void main()
{
char c;
int n,n1,r,base=1,p=0;
printf("Enter Choice (D or B)\n");
scanf("%c",&c);
printf("Enter no.- ");
scanf("%d",&n);
switch(c)
{
case 'D':
while(n!=0)
{
r=n%2;
n1+=r*base;
n=n/2;
base*=10;
}
break;
case 'B':
while(n)
{
r=n%10;
n1+=r*(int)pow(2,p);
++p;
n=n/10;
}
break;
default:printf("Sorry, Wrong Choice");
}
printf("Converted no.- %d",n1);
}