Experiment – 1
Ans a)
import [Link].*;
public class Pallindrome {
static boolean isPallindrome(int n){
int r = 0;
int k = n;
while (n != 0){
r *= 10;
r += n % 10;
n = n / 10;
}
return k == r;
}
public static void main(String[] args) {
Scanner scan = new Scanner([Link]);
[Link]("Enter a number to test: ");
int n = [Link]();
if (isPallindrome(n)){
[Link]("This number is pallindrome");}
else {
[Link]("This number is not
pallindrome");
}
[Link]();
}
}
Ans b)
import [Link].*;
public class Prime {
static boolean isPrime(int n){
for (int i = 2; i <= [Link](n); i++){
if (n % i == 0) return false;
}
return true;
public static void main(String[] args) {
Scanner scan = new Scanner([Link]);
[Link]("Enter a number to test: ");
int n = [Link]();
if (isPrime(n))
[Link]("This is prime");
else
[Link]("This is composite");
[Link]();
}
}