Matrix Summation

#include<stdio.h>

int main()

{

    int c[100][100],a[50][50],b[50][50],an,am,bn,bm,i,j;

    printf("Enter a number of row and collum of a");

    scanf("%d%d",&an,&am);

    printf("Enter a number of row and collum of b");

    scanf("%d%d",&bn,&bm);

    printf("Enter matrix a \n");

        for(i=0;i<an;i++)

            {

                for(j=0;j<am;j++)

                {

                    scanf("%d",&a[i][j]);

                }

            }

            printf("enter matrix b \n");

            for(i=0;i<bn;i++)

            {

                for(j=0;j<bm;j++)

                {

                 

                    scanf("%d",&b[i][j]);

                }

            }

    if((an!=bn)||(am!=bm))

    {

        printf("sum cannot be done /n");

        }

        else

        {

        for(i=0;i<an;i++)

            {

                for(j=0;j<am;j++)

                {

                    c[i][j]=a[i][j]+b[i][j];

                }

            }

             

             

             

            printf("matrix a is \n");

            for(i=0;i<an;i++)

            {

                for(j=0;j<am;j++)

                {

                    printf(" %d ", a[i][j] );

                }

                printf("\n");

            }

             

             

            printf("matrix b is \n");

            for(i=0;i<an;i++)

            {

                for(j=0;j<am;j++)

                {

                    printf(" %d ", b[i][j] );

                }

                printf("\n");

            }

             

             

            printf("sum of a and b is \n");

            for(i=0;i<an;i++)

            {

                for(j=0;j<am;j++)

                {

                    printf(" %d ", c[i][j] );

                }

                printf("\n");

            }

        }

return 0;

    }

Matrix Multiplication

#include<stdio.h>

int main() {

   int a[10][10], b[10][10], c[10][10], i, j, k;

   int sum = 0;

   printf("\nEnter First Matrix : n");

   for (i = 0; i < 3; i++) {

      for (j = 0; j < 3; j++) {

         scanf("%d", &a[i][j]);

      }

   }

   printf("\nEnter Second Matrix:n");

   for (i = 0; i < 3; i++) {

      for (j = 0; j < 3; j++) {

         scanf("%d", &b[i][j]);

      }

   }

   printf("The First Matrix is: \n");

   for (i = 0; i < 3; i++) {

      for (j = 0; j < 3; j++) {

         printf(" %d ", a[i][j]);

      }

      printf("\n");

   }

   printf("The Second Matrix is : \n");

   for (i = 0; i < 3; i++) {

      for (j = 0; j < 3; j++) {

         printf(" %d ", b[i][j]);

      }

      printf("\n");

   }

   for (i = 0; i <= 2; i++) {

      for (j = 0; j <= 2; j++) {

         sum = 0;

         for (k = 0; k <= 2; k++) {

            sum = sum + a[i][k] * b[k][j];

         }

         c[i][j] = sum;

      }

   }

   printf("\nMultiplication Of Two Matrices : \n");

   for (i = 0; i < 3; i++) {

      for (j = 0; j < 3; j++) {

         printf(" %d ", c[i][j]);

      }

      printf("\n");

   }

   return (0);

}

Practical set 5 (Secant Method)

#include<stdio.h>

#include<stdlib.h>

#include<math.h>

 

float fun(float x)

 {

    x=(x*sin(x))-1;

//  x=4*(pow(x,3))-(2*x)-6;

 //   x=x-(exp(1)*x)+2;

    return x;

 }

   

  float iteration(float a, float b)

  {

    float x;

x=((a*fun(b))-(b*fun(a)))/(fun(b)-fun(a));

      return x;

  }

   

 int main()

  {

      int i,n;

      int p[20];

      float a,b,x[10];

       

      printf("\nQuestion is : 4x^3-2x-6=0 \n");

      printf("\nEnter how many iteration : ");scanf("%d",&n);

       

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

   {

       p[i]=fun(i);

       printf("\n f[%d] : %d ",i,p[i]);

   }

    

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

    {

        if(p[i]*p[i+1]<0)

         {

            a=i;

            b=i+1;

            printf("\nThe root lies between : [%0.4f %0.4f]",a,b);

            break;

            }      

        }

        x[0]=a;

        x[1]=b;

        printf("\n x[0] : %f  ",x[0]);

        printf("\n x[1] : %f  ",i,x[1]);

        for(i=2;i<n;i++)

        {

            x[i]=iteration(x[i-2],x[i-1]);

            printf("\n x[%d] : %f  ",i,x[i]);

        }

return 0;

 }













by meet kheni