Java Programming

ASSIGNMENT -1
NAME : B.H.M.S.DIVYA
ROLL NO : 22124024
1. Write a program to print ―Hello World on the screen.
public class Main
{
public static void main(String[] args) {
System.out.println("Hello World");
}
}
OUTPUT:

2. Write a program to print addition, subtraction,

multiplication and division where input should be taken
from command line.
public class MathOperations {
public static void main(String[] args) {
if (args.length != 2) {
System.out.println("Please provide two numbers as command-line
arguments.");
return;
 }
double num1 = Double.parseDouble(args[0]);
double num2 = Double.parseDouble(args[1]);
double sum = num1 + num2;
double difference = num1 - num2;
double product = num1 * num2;

double quotient = (num2 != 0) ? (num1 / num2) :

Double.POSITIVE_INFINITY;
System.out.println("Addition: " + sum);
System.out.println("Subtraction: " + difference);
System.out.println("Multiplication: " + product);
System.out.println("Division: " + quotient);
}
}

Output:

3.Write a java program to check whether a number is prime

or not.
public class PrimeChecker {
 public static void main(String[] args) {

if (args.length != 1) {
System.out.println("Please provide a single number as a command-line
argument.");
return;
}
int number = Integer.parseInt(args[0]);
if (isPrime(number)) {
System.out.println(number + " is a prime number.");
} else {
System.out.println(number + " is not a prime number.");
}
}
private static boolean isPrime(int num) {
if (num < 2) {
return false;
}
for (int i = 2; i <= Math.sqrt(num); i++) {
if (num % i == 0) {
return false;
}
}
return true;
}
};
output:

4. Write a java program to display Fibonacci series up to n.

import java.util.Scanner;
public class FibonacciSeries {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the value of n: ");
int n = scanner.nextInt();
System.out.println("Fibonacci series up to " + n + ":");
for (int i = 0; i < n; i++) {
System.out.print(fibonacci(i) + " ");
}

scanner.close();
}

public static int fibonacci(int n) {

if (n <= 1) {
return n;
} else {
return fibonacci(n - 1) + fibonacci(n - 2);
 }
}
}

Output:

5. Write a java program to display the following pattern.

public class swastik {
public static void main(String args[])
{
int i,j;
for(i=1;i<=11;i++)
{
for(j=1;j<=11;j++)
{
if(i==1 && (j==1 || j>=6))
System.out.print("* ");
else if((i>=2 && i<=5) && (j==6|| j==1))
System.out.print("* ");
else if(i==6)
System.out.print("* ");
else if((i>=7 ) && (j==6|| j==11))
System.out.print("* ");
 else if(i==11 && (j==11 || (j>=1 && j<=6)))
System.out.print("* ");
else
System.out.print(" ");
}
System.out.println();
}
}
}

Output:

6. Write a java program to check whether a number is

palindrome or not.
import java.util.Scanner;
public class PalindromeCheck {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int number = scanner.nextInt();
 if (isPalindrome(number)) {
System.out.println(number + " is a palindrome.");
} else {
System.out.println(number + " is not a palindrome.");
}
scanner.close();
}
public static boolean isPalindrome(int number) {
int originalNumber = number;
int reversedNumber = 0;
while (number > 0) {
int digit = number % 10;
reversedNumber = reversedNumber * 10 + digit;
number /= 10;
}
return originalNumber == reversedNumber;
}
}

Output:
7. Write a java program to find GCD of two numbers.
import java.util.Scanner;
public class GCDFinder {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the first number: ");
int num1 = scanner.nextInt();
System.out.print("Enter the second number: ");
int num2 = scanner.nextInt();
int gcd = findGCD(num1, num2);
System.out.println("GCD of " + num1 + " and " + num2 + " is: " + gcd);
scanner.close();
}
public static int findGCD(int a, int b) {
while (b != 0) {
int temp = b;
b = a % b;
a = temp;
}
 return a;
}
}

Output:

8. Write a java program to search a number from an array

using linear search.
import java.util.Scanner;
public class LinearSearch {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int[] array = {1, 5, 8, 12, 4, 7, 15, 9, 6};
System.out.print("Enter the number to search: ");
int target = scanner.nextInt();
int index = linearSearch(array, target);
if (index != -1) {
System.out.println("Number " + target + " found at index " + index);
} else {
System.out.println("Number " + target + " not found in the array");
 }
scanner.close();
}
private static int linearSearch(int[] arr, int target) {
for (int i = 0; i < arr.length; i++) {
if (arr[i] == target) {
return i;
}
}
return -1;
}
}

Output:

9. Write a java program to display prime numbers between

two intervals.
import java.util.Scanner;
public class PrimeNumberDisplay {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);

System.out.print("Enter the lower limit: ");

 int lowerLimit = scanner.nextInt();

System.out.print("Enter the upper limit: ");

int upperLimit = scanner.nextInt();

System.out.println("Prime numbers between " + lowerLimit + " and " +

upperLimit + ":");

for (int i = lowerLimit; i <= upperLimit; i++) {

if (isPrime(i)) {
System.out.print(i + " ");
}
}

scanner.close();
}

public static boolean isPrime(int number) {

if (number <= 1) {
return false;
}

for (int i = 2; i <= Math.sqrt(number); i++) {

if (number % i == 0) {
return false;
}
}
 return true;
}
}

Output:

10. Write a java program to check whether a number can be

expressed as sum of two prime numbers.
import java.util.Scanner;

public class SumOfTwoPrimes {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);

System.out.print("Enter a number: ");

int number = scanner.nextInt();

if (checkSumOfTwoPrimes(number)) {
System.out.println(number + " can be expressed as the sum of two
prime numbers.");
} else {
 System.out.println(number + " cannot be expressed as the sum of two
prime numbers.");
}

scanner.close();
}

private static boolean isPrime(int num) {

if (num <= 1) {
return false;
}
for (int i = 2; i <= Math.sqrt(num); i++) {
if (num % i == 0) {
return false;
}
}
return true;
}

private static boolean checkSumOfTwoPrimes(int num) {

for (int i = 2; i <= num / 2; i++) {
if (isPrime(i) && isPrime(num - i)) {
return true;
}
}
return false;
}
}

Output:

11. Write a java program to display prime numbers between

intervals using method.
import java.util.Scanner;

public class PrimeNumbersInInterval {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);

System.out.print("Enter the starting number of the interval: ");

int start = scanner.nextInt();

System.out.print("Enter the ending number of the interval: ");

int end = scanner.nextInt();

System.out.println("Prime numbers between " + start + " and " + end +

":");
displayPrimeNumbersInInterval(start, end);
 scanner.close();
}

private static void displayPrimeNumbersInInterval(int start, int end) {

for (int num = start; num <= end; num++) {
if (isPrime(num)) {
System.out.print(num + " ");
}
}
System.out.println();
}

private static boolean isPrime(int number) {

if (number <= 1) {
return false;
}
for (int i = 2; i <= Math.sqrt(number); i++) {
if (number % i == 0) {
return false;
}
}
return true;
}
}

Output:
12. Write a java program to check whether a number is
Armstrong number or not.
import java.util.Scanner;

public class ArmstrongNumber {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);

System.out.print("Enter a number: ");

int number = scanner.nextInt();

if (isArmstrongNumber(number)) {
System.out.println(number + " is an Armstrong number.");
} else {
System.out.println(number + " is not an Armstrong number.");
}

scanner.close();
}
 private static boolean isArmstrongNumber(int num) {
int originalNum = num;
int n = countDigits(num);
int sum = 0;

while (num > 0) {

int digit = num % 10;
sum += Math.pow(digit, n);
num /= 10;
}

return sum == originalNum;

}

private static int countDigits(int num) {

int count = 0;
while (num != 0) {
num /= 10;
count++;
}
return count;
}
}

Output:
13. Write a java program to display factors of a number.
import java.util.Scanner;
public class FactorsOfNumber {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int number = scanner.nextInt();
System.out.println("Factors of " + number + " are:");
displayFactors(number);
scanner.close();
}
private static void displayFactors(int num) {
for (int i = 1; i <= num; i++) {
if (num % i == 0) {
System.out.print(i + " ");
}
}
System.out.println();
}
}
Output:

14. Write a java program to count number of digits in an

integer.
import java.util.Scanner;

public class CountDigits {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);

System.out.print("Enter an integer: ");

int number = scanner.nextInt();

int digitCount = countDigits(number);

System.out.println("Number of digits in " + number + " is: " + digitCount);

scanner.close();
}

private static int countDigits(int num) {

 if (num == 0) {
return 1;
}

int count = 0;
while (num != 0) {
num /= 10;
count++;
}
return count;
}
}

Output:

15. Write a java program to check whether a number is even

or odd.
import java.util.Scanner;

public class EvenOddChecker {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
 System.out.print("Enter a number: ");
int number = scanner.nextInt();

if (isEven(number)) {
System.out.println(number + " is an even number.");
} else {
System.out.println(number + " is an odd number.");
}

scanner.close();
}

private static boolean isEven(int num) {

return num % 2 == 0;
}
}

Output: