Scribd
Upload
89 views5 pages

Class 9 ICSE Java Programming Solutions

Uploaded by

rs0504434
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
89 views5 pages

Class 9 ICSE Java Programming Solutions

Uploaded by

rs0504434
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Class 9 ICSE Java Programming Solutions

1. Swapping Two Numbers Without a Third Variable:

------------------------------------------------

int a = 5, b = 10;

a = a + b; // a becomes 15

b = a - b; // b becomes 5

a = a - b; // a becomes 10

System.out.println("a = " + a + ", b = " + b);

2. Sum of Prime Numbers in a Range:

-----------------------------------

int sum = 0;

for (int i = start; i <= end; i++) {

boolean isPrime = true;

for (int j = 2; j <= i / 2; j++) {

if (i % j == 0) {

isPrime = false;

break;

if (isPrime && i > 1) {

sum += i;

System.out.println("Sum of primes: " + sum);


3. Checking for Twin Primes:

----------------------------

boolean isPrime(int n) {

for (int i = 2; i <= n / 2; i++) {

if (n % i == 0) return false;

return n > 1;

if (isPrime(num1) && isPrime(num2) && Math.abs(num1 - num2) == 2) {

System.out.println("Twin primes");

} else {

System.out.println("Not twin primes");

4. Automorphic Number Check:

----------------------------

int square = num * num;

if (square % (int)Math.pow(10, String.valueOf(num).length()) == num) {

System.out.println("Automorphic");

} else {

System.out.println("Not Automorphic");

5. Perfect Square Check:

------------------------

boolean isPerfectSquare = false;


for (int i = 1; i <= num / 2; i++) {

if (i * i == num) {

isPerfectSquare = true;

break;

System.out.println(isPerfectSquare ? "Perfect square" : "Not a perfect square");

6. Display Prime Digits in a Number:

------------------------------------

while (num > 0) {

int digit = num % 10;

if (digit == 2 || digit == 3 || digit == 5 || digit == 7) {

System.out.println(digit);

num /= 10;

7. Decimal to Binary Conversion:

--------------------------------

String binary = "";

while (num > 0) {

binary = (num % 2) + binary;

num /= 2;

System.out.println("Binary: " + binary);


8. Sum of Odd and Even Digits:

------------------------------

int sumOdd = 0, sumEven = 0;

while (num > 0) {

int digit = num % 10;

if (digit % 2 == 0) sumEven += digit;

else sumOdd += digit;

num /= 10;

System.out.println("Sum of even digits: " + sumEven);

System.out.println("Sum of odd digits: " + sumOdd);

9. Frequency of Digits:

-----------------------

int[] freq = new int[10];

while (num > 0) {

freq[num % 10]++;

num /= 10;

for (int i = 0; i < 10; i++) {

if (freq[i] > 0) {

System.out.println("Digit " + i + ": " + freq[i] + " times");

10. Reverse and Check Palindrome:

---------------------------------
int reverse = 0, original = num;

while (num > 0) {

reverse = reverse * 10 + (num % 10);

num /= 10;

System.out.println(reverse == original ? "Palindrome" : "Not a palindrome");

You might also like