Write a program in JAVA to find GCD of two number
Write a program in JAVA to find gcd of two number
import java.util.Scanner;
class GCD {
public static void main(String[] args) {
Scanner sc= new Scanner(System.in);
System.out.print("Enter First Number : ");
int num1=sc.nextInt();
System.out.print("Enter Second Number : ");
int num2=sc.nextInt();
sc.close();
while (num1!=num2) {
if (num1>num2) {
num1=num1-num2;
} else {
num2=num2-num1;
}
}
System.out.print("GCD = "+num1);
}
}
OUTPUT
Enter First Number : 24
Enter Second Number : 78
GCD : 6
Write a program in Java to find and print all the roots of quadratic equation
Aman KumarNovember 27, 2021java program, quadratic equation, roots of quadratic equation
No comments
Write a program in JAVA to find and print all the roots of quadratic equation
import java.util.Scanner;
public class QuadEq {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double a, b, c, val1, val2;
System.out.print("Enter The value of a in ax^2+bx+c : ");
a = sc.nextDouble();
System.out.print("Enter The value of b in ax^2+bx+c : ");
b = sc.nextDouble();
System.out.print("Enter The value of c in ax^2+bx+c : ");
c = sc.nextDouble();
sc.close();
double dis = Math.pow(b, 2) - 4 * a * c;
if (dis == 0) {
val1 = (-b) / (2 * a);
System.out.print("Roots are Real & Equal. X1 = x2 = : " + val1);
} else if (dis > 0) {
val1 = (-b + Math.sqrt(dis)) / (2 * a);
val2 = (-b - Math.sqrt(dis)) / (2 * a);
System.out.print("Roots are Real & Different. X1 = : " + val1 + " & X2 = " + val2);
} else {
val1 = -b / (2 * a);
val2 = (Math.sqrt(-dis)) / (2 * a);
System.out.println("Roots are Complex & Different.");
System.out.println("X1 = " + val1 + " + " + val2 + "i" + "\nX2 = " + val1 + " - " + val2 + "i");
}
}
}
OUTPUT
Enter The value of a in ax^2+bx+c : 1
Enter The value of b in ax^2+bx+c : -4
Enter The value of c in ax^2+bx+c : 6.25
Roots are Complex & Different.
X1 = 2.0 + 1.5i
X2 = 2.0 - 1.5i
Write a program in java to reverse the digit of given number
Write a program in JAVA to Reverse the digit of given number
import java.io.*;
public class RevNum {
public static void main(String[] args)throws IOException {
BufferedReader obj = new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter Number");
int num = Integer.parseInt(obj.readLine());
int rem,rnum=0;
while (num!=0) {
rem=num%10;
rnum=rnum*10+rem;
num=num/10;
}
System.out.println("Reversed number is :"+rnum);
}
}
OUTPUT
Enter Number
12345
Reversed number is :54321
Write a program in Java to input and print 3x3 Matrix
Write a program in JAVA to input and print 3X3 Matrix
import java.io.*;
public class Matrix {
public static void main(String[] args) throws IOException {
BufferedReader obj = new BufferedReader(new InputStreamReader(System.in));
System.out.print("Enter elements of 3X3 matrix : ");
int arr[][] = new int[3][3];
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr.length; j++) {
arr[i][j] = Integer.parseInt(obj.readLine());
}
}
System.out.println("Entered 3x3 Matrix is : ");
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr.length; j++) {
System.out.print(arr[i][j] + " ");
}
System.out.println();
}
}
}
OUTPUT
Enter elements of 3X3 matrix : 12
34
56
23
45
67
11
32
87
Entered 3x3 Matrix is :
12 34 56
23 45 67
11 32 87
Write a program in java to print sum of two 3X3 matrix
Aman KumarNovember 27, 2021addition of 3x3 matrix, addition of matrix, java program, matrix
No comments
Write a program in JAVA to print sum of two 3X3 MATRIX
import java.io.*;
class SumMatrix3D {
public static void main(String[] args)throws IOException {
BufferedReader obj=new BufferedReader(new InputStreamReader(System.in));
System.out.print("Enter elements of first 3X3 matrix : ");
int arr1[][]=new int[3][3];
for (int i = 0; i < arr1.length; i++) {
for (int j = 0; j < arr1.length; j++) {
arr1[i][j]=Integer.parseInt(obj.readLine());
}
}
System.out.print("Enter elements of second 3X3 matrix : ");
int arr2[][]=new int[3][3];
for (int i = 0; i < arr1.length; i++) {
for (int j = 0; j < arr1.length; j++) {
arr2[i][j]=Integer.parseInt(obj.readLine());
}
}
int sum[][]=new int[3][3];
for (int i = 0; i < arr1.length; i++) {
for (int j = 0; j < arr1.length; j++) {
sum[i][j]=arr1[i][j]+arr2[i][j];
}
}
System.out.println("Sum Of both Matrix : ");
for (int i = 0; i < arr1.length; i++) {
for (int j = 0; j < arr1.length; j++) {
System.out.print(sum[i][j]+" ");
}
System.out.println();
}
}
}
OUTPUT
Enter elements of first 3X3 matrix : 1
2
3
4
5
6
7
8
9
Enter elements of second 3X3 matrix : 9
2
3
4
5
1
6
7
8
Sum Of both Matrix :
10 4 6
8 10 7
13 15 17
Write a program in JAVA to input a number and check if it is armstrong or not
Write a program in JAVA to input a number and check if it is armstrong or not
Armstrong Number : Armstrong number is a number that is equal to the sum of cubes of its digits. For example 0, 1, 153, 370, 371 and 407 are the Armstrong numbers
import java.io.*;
public class Armstrong {
public static void main(String[] args)throws IOException {
BufferedReader obj = new BufferedReader(new InputStreamReader(System.in));
System.out.print("Enter a Positive Number : ");
int num=Integer.parseInt(obj.readLine());
int ldigit,cube=0;
int temp=num;
while (temp!=0) {
ldigit=temp%10;
cube+=ldigit*ldigit*ldigit;
temp=temp/10;
}
if (cube == num) {
System.out.println(num+" Is Armstrong Number");
} else {
System.out.println(num+" Is Not an Armstrong Number");
}
}
}
OUTPUT
1.
Enter A Number : 371
371 is armstrong number
2.
Enter A Number : 476
476 is not a armstrong number
Write a Java program to input a number and check if it is prime or not
Write a program in Java to input a number and check if it is prime or not
Prime Number : A number that is divisible only by itself and 1 (e.g. 2, 3, 5, 7, 11).
import java.util.Scanner;
public class Prime {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("Enter A Positive Number : ");
int num=sc.nextInt();
sc.close();
boolean isPrime=true;
if (num==1) {
System.out.print(" 1 Is Unitary");
} else if(num==2) {
System.out.print(" 2 Is Prime Number");
}else {
for (int i = 2; i < num/2; i++) {
if (num%i==0) {
isPrime=false;
break;
}
}
if (isPrime) {
System.out.print(num +" Is Prime Number");
} else {
System.out.print(num +" Is Not Prime Number");
}
}
}
}
OUTPUT
1.
Enter A Positive Number : 45
45 Is Not Prime Number
2.
Enter A Positive Number : 47
47 Is Prime Number
Program 2
Write a Java program to input a number and check if it is palindrome or not
Write a program in Java to input a number and check if it is palindrome or not
Palindrome : A palindrome is a word, number, phrase, or other sequence of characters which reads the same backward as forward, such as madam or racecar.
import java.util.Scanner;
public class Palin {
public static void main(String[] args) {
Scanner sc =new Scanner(System.in);
System.out.print("Enter A Number : ");
int num =sc.nextInt();
int rev=0,ldigit;
int temp=num;
while (temp!=0) {
ldigit=temp%10;
rev=rev*10+ldigit;
temp=temp/10;
}
if (num==rev) {
System.out.println(num +" is Palindrome");
} else {
System.out.println(num +" is not Palindrome");
}
}
}
OUTPUT
1.
Enter a Number : 123454321
123454321 is Palindrome
2.
Enter a Number : 345232
345232 is not Palindrome
Write a program in c++ to check if entered 3x3 matrix is a diagonal matrix
Write a program in c++ to check if entered 3x3 matrix is a diagonal matrix
#include <iostream>
using namespace std;
int main()
{
int a[3][3], flag = 0;
//Loop to enter elements of matrix
cout << "Enter Elements of Array : ";
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
cin >> a[i][j];
}
}
// Loop to print matrix
cout<<"Entered Matrix : ";
for (int i = 0; i < 3; i++)
{
cout << endl;
for (int j = 0; j < 3; j++)
{
cout << a[i][j] << " ";
}
}
//Loop to check for diagonal matix
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
if (i == j && a[i][j] == 0)
{
flag = 1;
break;
}
else if (i != j && a[i][j] != 0)
{
flag = 1;
break;
}
}
}
if (flag == 1)
{
cout << "\n This is not a Diagonal Matrix ";
}
else
cout << "\n This is Diagonal Matrix ";
return 0;
}
OUTPUT
Enter Elements of Array : 12
34
23
56
45
11
67
76
54
Entered Matrix :
12 34 23
56 45 11
67 76 54
This is not a Diagonal Matrix
Write a program in c++ to input and print 3X3 Matrix
Write a program in c++ to input and print 3X3 Matrix
#include <iostream>
using namespace std;
int main()
{
int a[3][3];
cout << "Enter Elements of Array : ";
//Loo-p to Enter Elements
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
cin >> a[i][j];
}
}
// Loop to print Matrix
cout<<"3x3 Matrix :"<<endl;
for (int i = 0; i < 3; i++)
{
cout << endl;
for (int j = 0; j < 3; j++)
{
cout << a[i][j] << " ";
}
}
return 0;
}
OUTPUT
Enter Elements of Array : 12
34
56
23
45
67
11
32
87
3x3 Matrix :
12 34 56
23 45 67
11 32 87
Write a program in c++ to input 5 number and find the largest
Write a program in c++ to input 5 number and find the largest
#include <iostream>
using namespace std;
int main()
{
int i;
float a[5], sum = 0;
cout << "Enter 5 Number : " << endl;
for (i = 0; i < 5; i++)
{
cout << i+1 << ". ";
cin >> a[i];
}
for (i = 0; i < 5; i++)
{
if (a[0]<a[i])
a[0]=a[i] ;
}
cout << "\n largest number = " <<a[0];
return 0;
}
OUTPUT
Enter 10 Number :
1. 23
2. 56
3. 102
4. 78.4
5. 34.67
largest number = 102
Write a program in c++ to input 5 number and find the sum
Write a program in c++ to input 5 number and find the sum
#include <iostream>
using namespace std;
int main()
{ float a[5], sum = 0;
int i;
cout << "Enter 5 Number : " << endl;
for (i = 0; i < 5; i++)
{
cout << i+1 << ". ";
cin >> a[i];
sum+=a[i];
}
cout << "\n sum = " << sum;
return 0;
}
OUTPUT
Enter 5 Number :
1. 23
2. 56
3. 102
4. 78.4
5. 34.67
sum = 294.07
Write a program in c++ to input a number and check if it is prime or not
Write a program in c++ to input a number and check if it is prime or not
Prime Number : A number that is divisible only by itself and 1 (e.g. 2, 3, 5, 7, 11).
#include <iostream>
using namespace std;
int main()
{
int num, prime = 0;
cout << "\t PROGRAM TO CHECK PRIME NUMBER";
cout << "\n Enter A Number : ";
cin >> num;
if (num < 1)
cout << "\n Number should be greater than 0";
else if (num == 1)
cout << "\n 1 is neither Prime nor Composite, It is a Neutral Number";
else
{
for (int i = 2; i <= num / 2; ++i)
{
if (num % i == 0)
{
prime = 1;
cout << " It is not a Prime Number";
break;
}
}
if (prime == 0)
cout << " It is a Prime Number";
return 0;
}
}
OUTPUT
1.
PROGRAM TO CHECK PRIME NUMBER
Enter A Number : 45
It is not a Prime Number
2.
PROGRAM TO CHECK PRIME NUMBER
Enter A Number : 47
It is a Prime Number
Write a program in c++ to input a number and print reverse of this number
Write a program in c++ to input a number and PRINT REVERSE OF THIS NUMBER
#include <iostream>
using namespace std;
int main()
{
int num, rev, ldigit;
cout << "Enter a Number : ";
cin >> num;
while (num != 0)
{
ldigit = num % 10;
rev = rev * 10 + ldigit;
num /= 10;
}
cout << "Reversed number is :" << rev;
}
OUTPUT
1.
Enter a Number : 23465
Reversed number is :56432
2.
Enter a Number : 78654
Reversed number is :45687