Neeraj Mishra Error One comment

Solve Error “the import org.apache cannot be resolved” in Java

How can you resolve the import org.apache error from your program? Nowadays, when developers are preparing some codes in Java, the common error is import org.apache error takes a lot of time to resolve. This is because of the minor mistake you may do while coding, and no apache library is installed on them. Apache library is crucial for coding on Java and requires several corrections to develop a program efficiently. Most developers face this common issue in their developing

Neeraj Mishra Algorithm One comment

Hill Cipher in Java [Encryption and Decryption]

Here you will learn about hill cipher in java with program and algorithm. To start with the program directly is not a good idea here. Until you don’t have a brief understanding of Hill cipher algorithm, their programs will merely a code to copy paste. As per Wikipedia, Hill cipher is a polygraphic substitution cipher based on linear algebra, invented by Lester S. Hill in 1929. Basically Hill cipher is a cryptography algorithm to encrypt and decrypt data to ensure data security. Also Read: Caesar Cipher in

Neeraj Mishra Algorithm 9 comments

Java Program for Shortest Job First (SJF) Scheduling [Preemptive & Non-Preemptive]

Here you will get java program for shortest job first (sjf) scheduling algorithm, both preemptive and non-preemptive. Shortest job first scheduling algorithm can also be known as shortest job next scheduling. It is very easy to implement and efficient in reducing average response time. Now we will see how it will work with the example and its implementation. In shortest job first, we should know the execution time of each process before running. This we can estimate in many ways.

Neeraj Mishra Algorithm 4 comments

Java Program for First Come First Serve (FCFS) Scheduling Algorithm

In this article we are going to learn about first come first serve (fcfs) scheduling in Java with program example. FCFS strategy will be helpful in many situations especially in tie breaking situations. Here we will see FCFS strategy with scheduling problem. First Come First Serve (FCFS) Scheduling First come First serve means whatever the job came first we should process that job first regardless other properties. This situation we can map with our real time scenario. When we are

Neeraj Mishra Array 3 comments

Java Program to Find Inverse of a Matrix

Here you will get java program to find inverse of a matrix of order 2×2 and 3×3. We can find inverse of a matrix in following way. First find the determinant of matrix. Calculate adjoint of matrix. Finally divide adjoint of matrix by determinant. Image Source Below I have shared program to find inverse of 2×2 and 3×3 matrix. Java Program to Find Inverse of a Matrix 2×2 Matrix

import java.util.Scanner;

public class JavaMatrixInverse {
	public static void main(String args[]) {
		int i, j;
		float det, temp;
		float mat[][] = new float[2][2];
		
		Scanner sc = new Scanner(System.in);
		
		System.out.println("Enter elements of matrix row wise:");
		for(i = 0; i < 2; ++i)
			for(j = 0; j < 2; ++j)
				mat[i][j] = sc.nextFloat();
		
		det = (mat[0][0] * mat[1][1]) - (mat[0][1] * mat[1][0]);
		
		System.out.println("\ndeterminant = " + det);
		
		temp = mat[0][0];
		mat[0][0] = mat[1][1];
		mat[1][1] = temp;
		
		mat[0][1] = - mat[0][1];
		mat[1][0] = - mat[1][0];
		
		System.out.println("\nInverse of matrix is:");
		for(i = 0; i < 2; ++i) {
			for(j = 0; j < 2; ++j)
				System.out.print((mat[i][j]/det) + " ");
			
			System.out.print("\n");
		}
	}
}

import java.util.Scanner;

public class JavaMatrixInverse {

public static void main(String args[]) {

int i, j;

float det, temp;

float mat[][] = new float[2][2];

Scanner sc = new Scanner(System.in);

System.out.println("Enter elements of matrix row wise:");

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

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

mat[i][j] = sc.nextFloat();

det = (mat[0][0] * mat[1][1]) - (mat[0][1] * mat[1][0]);

System.out.println("\ndeterminant = " + det);

temp = mat[0][0];

mat[0][0] = mat[1][1];

mat[1][1] = temp;

mat[0][1] = - mat[0][1];

mat[1][0] = - mat[1][0];

System.out.println("\nInverse of matrix is:");

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

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

System.out.print((mat[i][j]/det) + " ");

System.out.print("\n");

}

Output Enter elements of matrix row wise: 4 7 2