Skip to main content

matrix multiplication in java

Matrix.java

import java.util.*;
class Matrix{
 public static void main(String args[])throws Exception
 {
  Scanner s=new Scanner(System.in);
  int r1,r2,c1,c2;
  
  System.out.println("Enter row and column for matrix1:");
  r1=s.nextInt();
  c1=s.nextInt();
  
  int[][] m1=new int[r1][c1];
  
  System.out.println("Enter the elements of first matrix");
  for(int i=0;i < r1;i++)
  {
   for(int j=0;j < c1;j++)
   {
    m1[i][j]=s.nextInt();
   }
   
  }
  
  System.out.println("Enter row and column for matrix2:");
  r2=s.nextInt();
  c2=s.nextInt();
  
  if(c1!=r2)
  {
    System.out.println("Matrix multiplication is not possible");
  }

  else
  {
   int m2[][] = new int[r2][c2];
   int multiply[][] = new int[r1][c2];
   int sum=0;
 
   System.out.println("Enter the elements of second matrix");
 
   for(int i=0;i < r2;i++)
   {
    for(int j=0;j < c2;j++)
    {
     m2[i][j]=s.nextInt();
    }
   }
   for(int i=0;i < r1;i++)
   {
    for(int j=0;j < c2;j++)
    {   
     for(int k=0;k < r2;k++)
     {
      sum=sum+m1[i][k]*m2[k][j];
     }
     multiply[i][j] = sum;
     sum = 0;
    }
   }
   System.out.println("multiplication of m1*m2 matrices:");
   System.out.println("--------------------------------");
 
   for (int i=0;i < r1;i++)
   {
    for (int j=0;j < c2;j++)
     System.out.print(multiply[i][j]+"\t");
 
    System.out.print("\n");
   }
  }
 }
}

OUTPUT

javac Matrix.java

java Matrix
Enter row and column for matrix1:
3
3
Enter the elements of first matrix
1       2       3
4       5       6
7       8       9
Enter row and column for matrix2:
3 3
Enter the elements of second matrix
9       8       7
6       5       4
3       2       1
multiplication of m1*m2 matrices
--------------------------------
30       24       18
84       69       54
138     114       90


Comments

Popular posts from this blog

MVT (Multiprogramming Variable Task) in C Programming

#include #include void main() { int i,os_m,nPage,total,pg[25]; clrscr(); printf("\nEnter total memory size:"); scanf("%d",&total); printf("\nEnter memory for OS:"); scanf("%d",&os_m); printf("\nEnter no. of pages:"); scanf("%d",&nPage); for(i=0;i =pg[i]) { printf("\n Allocate page %d",i+1); total=total-pg[i]; } else printf("\n page %d is not allocated due to insufficient memory.",i+1); } printf("\n External Fragmentation is:%d",total); getch(); } OUTPUT Enter total memory size:1024 Enter memory for OS:256 Enter no. of pages:4 Enter size of page[1]:128 Enter size of page[2]:512 Enter size of page[3]:64 Enter size of page[4]:512 Allocate page 1 Allocate page 2 Allocate page 3 page 4 is not allocated due to insufficient memory. External Fragmentation is:64

First Come First Serve (FCFS) Page replacement algorithm in C Programming

#include #include int fsize; int frm[15]; void display(); void main() { int pg[100],nPage,i,j,pf=0,top=-1,temp,flag=0; clrscr(); printf("\n Enter frame size:"); scanf("%d",&fsize); printf("\n Enter number of pages:"); scanf("%d",&nPage); for(i=0;i OUTPUT Enter frame size:3 Enter number of pages:12 Enter page[1]:1 Enter page[2]:2 Enter page[3]:3 Enter page[4]:4 Enter page[5]:1 Enter page[6]:2 Enter page[7]:5 Enter page[8]:1 Enter page[9]:2 Enter page[10]:3 Enter page[11]:4 Enter page[12]:5 page | Frame content -------------------------------------- 1 | 1 -1 -1 2 | 1 2 -1 3 | 1 2 3 4 | 4 2 3 1 | 4 1 3 2 | 4 1 2 5 | 5 1 2 1 | 5 1 2 2 | 5 1 2 3 | 5 3 2 4 | 5 3 4 5 | 5 3 4 ---------------------------...

Deadlock Prevention using Banker’s Algorithm in C Programming

#include #include void main() { int allocated[15][15],max[15][15],need[15][15],avail[15],tres[15],work[15],flag[15]; int pno,rno,i,j,prc,count,t,total; count=0; clrscr(); printf("\n Enter number of process:"); scanf("%d",&pno); printf("\n Enter number of resources:"); scanf("%d",&rno); for(i=1;i OUTPUT Enter number of process:5 Enter number of resources:3 Enter total numbers of each resources:10 5 7 Enter Max resources for each process: for process 1:7 5 3 for process 2:3 2 2 for process 3:9 0 2 for process 4:2 2 2 for process 5:4 3 3 Enter allocated resources for each process: for process 1:0 1 0 for process 2:3 0 2 for process 3:3 0 2 for process 4:2 1 1 for process 5:0 0 2 available resources: 2 3 0 Allocated matrix Max need 0 1 0| 7 5 3| 7 4 3 3 0 2| 3 2 2| 0 2 0 3 0 2| 9 0 2| 6 0 0 2 1 1| ...