JSpiders Delhi-NCR 9810072392

1.Program to chk number is Palindrome or not.

public class Palindrome {

public static void main(String[] args) {

int n=353;
int r, sum=0;
int temp=n;

while(n>0){
r=n%10;
sum=(sum*10)+r;
n=n/10;
}

if(temp==sum)
{
System.out.println("number is palindrome");
}
else{
System.out.println("Number is not palindrome");
}

}}

2.Program to check number is Armstrong or not.

public class Armstrong {

public static void main(String[] args) {

int n=371;
int a, sum=0;
int temp=n;
while(n>0){
a=n%10;
n=n/10;
sum=sum+(a*a*a);
}

if(temp==sum)
System.out.println("number is Armstrong");
else
System.out.println("Number is not Armstrong ");

}}}
3.Program to print a pyramid.

public class PyramidNew {

JSpiders Delhi-NCR 9810072392
public static void main(String[] args) {
int n=5;
for(int i=1;i<=n;i++){

for(int s=1;s<=n-i;s++){
System.out.print(" ");
}
for(int j=1;j<=(i*2)-1;j++)
{
System.out.print("*");
}
System.out.println();
}

}}

4. Program to remove duplicate elements in an array.

public class removeDuplicate {

public static int removeDuplicateElements(int arr[], int n){

int[] temp = new int[n];
int j = 0;
for (int i=0; i<n-1; i++){
if (arr[i] != arr[i+1]){
temp[j++] = arr[i];
}
}
temp[j++] = arr[n-1];

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

arr[i] = temp[i];
}
return j;
}

public static void main (String[] args) {

int arr[] = {11,22,22,33,33,33};
int length = arr.length;
length = removeDuplicateElements(arr, length);

for (int i=0; i<length; i++)

System.out.print(arr[i]+" ");
}
5.Program to check number is prime or not.

public class ChkPrimeNo {

public static void main(String[] args) {

JSpiders Delhi-NCR 9810072392
int num=17;
boolean is_prime=true;

if (num==0||num==1){
System.out.println(num+"Not a prime number");
}
for(int i=2;i<num;i++){
if(num%2==0){
is_prime=false;
}
}
if(is_prime==false){
System.out.println(num+"is Not a prime number");
}
else
{
System.out.println(num+"is a prime number");
}
}

6.Program to find second largest number in an array.

public class SecondLargest {

public static void main(String[] args) {

int arr[]={4,8,1,3,4,89,12};
int max=arr[0];
int sec=0;
for(int i=0;i<arr.length;i++){
if(arr[i]>max){
sec=max;
max=arr[i];
}
else if(arr[i]>sec&&arr[i]!=max){
sec=arr[i];
}}
System.out.println("SECOND LARGEST NUMBER IN ARRAY IS "+sec);
}}
7.Program to find the factorial of given number.
public class FactorialNum {

public static void main(String[] args) {

int num=6;

int f=1;
JSpiders Delhi-NCR 9810072392
for(int i=1;i<=num;i++){
f=f*i;
}

System.out.println("Factorial of"+num+"is"+f);
}

8.Program to print fibonaaci Series.

public class FibonacciSeries {

public static void main(String[] args) {

int n1=0, n2=1,n3;

System.out.print(n1+" "+n2);
for(int i=2;i<10;i++){
n3=n1+n2;
System.out.print(" "+n3);
n1=n2;
n2=n3;
}
}}

9.Program to reverse a string.

public class ReverseString {
public static void main(String[] args) {

String str="India is a beautiful country ";

String rev="";
for(int i=str.length()-1;i>=0;i--)
{
rev=rev+str.charAt(i);
}
System.out.println(rev);
}
}
JSpiders Delhi-NCR 9810072392