Quadratic eqn:

#include<stdio.h>

#include<math.h>

Main()

Float a,b,c,r1,r2;

Float rp,ip,d;

Clrscr();

Printf(“enter the values of a,b,c\n”) ;

Scanf(“%f%f%f”,&a,&b,&c);

If(a==0||b==0||c==0)

Printf(“error:roots cannot be determined\n”);

Exit(1);

Else

D=b*b-4*a*c;

If(d<0)

Printf(“imaginary roots\n”);

Rp=-b/(2.0*a);

Ip=sqrt(abs(d))/(2.0*a);

Printf(“r1=%f+i%f\n”,rp,ip);

Printf(“r2=%f-i%f\n”,rp,ip);

Else if(disc==0)
{

Printf(“roots are real and equal\n”);

R1=-b/(2.0*a);

R2=r1;

Printf(“root1=%f\n”,r1);

Printf(“root2=%f\n”,r2);

Else if(d>0)

Printf(“roots are real and distinct\n”);

R1=(-b+sqrt(d))/(2.0*a);

R2=(-b-sqrt(d))/(2.0*a);

Printf(“root1=%f\n”,r1);

Printf(“root2=%f\n”,r2);

}
Bubble sort:

#include<stdio.h>

#define maxsize 10

Main()

Int array[maxsize];

Int I,j,n,temp;

Clrscr();

Printf(“enter the value of n\n”);

Scanf(“%d”,&n);

Printf(“enter the elements one by one\n”);

For(i=0;i<n;i++)

Scanf(“%d”,&array[i]);

Printf(“input array is\n”);

For(i=0;I<n;i++)

Printf(“%d\n”,array[i]);

/*bubble sort begins here*/

For(i=0;i<n;i++)

For(j=0;j<(n-i-1);j++)

If(array[j]>array[j+1])

{
Temp=array[j];

Array[j]=array[j+1];

Array[j+1]=temp;

Printf(“sorted array is…\n”);

For(i=0;i<n;i++)

Printf(“%d\n”,array[i]);

}
Matrix multiplication:

#include<stdio.h>

#define maxrows 10

#define maxcols 10

Main()

Int a[maxrows][maxcols],b[maxrows][maxcols],c[maxrows][maxcols];

Int m,n,p,q;

/*function declarations*/

Void readmatrix(int arr[][maxcols],int m,int n);

Void printmatrix(int arr[][maxcols],int m,int n);

Void productmatrix(int a[][maxcols],int b[][maxcols],int c[][maxcols],int m, int n);

Clrscr();

Printf(“enter the values of m and n\n”);

Scanf(“%d%d”,&m,&n);

Printf(“enter the values of p and q\n”);

Scanf(“%d%d”,&p,&q);

If(n!=p)

Printf(“multiplication not possible”);

Exit(1);

Printf(“enter matrix A\n”);

Readmatrix(a,m,n);

Printf(“enter matrix B\n”);

Readmatrix(b,p,q);

Printf(“matrix A”);
Printmatrix(a,m,n);

Printf(“matrix B”);

Printmatrix(b,p,q);

Productmatrix(a,b,c,m,n,p,q);

Printf(“the product matrix is\n”);

Printmatrix(c,m,q);

}/*end of main*/

/*function to read elements*/

Void readmatrix(int arr[][maxcols],int m,int n)

Int i,j;

For(i=0;i<m;i++)

For(j=0;j<n;j++)

Scanf(“%d”,&arr[i][j]);

/*function to print a matrix*/

Void printmatrix(int arr[][maxcols],int m,int n)

Int i,j;

For(i=0;i<m;i++)

For(j=0;j<n;j++)

{
printf(“%d”,arr[i][j]);

Printf(“\n”);

/*multiplication of matrices*/

Void productmatrix(int a[][maxcols],int b[][maxcols],int c[][maxcols],int m,int n,int p,int q)

Int i,j,k;

For(i=0;i<m;i++)

For(j=0;j<n;j++)

C[i][j]=0;

For(k=0;k<p;k++)

C[i][j]=c[i][j]+a[i][k]*b[k][j];

}
Prime or not:

#include<stdio.h>

#include<stdlib.h>

#include<math.h>

Main()

Int op;

Void checkprime();

Void printprime();

Printf(“enter 1 for checking a number and 2 for printing a sequence of primes\n”);

Switch(op)

Case 1: checkprime();

Break;

Case 2: printprime();

Break;

Default: printf(“invalid selection”);

Break;

}/*end of main*/

/*function to check prime number*/

Void checkprime()

Int num,j,flag;

Clrscr();

Priintf(“enter a number\n”);

Scanf(“%d”,&num);
If(num<=1)

Printf(“%d is not a prime number\n”,num);

Exit(1);

Flag=0;

For(j=2;j<=num/2;j++)

If((num%j)==0)

Break;

If(flag==0)

Printf(“%d is a prime number\n”,num);

Else

Printf(“%d is not a prime number\n”,num);

/*function to print sequence of primes*/

Void printprime()

Int m,n,i,j,flag,temp,count=0;

Clrscr();

Printf(“enter the value of m and n\n”);

Scanf(“%d%d”,&m,&n);

If(n<2)

{
Printf(“there are no primes upto %d\n”,n);

Exit(0);

Printf(“prime numbers are\n”);

Temp=m;

If(m%2==0)

m++;

For(i=m;i<=n;i=i+2)

Flag=0;

For(j=2;j<=i/2;j++)

If((i%j)==0)

Flag=1;

Break;

If(flag==0)

Printf(“%d\n”,i);

Count++;

Printf(“number of primes between %d and %d=%d\n”,temp,n,count);

}

Sum of n elements:

#include<stdio.h>

Void main()

Int n,i=1,op,sum=0;

Printf(“enter the value of n\n”);

Scanf(“%d”,&n);

Printf(“enter the selection number\n”);

Scanf(“%d”,&op);

Switch(op)

Case 1:

while(i<=n)

sum=sum+I;

i++;

Break;

Case 2:

do

Sum=sum+I;

I++;
}while(i<=n);

Break;

Case 3:

For(i=0;i<=n;i++)

sum=sum+i;

Break;

Default: printf(“invalid selection”);

Break;

Printf(“sum of %d elements is %d”,n,sum);