Java Practical1 based on Basic assignment

Java Practical1 based on Basic assignment

• 1.
  Program 1. HelloWorld public class HelloWorld { public static void main(String[] args) { System.out.println("Hello, World!"); } } 1. Hello User import java.util.Scanner; public class HelloUser { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("Enter your name: "); String name = sc.nextLine(); System.out.println("Hello, " + name + "!"); } } Output Example: Enter your name: John Hello, John! 2. Sum of Two Numbers import java.util.Scanner; public class Sum { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("Enter first number: "); int a = sc.nextInt(); System.out.print("Enter second number: "); int b = sc.nextInt(); int sum = a + b; System.out.println("Sum: " + sum); } } Output Example: Enter first number: 5 Enter second number: 10 Sum: 15 3. Check Even or Odd import java.util.Scanner; public class EvenOdd { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("Enter a number: "); int number = sc.nextInt();
• 2.
  if (number %2 == 0) { System.out.println(number + " is even."); } else { System.out.println(number + " is odd."); } } } Output Example: Enter a number: 7 7 is odd. 4. Factorial of a Number import java.util.Scanner; public class Factorial { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("Enter a number: "); int number = sc.nextInt(); int factorial = 1; for (int i = 1; i <= number; i++) { factorial *= i; } System.out.println("Factorial: " + factorial); } } Output Example: Enter a number: 5 Factorial: 120 5. Fibonacci Series import java.util.Scanner; public class Fibonacci { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("Enter the number of terms: "); int n = sc.nextInt(); int a = 0, b = 1; System.out.print("Fibonacci Series: " + a + ", " + b); for (int i = 2; i < n; i++) { int next = a + b; System.out.print(", " + next); a = b; b = next; } } } Output Example: Enter the number of terms: 10 Fibonacci Series: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34
• 3.
  6. Prime NumberCheck import java.util.Scanner; public class PrimeCheck { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("Enter a number: "); int number = sc.nextInt(); boolean isPrime = true; for (int i = 2; i <= number / 2; i++) { if (number % i == 0) { isPrime = false; break; } } if (isPrime) { System.out.println(number + " is a prime number."); } else { System.out.println(number + " is not a prime number."); } } } Output Example: Enter a number: 29 29 is a prime number.
• 4.
  7. Simple Calculator importjava.util.Scanner; public class Calculator { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("Enter first number: "); double num1 = sc.nextDouble(); System.out.print("Enter second number: "); double num2 = sc.nextDouble(); System.out.print("Enter an operator (+, -, *, /): "); char operator = sc.next().charAt(0); double result; switch (operator) { case '+': result = num1 + num2; System.out.println("Addition is: " +result); break; case '-': result = num1 - num2; System.out.println("Subtraction is: " +result); break; case '*': result = num1 * num2; System.out.println("Multiplication is: " +result); break; case '/': result = num1 / num2; System.out.println("Devision is: " +result); break; default: System.out.println("Invalid operator!"); return; } // System.out.println("Result: " + result); } } Output Example: Enter first number: 10 Enter second number: 5 Enter an operator (+, -, *, /): + Result: 15.0 8. Armstrong Number Check Program import java.util.Scanner; public class ArmstrongNumber { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("Enter a number: "); int number = sc.nextInt(); int originalNumber = number; int result = 0; int n = 0; // Count the number of digits while (originalNumber != 0) {
• 5.
  originalNumber /= 10; ++n; } originalNumber= number; // Calculate the sum of the nth power of its digits while (originalNumber != 0) { int digit = originalNumber % 10; result += Math.pow(digit, n); originalNumber /= 10; } if (result == number) { System.out.println(number + " is an Armstrong number."); } else { System.out.println(number + " is not an Armstrong number."); } } } 9. Pyramid Star Pattern public class PyramidPattern { public static void main(String args[]) { //i for rows and j for columns //row denotes the number of rows you want to print int i, j, row = 6; //Outer loop work for rows for (i=0; i<row; i++) { //inner loop work for space for (j=row-i; j>1; j--) { //prints space between two stars System.out.print(" "); } //inner loop for columns for (j=0; j<=i; j++ ) { //prints star
• 6.
  System.out.print("* "); } //throws thecursor in a new line after printing each line System.out.println(); } } } 10. Number Pattern public class Pattern2 { public static void main(String[] args) { int i, j, k = 1; //inner loop for (i = 1; i <= 7; i++) { //outer loop for (j = 1; j< i + 1; j++) { //prints the value of k System.out.print(k++ + " "); } //throws the cursor at the next line System.out.println(); } } }