Java jumbled code, strings, methods

Find the correct code to find the reverse of a number. For example if the number is 234, the output should be 432

•    while (n > 0) {

     n = n / 10;

              rem = n % 10;

           rev = (rev * 10) + rem;

        }

  
  

•    while (n > 0) {

              rem = n % 10;

              rev = (rev * 10) + rem;

              n = n / 10;

          }

•   while (n > 0) {

              rem = n % 10;

              rev = (rem * 10) + rev;

              n = n / 10;

          }

•   while (n < 0) {

              rem = n % 10;

              rev = (rev * 10) + rem;

              n = n / 10;

          }

Identify the code that gives the sum of the digits of a number? If the number is 567 the sum is 18

• while (number > 0)  {  

  number = number % 10;   

  sum = sum + remainder;  

  number = number / 10;     

  } 

  System.out.print(sum)

• while (number > 0)  {  

  remainder = number / 10;   

  sum = sum + remainder;  

  number = number % 10;     

  } 

  System.out.print(sum)

• while (number > 0)  {  

  remainder = number % 10;   

  sum = sum + number;  

  number = number / 10;     

  } 

  System.out.print(sum)

• while (number > 0)  {  

  remainder = number % 10;   

  sum = sum + remainder;  

  number = number / 10;     

  } 

  System.out.print(sum)

  
  

Identify the correct code to check if a number is prime or not. num is the number to check.

• boolean flag = false

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

  {

  if (num % i == 0) {

  flag = true; break;

  }

  }

  if (!flag) System.out.println("prime"); else

  System.out.println(" not prime");

• boolean flag = false

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

  {

  if (num % i == 0) {

  flag = true; break;

  }

  }

  if (!flag) System.out.println("prime"); else

  System.out.println(" not prime");

• boolean flag = false

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

  {

  if (num % i == 0) {

  flag = true; break;

  }

  }

  if (flag) System.out.println("prime"); else

  System.out.println(" not prime");

• boolean flag = true

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

  {

  if (num % i != 0) {

  flag = true; break;

  }

  }

  if (!flag) System.out.println("prime"); else

  System.out.println(" not prime");

identify the correct java code snippet to check if a String is a palindrome. Variable len is the length of the String.

• boolean isPalin = true;

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

  if (str.charAt(i) != str.charAt(len- 1 - i)) {

  isPalin = false;

  break;

  } }

  if (isPalin)

  System.out.println("palindrome");

  else

  System.out.println("not palindrome.")

• boolean isPalin = true;

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

  if (str.charAt(i) != str.charAt(len- 1 - i)) {

  isPalin = false;

  break;

  } }

  if (!isPalin)

  System.out.println("palindrome");

  else

  System.out.println("not palindrome.")

• boolean isPalin = true;

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

  if (str.charAt(i) == str.charAt(len- 1 - i)) {

  isPalin = false;

  break;

  } }

  if (isPalin)

  System.out.println("palindrome");

  else

  System.out.println("not palindrome.")

what is the min and max value of short data type in Java?

• -2¹⁶ and 2¹⁶-1

• -2¹⁵ and 2¹⁵-1

• -2³¹ and 2³¹-1

• 2¹⁵ and -2¹⁵-1

what is the default value of a boolean data type?

• true

• false

1. A variable declared within the opening and closing parenthesis of a method signature is called a ____.

• local

• parameter

• instance

• class

1. An ___ is a container object that holds a fixed number of values of a single type.

1. A local variable stores temporary state; it is declared inside a ___.

A string internally creates:

• 1. An integer array

• 1. A numeric array

• 1. A double type array

• 1. A character array