Oop Java Code
Oop Java Code
Code:-
import java.util.Scanner;
if (number > 0) {
} else {
}
scanner.close();
import java.util.Scanner;
int sum = 0;
sum += i;
System.out.println("The sum of natural numbers up to " + limit + " is: " + sum);
scanner.close();
3)
import java.util.Scanner;
int factorial = 1;
factorial *= i;
scanner.close();
4)
import java.util.Scanner;
scanner.close();
5)
import java.util.Scanner;
int a = 0, b = 1;
System.out.println("Fibonacci Series:");
int next = a + b;
a = b;
b = next;
scanner.close();
6)
import java.util.Scanner;
int gcd = 1;
gcd = i;
System.out.println("GCD of " + num1 + " and " + num2 + " is: " + gcd);
scanner.close();
7)
import java.util.Scanner;
System.out.println("LCM of " + num1 + " and " + num2 + " is: " + lcm);
scanner.close();
while (num2 != 0) {
num1 = temp;
return num1;
8)
import java.util.Scanner;
int reversedNumber = 0;
while (number != 0) {
number /= 10;
scanner.close();
9)
import java.util.Scanner;
int reversedNumber = 0;
while (number != 0) {
number /= 10;
if (originalNumber == reversedNumber) {
System.out.println("Palindrome");
} else {
System.out.println("Not Palindrome");
scanner.close();
10)
import java.util.Scanner;
if (number <= 1) {
isPrime = false;
} else {
if (number % i == 0) {
isPrime = false;
break;
if (isPrime) {
System.out.println("Prime");
} else {
System.out.println("Not Prime");
scanner.close();
11)
import java.util.Scanner;
scanner.close();