Java Program Class 9th
Java Program Class 9th
1. Natural numbers up to n
import [Link].*;
class NaturalNumbers {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int sum = 0;
for(int i = 1; i <= n; i++)
sum += i;
[Link](sum);
}
}
3. Even numbers up to n
import [Link].*;
class EvenNumbers {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
for(int i = 2; i <= n; i += 2)
[Link](i);
}
}
4. Odd numbers up to n
import [Link].*;
class OddNumbers {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
for(int i = 1; i <= n; i += 2)
[Link](i);
}
}
int es = 0, os = 0;
for(int i = 1; i <= n; i++) {
if(i % 2 == 0)
es += i;
else
os += i;
}
6. Divisors of a number
import [Link].*;
class Divisors {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
7. Sum of divisors
import [Link].*;
class SumDivisors {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int sum = 0;
for(int i = 1; i <= n; i++)
if(n % i == 0)
sum += i;
[Link](sum);
}
}
8. Area of circle
import [Link].*;
class AreaCircle {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
double r = [Link]([Link]());
9. Area of square
import [Link].*;
class AreaSquare {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int s = [Link]([Link]());
[Link](s * s);
}
}
[Link](l * b);
}
}
11. Factorial of 10
class Factorial {
public static void main(String args[]) {
int fact = 1;
for(int i = 1; i <= 10; i++)
fact *= i;
[Link](fact);
}
}
12. Reverse a number (FOR loop)
import [Link].*;
class Reverse {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int rev = 0;
for(; n > 0; n /= 10)
rev = rev * 10 + (n % 10);
[Link](rev);
}
}
int sum = 0;
for(; n > 0; n /= 10)
sum += n % 10;
[Link](sum);
}
}
if(temp == rev)
[Link]("Palindrome");
else
[Link]("Not Palindrome");
}
}
if(sum == temp)
[Link]("Armstrong");
else
[Link]("Not Armstrong");
}
}
int count = 0;
for(int i = 1; i <= n; i++)
if(n % i == 0)
count++;
if(count == 2)
[Link]("Prime");
else
[Link]("Not Prime");
}
}
Semester -1 programs by
1. Natural numbers up to n
import [Link].*;
class NaturalNumbers {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int sum = 0;
for(int i = 1; i <= n; i++)
sum += i;
[Link](sum);
}
}
3. Even numbers up to n
import [Link].*;
class EvenNumbers {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
for(int i = 2; i <= n; i += 2)
[Link](i);
}
}
4. Odd numbers up to n
import [Link].*;
class OddNumbers {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
for(int i = 1; i <= n; i += 2)
[Link](i);
}
}
int es = 0, os = 0;
for(int i = 1; i <= n; i++) {
if(i % 2 == 0)
es += i;
else
os += i;
}
6. Divisors of a number
import [Link].*;
class Divisors {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
7. Sum of divisors
import [Link].*;
class SumDivisors {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int sum = 0;
for(int i = 1; i <= n; i++)
if(n % i == 0)
sum += i;
[Link](sum);
}
}
8. Area of circle
import [Link].*;
class AreaCircle {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
double r = [Link]([Link]());
[Link](s * s);
}
}
[Link](l * b);
}
}
11. Factorial of 10
class Factorial {
public static void main(String args[]) {
int fact = 1;
for(int i = 1; i <= 10; i++)
fact *= i;
[Link](fact);
}
}
int rev = 0;
for(; n > 0; n /= 10)
rev = rev * 10 + (n % 10);
[Link](rev);
}
}
13. Sum of digits (FOR loop)
import [Link].*;
class SumDigits {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int sum = 0;
for(; n > 0; n /= 10)
sum += n % 10;
[Link](sum);
}
}
if(temp == rev)
[Link]("Palindrome");
else
[Link]("Not Palindrome");
}
}
if(sum == temp)
[Link]("Armstrong");
else
[Link]("Not Armstrong");
}
}
16. Prime number
import [Link].*;
class Prime {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int count = 0;
for(int i = 1; i <= n; i++)
if(n % i == 0)
count++;
if(count == 2)
[Link]("Prime");
else
[Link]("Not Prime");
}
}
int i = 1;
do {
[Link](i);
i++;
} while(i <= n);
}
}
int i = 1, sum = 0;
do {
sum += i;
i++;
} while(i <= n);
[Link](sum);
}
}
3. Even numbers up to n
import [Link].*;
class EvenNumbers {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int i = 2;
do {
[Link](i);
i += 2;
} while(i <= n);
}
}
4. Odd numbers up to n
import [Link].*;
class OddNumbers {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int i = 1;
do {
[Link](i);
i += 2;
} while(i <= n);
}
}
int i = 1, es = 0, os = 0;
do {
if(i % 2 == 0)
es += i;
else
os += i;
i++;
} while(i <= n);
int i = 1;
do {
if(n % i == 0)
[Link](i);
i++;
} while(i <= n);
}
}
7. Sum of divisors
import [Link].*;
class SumDivisors {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int i = 1, sum = 0;
do {
if(n % i == 0)
sum += i;
i++;
} while(i <= n);
[Link](sum);
}
}
8. Area of circle
import [Link].*;
class AreaCircle {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
double r = [Link]([Link]());
9. Area of square
import [Link].*;
class AreaSquare {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int s = [Link]([Link]());
[Link](s * s);
}
}
[Link](l * b);
}
}
11. Factorial of 10
class Factorial {
public static void main(String args[]) {
int i = 1, fact = 1;
do {
fact *= i;
i++;
} while(i <= 10);
[Link](fact);
}
}
int rev = 0;
do {
rev = rev * 10 + (n % 10);
n /= 10;
} while(n > 0);
[Link](rev);
}
}
13. Sum of digits
import [Link].*;
class SumDigits {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int sum = 0;
do {
sum += n % 10;
n /= 10;
} while(n > 0);
[Link](sum);
}
}
if(temp == rev)
[Link]("Palindrome");
else
[Link]("Not Palindrome");
}
}
if(sum == temp)
[Link]("Armstrong");
else
[Link]("Not Armstrong");
}
}
int i = 1, count = 0;
do {
if(n % i == 0)
count++;
i++;
} while(i <= n);
if(count == 2)
[Link]("Prime");
else
[Link]("Not Prime");
}
}
int i = 1;
while(i <= n) {
[Link](i);
i++;
}
}
}
3. Even numbers up to n
import [Link].*;
class EvenNumbers {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int i = 2;
while(i <= n) {
[Link](i);
i += 2;
}
}
}
4. Odd numbers up to n
import [Link].*;
class OddNumbers {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int i = 1;
while(i <= n) {
[Link](i);
i += 2;
}
}
}
int i = 1, es = 0, os = 0;
while(i <= n) {
if(i % 2 == 0)
es += i;
else
os += i;
i++;
}
6. Divisors of a number
import [Link].*;
class Divisors {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int i = 1;
while(i <= n) {
if(n % i == 0)
[Link](i);
i++;
}
}
}
7. Sum of divisors
import [Link].*;
class SumDivisors {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int i = 1, sum = 0;
while(i <= n) {
if(n % i == 0)
sum += i;
i++;
}
[Link](sum);
}
}
8. Area of circle
import [Link].*;
class AreaCircle {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
double r = [Link]([Link]());
9. Area of square
import [Link].*;
class AreaSquare {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int s = [Link]([Link]());
[Link](s * s);
}
}
[Link](l * b);
}
}
11. Factorial of 10
class Factorial {
public static void main(String args[]) {
int i = 1, fact = 1;
while(i <= 10) {
fact *= i;
i++;
}
[Link](fact);
}
}
int rev = 0;
while(n > 0) {
rev = rev * 10 + (n % 10);
n /= 10;
}
[Link](rev);
}
}
int sum = 0;
while(n > 0) {
sum += n % 10;
n /= 10;
}
[Link](sum);
}
}
if(temp == rev)
[Link]("Palindrome");
else
[Link]("Not Palindrome");
}
}
if(sum == temp)
[Link]("Armstrong");
else
[Link]("Not Armstrong");
}
}
int i = 1, count = 0;
while(i <= n) {
if(n % i == 0)
count++;
i++;
}
if(count == 2)
[Link]("Prime");
else
[Link]("Not Prime");
}
}
int temp = a;
a = b;
b = temp;
while(i <= 5) {
sum += [Link]([Link]());
i++;
}
3. Even or Odd
import [Link].*;
class EvenOdd {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
if(n % 2 == 0)
[Link]("Even");
else
[Link]("Odd");
}
}
4. Greater of ab and ba
import [Link].*;
class Compare {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int a = [Link]([Link]());
int b = [Link]([Link]());
int ab = a * b;
int ba = b * a;
5. Divisors of a number
import [Link].*;
class Divisors {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int i = 1;
while(i <= n) {
if(n % i == 0)
[Link](i);
i++;
}
}
}
8. Series 4n + 1 (5 terms)
import [Link].*;
class Series2 {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int i = 1;
while(i <= 5) {
[Link](4 * n + 1);
n++;
i++;
}
}
}
int i = 1;
double sum = 0;
while(i <= n) {
sum += [Link](x, 2 * i);
i++;
}
[Link](sum);
}
}
int i = 1, sum = 0;
while(i < n) {
if(n % i == 0)
sum += i;
i++;
}
if(sum == n)
[Link]("Perfect Number");
else
[Link]("Not Perfect");
}
}
if(term % 3 != 0) {
[Link](term);
count++;
}
n++;
}
}
}
while(i <= 5) {
total += [Link]([Link]());
i++;
}
switch(n) {
case 1: [Link]("Monday"); break;
case 2: [Link]("Tuesday"); break;
case 3: [Link]("Wednesday"); break;
case 4: [Link]("Thursday"); break;
case 5: [Link]("Friday"); break;
case 6: [Link]("Saturday"); break;
case 7: [Link]("Sunday"); break;
default: [Link]("Invalid");
}
}
}
int temp = a;
a = b;
b = temp;
3. Even or Odd
import [Link].*;
class EvenOdd {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
if(n % 2 == 0)
[Link]("Even");
else
[Link]("Odd");
}
}
4. Greater of aᵇ and bᵃ
import [Link].*;
class ComparePower {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int a = [Link]([Link]());
int b = [Link]([Link]());
if(x > y)
[Link]("a^b is greater");
else if(y > x)
[Link]("b^a is greater");
else
[Link]("Both are equal");
}
}
5. Divisors of a number
import [Link].*;
class Divisors {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int m = (int)[Link](2, n) - 1;
[Link](m);
}
}
8. Series: 4n + 1 (5 terms)
import [Link].*;
class Series2 {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
double sum = 0;
for(int i = 1; i <= n; i++)
sum += [Link](x, 2 * i);
[Link](sum);
}
}
int sum = 0;
for(int i = 1; i < n; i++)
if(n % i == 0)
sum += i;
if(sum == n)
[Link]("Perfect Number");
else
[Link]("Not Perfect");
}
}
if(term % 3 != 0) {
[Link](term);
count++;
}
}
}
}
switch(ch) {
case '+': [Link](a + b); break;
case '-': [Link](a - b); break;
case '*': [Link](a * b); break;
case '/': [Link](a / b); break;
default: [Link]("Invalid Operator");
}
}
}
switch(n) {
case 1: [Link]("Monday"); break;
case 2: [Link]("Tuesday"); break;
case 3: [Link]("Wednesday"); break;
case 4: [Link]("Thursday"); break;
case 5: [Link]("Friday"); break;
case 6: [Link]("Saturday"); break;
case 7: [Link]("Sunday"); break;
default: [Link]("Invalid");
}
}
}
⭐ Pattern 2
1
12
123
class Pattern2 {
public static void main(String args[]) {
for(int i = 1; i <= 3; i++) {
for(int j = 1; j <= i; j++)
[Link](j);
[Link]();
}
}
}
int temp = a;
a = b;
b = temp;
do {
sum += [Link]([Link]());
i++;
} while(i <= 5);
3. Even or Odd
import [Link].*;
class EvenOdd {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
if(n % 2 == 0)
[Link]("Even");
else
[Link]("Odd");
}
}
4. Greater of aᵇ and bᵃ
import [Link].*;
class ComparePower {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int a = [Link]([Link]());
int b = [Link]([Link]());
if(x > y)
[Link]("a^b is greater");
else if(y > x)
[Link]("b^a is greater");
else
[Link]("Both are equal");
}
}
5. Divisors of a number
import [Link].*;
class Divisors {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int i = 1;
do {
if(n % i == 0)
[Link](i);
i++;
} while(i <= n);
}
}
int m = (int)[Link](2, n) - 1;
[Link](m);
}
}
8. Series: 4n + 1 (5 terms)
import [Link].*;
class Series2 {
public static void main(String args[]) throws Exception {
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
int n = [Link]([Link]());
int i = 1;
do {
[Link](4 * n + 1);
n++;
i++;
} while(i <= 5);
}
}
int i = 1;
double sum = 0;
do {
sum += [Link](x, 2 * i);
i++;
} while(i <= n);
[Link](sum);
}
}
do {
c = a + b;
[Link](c);
a = b;
b = c;
count++;
} while(count <= 13);
}
}
if(sum == n)
[Link]("Perfect Number");
else
[Link]("Not Perfect");
}
}
do {
int term = 2 * n + 2;
if(term % 3 != 0) {
[Link](term);
count++;
}
n++;
} while(count < 10);
}
}
do {
total += [Link]([Link]());
i++;
} while(i <= 5);
switch(ch) {
case '+': [Link](a + b); break;
case '-': [Link](a - b); break;
case '*': [Link](a * b); break;
case '/': [Link](a / b); break;
default: [Link]("Invalid Operator");
}
}
}
switch(n) {
case 1: [Link]("Monday"); break;
case 2: [Link]("Tuesday"); break;
case 3: [Link]("Wednesday"); break;
case 4: [Link]("Thursday"); break;
case 5: [Link]("Friday"); break;
case 6: [Link]("Saturday"); break;
case 7: [Link]("Sunday"); break;
default: [Link]("Invalid");
}
}
}
⭐ Pattern 2
1
12
123
class Pattern2 {
public static void main(String args[]) {
int i = 1;
do {
int j = 1;
do {
[Link](j);
j++;
} while(j <= i);
[Link]();
i++;
} while(i <= 3);
}
}
Pattern 1
*
**
***
****
*****
class Pattern1 {
public static void main(String args[]) {
for(int i = 1; i <= 5; i++) {
for(int j = 1; j <= i; j++) {
[Link]("*");
}
[Link]();
}
}
}
Pattern 2
*****
****
***
**
*
class Pattern2 {
public static void main(String args[]) {
for(int i = 5; i >= 1; i--) {
for(int j = 1; j <= i; j++) {
[Link]("*");
}
[Link]();
}
}
}
Pattern 3
1
22
333
4444
55555
class Pattern3 {
public static void main(String args[]) {
for(int i = 1; i <= 5; i++) {
for(int j = 1; j <= i; j++) {
[Link](i);
}
[Link]();
}
}
}
Pattern 4
55555
4444
333
22
1
class Pattern4 {
public static void main(String args[]) {
for(int i = 5; i >= 1; i--) {
for(int j = 1; j <= i; j++) {
[Link](i);
}
[Link]();
}
}
}
Pattern 5
1
12
123
1234
12345
class Pattern5 {
public static void main(String args[]) {
for(int i = 1; i <= 5; i++) {
for(int j = 1; j <= i; j++) {
[Link](j);
}
[Link]();
}
}
}
Pattern 6
12345
1234
123
12
1
class Pattern6 {
public static void main(String args[]) {
for(int i = 5; i >= 1; i--) {
for(int j = 1; j <= i; j++) {
[Link](j);
}
[Link]();
}
}
}