Pk High files

Display matrix using class

pradeep — Mon, 08 Oct 2012 12:24:11 GMT

Quote

#include
#include
class mat
{
int a[30][30] , b[30][30], c[30][30];
int i, j,k ,l, m,n;
public:
void add(void);
void sub(void);
void mul(void);
void div(void);
};
void mat:: add()
{
cout<<"enter matrix size a:\n";
cin>>k>>l;
cout<<"Enter matrix size b:\n";
cin>>m>>n;
if((k==m)&&(l==n))
{
cout<<"\nENTER THE "< for(i=0;i {
for(j=0;j cin>>a[i][j];
}
cout<<"\nENTER THE "< for(i=0;i {
for(j=0;j cin>>b[i][j];
}
cout<<"\nSUM OF MATRIX A & B::\n";
for(i=0;i {
for(j=0;j c[i][j]=a[i][j]+b[i][j];
}
for(i=0;i {
for(j=0;j cout< cout<<"\n";
}
}
else
cout<<"\nADDITION IS NOT POSSIBLE::";
}
void mat::sub()
{
cout<<"\nENTER THE DIMENSION OF MATRIX A::\t";
cin>>k>>l;
cout<<"\nENTER THE DIMENSION OF MATRIX b::\t";
cin>>m>>n;
if((k==m)&&(l==n))
{
cout<<"\nENTER THE "< for(i=0;i {
for(j=0;j cin>>a[i][j];
}
cout<<"\nENTER THE "< for(i=0;i {
for(j=0;j cin>>b[i][j];
}
cout<<"\nDIFFERENCE OF THE MATRIX A & B::\n";
for(i=0;i {
for(j=0;j c[i][j]=a[i][j]-b[i][j];
}
for(i=0;i {
for(j=0;j cout< cout<<"\n";
}
}
else
cout<<"\nSUBSTRACTION IS NOT POSSIBLE::";
}
void mat::mul()
{
cout<<"\nENTER THE DIMENSION OF MATRIX A::\t";
cin>>k>>l;
cout<<"\nENTER THE DIMENSION OF MATRIX b::\t";
cin>>m>>n;
if((k==m)&&(l==n))
{
cout<<"\nENTER THE " < for(i=0;i {
for(j=0;j cin>>a[i][j];
}
cout<<"\nENTER THE " < for(i=0;i {
for(j=0;j cin>>b[i][j];
}
cout<<"\nPROCUCT OF THE MATRIX A & B::\n";
for(i=0;i {
for(j=0;j {
c[i][j]=a[i][j]*b[i][j];
}
}
for(i=0;i {
for(j=0;j cout< cout<<"\n";
}
}
else
cout<<"\nMULTIPLICATION IS NOT POSSIBLE::";
}
void mat::div()
{
cout<<"\nENTER THE DIMENSION OF MATRIX A::\t";
cin>>k>>l;
cout<<"\nENTER THE DIMENSION OF MATRIX b::\t";
cin>>m>>n;
if((k==m)&&(l==n))
{
cout<<"\nENTER THE " < for(i=0;i {
for(j=0;j cin>>a[i][j];
}
cout<<"\nENTER THE " < for(i=0;i {
for(j=0;j cin>>b[i][j];
}
cout<<"\nPROCUCT OF THE MATRIX A & B::\n";
for(i=0;i {
for(j=0;j {
c[i][j]=0;
for(k=0;k c[i][j]=a[i][j]/b[i][j];
}
}
for(i=0;i {
for(j=0;j cout< cout<<"\n";
}
}
else
cout<<"\nDIVISION IS NOT POSSIBLE::";
}

int main()
{
int c;
char ch;
mat M;
cout<<"\n\t\tMATRIX OPERATION BY Pradeep Kumar\n\n";
cout<<"\n1.ADDITION\n2.SUBSTRACTION\n3.MULTIPLICATION\n4.DIVISION";
cout<<"\nENTER YOUR CHOICE ::\t";
cin>>c;
switch©
{
case 1:M.add();
break;
case 2:M.sub();
break;
case 3:M.mul();
case 4:M.div();
break;
}
cout<<"Thanks for Using http://highfile.ucoz.com \n ";
getch();

}

Dispaly Matrix

pradeep — Mon, 16 Jan 2012 05:44:49 GMT

#include
#include
#include
main()
{
int a[3][3],b[3][3],i,j;
clrscr();
for(i=0;i<3;i++)
{
printf("input values for row no.%d\n",i+1);
for(j=0;j<3;j++)
{
printf("\t Enter the value:");
scanf("%d",&a[i][j]);
}
}
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
b[i][j]=a[j][i];
}
}
printf("The Transpose Matrix is:\n");
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)

printf(" %d\t",b[i][j]);
printf("\n");
}
getch();
}

REGULA FASAI

pradeep — Mon, 16 Jan 2012 05:43:29 GMT

#include
#include
#include
#define f(x) x*x+x-1
void main()
{
float x0,x1,x2,f0,f1,f2,e;
int max,i;
clrscr();
printf("?Input Two initial Roots,Max iteration and torlerance value:");
scanf("%f%f%d%f",&x0,&x1,&max,&e);
f0=f(x0);
f1=f(x1);
if(f0*f1>0.0)
{
printf("\ Initial roots are unsuitable\n");
}
else
{
for(i=1;i<=max; i++)
{
x2=(x0*f1-x1*f0)/(f1-f0);
f2=f(x2);
if(fabs(f2) {
printf("\solution is converge\n");
printf("\Root of the given equation is =%8.4f\n",x2);
max=i;
}
else
{
if(f2*f0<0)
{
x1=x2;
f1=f2;
}
else
{
x0=x2;
f0=f2;
}
}
}
}
getch();
}

Trapezoidal Rule

pradeep — Mon, 16 Jan 2012 05:42:04 GMT

/* Trapezoidal Rule*/
#include
#include
#include
void main ()
{
float f (float x);
float x0, xn, h, sum, result;
int i, n;
clrscr();
printf("Enter the Lower Limits of Integral :");
scanf("%f",&x0);
printf("Enter the Upper Limits of Integral :");
scanf("%f",&xn);
printf("\n Enter the segment width :");
scanf("%f" ,&h);
n = (int)((xn - x0)/h);
sum = f(x0)+f(xn)/2;
for(i=1; i {
sum = sum+f(x0 +i*h );
}
result = sum*h;
printf("\n\n Value of integral using trapezoidal rule is =%f\n\n", result);
getch();
}
float f (float x)
{
return(1.0/(1.0+x*x));
}

Download Example pick

pradeep — Fri, 06 Jan 2012 14:51:00 GMT

hello friend,
Download Example Pick click here

Extract files and copy all file in your tc bin folder
After run TC++ And open File .

Go LUCK !!!!

SEE Images

Added (06 January 12, 8:21 PM)
---------------------------------------------
Download Here Tc++ GO

simpson's (1/3) Rule

pradeep — Wed, 02 Nov 2011 13:22:00 GMT

Code

/* simpson's (1/3) Rule */
#include
#include
#include
void main ( )
{
  float f (float x); /* function prototype */
  float a, b , h, sum = 0.0 , result;
  int i , n;
  clrscr ();
  printf(" Enter lower limit of the integral:");
  scanf("%f", &a);
  printf("\n Enter upper limit of the intgral :");
  scanf("%f" , &b);
  printf("\n Enter the number of segments:");
  scanf("%d", &n);

  if(n % 2!= 0)
   printf("\n Number of segments not even number\n");
  else
{
  h=(b-a)/n;
  sum =f(a)+f(b); /*Function call */
  for(i=1; i {
  if(i %2 ==0)
   sum = sum +2.0*f(a+i*h);/*function call*/
  else
   sum = sum + 4.0*f(a+i*h);/*function call*/
}
  result =(h/3.0)* sum;
  printf("\n\ Value of integral is = %f\n\n ", result );
}
  getch( );
}
  /* function definition f( )*/
  float f ( float x)
{
  return(1.0/(1.0 + x*x)); /* integrand */
}

Runge-Kutta Method of Fourth order

pradeep — Wed, 02 Nov 2011 13:20:58 GMT

Code

/*Runge-Kutta Method of Fourth order*/
#include
#include
#include
void main()
{
      float f (float x, float y);/* function prototype*/
       float x0, y0, h, xn, k1, k2, k3, k4, k, x, y;
        int i, n;
        clrscr();
         printf("Enter the initial values of x and y :");
         scanf("%f%f", &x0, &y0);
         printf("\n Enter x at which y is required :");
         scanf("%f" , &xn);
         printf("\n Enter step size;");
         scanf("%f",&h);
         n = ((xn-x0)/h+0.5);
             x=x0;
               y=y0;
            printf("\n\n step x y \n\n ");
   for (i=1; i <= n; i++)
{
  k1=h*f(x ,y);/* function call */
  k2=h*f(x+h/2.0, y + k1/2.0);/* Function call*/
  k3=h*f(x+h/2.0, y + k2/2.0);/* Function call*/
  k4=h*f(x+h, y+k3); /* function call*/
  k =(k1+2.0 * (k2+k3) +k4)/6.0;
  x=x+h;
  y=y+k;
  printf ("%3d%10.3f%10.3f\n" , i, x , y);
}
  printf("\n Value of y at x = %f is %f\n\n", x, y );
  getch( );
}
  /* function denfinition f()*/
  float f ( float x , float y)
{
  return (x*y*y -y/x); /*R.H.S of the given equation */

}

Euler's Method

pradeep — Wed, 02 Nov 2011 13:19:43 GMT

Quote

/* Euler's Method */
#include
#include
#include
#define f(x,y) (y-x)/(y+x)/* R.H.S of the equation */
void main()
{
float x, y, h, xn;
int i = 0, n;
clrscr();
printf(" Enter the initial values of x and y : ");
scanf("%f%f", &x, &y );
printf("\n Enter x at which y is required :");
scanf("%f",&xn);
printf("\n Enter step size h : ");
scanf("%f",&h);

n= ((xn-x)/h+0.5);
printf("\n\n step x y\n\n");
while(x { y=y+h*f(x,y);
x=x+h;
i=i+1;
printf("%3d%10.4f%10.4f\n",i,x,y);
}
printf("\n value of y at x = %f is %f\n\n",x,y);
getch();
}

BISECTION METHOD

pradeep — Wed, 02 Nov 2011 13:16:26 GMT

#include
#include
#include
#define f(x) x*x+x-2.0*x-5.0
void main()
{
float x,x0,x1,x2,y0,y1,y2,e;
int max,i;
clrscr();
printf("Input Two initial Starting Roots\n:");
scanf("%f%f",&x0,&x1);
printf("Input the tolerance value\n");
scanf("%f",&e);
y0=f(x0);
y1=f(x1);
if(y0*y1>0.0)
{
printf("\ Initial roots are unsuitable\n");
}
else
{
while((fabs(x1-x0)/x1) {
x2=(x0+x1)/2;
y2=f(x2);
if(y0*y2>0)
x0=x2;
else
x1=x2;
}
printf("\solution is converge\n");
printf("\Root of the given equation is =%8.4f\n",x2);
}
getch();
}

If any error send feed back