NAME= ADITYA MONDAL

CLASS= XI
SECTION= A
ROLL NO= 23
SUBJECT= COMPUTER
1)Write a program to declare an array of n number of
integers where n is user defined. Accept the values from
users and insert only there values which are prime into
the array. Find smallest and largest values from array and
display-(i) array (ii)sum (iii)largest and smallest (iv)mean
difference g values in array
import java.util.Scanner;
class proj1
{
Scanner sc= new Scanner(System.in); //SCANNER CLASS FOR INPUT
//VARIABLES DECLARATION
int a[]=new int[100];
int sum1=0,sum=0,num,c=0,c1=0,diff=0,large=0,small,n;
double mean=0.0;
void input() //VOID METHOD TO INPUT VALUES FROM USER
{
System.out.println("ENTER THE VALUE OF N[No. of values]");
n=sc.nextInt();
a=new int[n]; //ARRAY FOR STORAGE OF VALUES ENTERED
System.out.println("ENTER "+n+" VALUES");
for(int i=0;i<n;i++)
{
num=sc.nextInt(); //VALUE INPUT FROM USER
 if(prime(num)==true) //PRIME CHECK OF VALUES
{
a[c]=num; //PRIME ARRAY STORAGE
c++;
}
}
}
void calc() //VOID METHOD FOR CALCULATIONS
{
for(int i=0;i<c;i++)
{
sum+=a[i]; //SUM OF PRIME ARRAY ELEMENTS
small=a[0];
if(a[i]>large) //LARGEST ELEMENT CHECK
large=a[i];
if(a[i]<small) //SMALLEST ELEMENT CHECK
small=a[i];
}
for(int i=0;i<c-1;i++)
{
//MEAN DIFFERENCE OF ELEMENTS OF PRIME ARRAY
diff=Math.abs(a[i]-a[i+1]);
sum1+=diff;
c1++;
 }
mean=(double)sum1/c1;
//DISPLAY OF CALCULATIONS
System.out.println(" PRIME ARRAY: ");
for(int i=0;i<c;i++)
System.out.println(a[i]);
System.out.println("\nSUM OF PRIME ARRAY ELEMENTS="+sum);
System.out.println("HIGHEST VALUE OF PRIME ARRAY="+large+"\nLOWEST
VALUE OF PRIME ARRAY="+small);
System.out.println("MEAN DIFFERENCE OF PRIME ARRAY
ELEMENTS="+mean);
}
boolean prime(int n1) //BOOLEAN METHOD TO CHECK PRIME
{
int cprime=0;
for(int j=1;j<=n1;j++)
{
if(n1%j==0)
cprime++;
}
if(cprime==2) //PRIME CHECK
return true;
else
return false;
}
 public static void main(String []args) //MAIN METHOD FOR OBJECT
CREATION
{
Proj1 ob= new proj1();
ob.input();
ob.calc();
}
}

~OUTPUT~
CLASS NAME:
METHOD LISTINGS:
NAME RETURN TYPE PURPOSE

VARIABLE LISTINGS:
VARIABLE DATATYPE DESCRIPTION
2)Write a program to find –(i)all palindrome number
between two ranges entered by user (ii)all special
number between two ranges entered by user the
program will continue unless the user presses 0 after
every execution, the program asks whether the menu to
displayed or not. The program will execute only until user
presses zero
import java.util.Scanner;

class proj2

Scanner sc= new Scanner(System.in); //SCANNER CLASS

//VARIABLE DECLARATION

int num=0;int up=0,low=0;

void menu() //METHOD TO DISPLAY MENU AND INPUT FROM USER

System.out.println("--MENU--");

System.out.println("--1.PALINDROME NO.s--");

System.out.println("--2.SPECIAL NO.s--");

System.out.println("ENTER CHOICE");

int ch=sc.nextInt();

System.out.println("--ENTER LOWER LIMIT--");

low=sc.nextInt()+1;

System.out.println("--ENTER UPPER LIMIT--");

up=sc.nextInt()-1;

switch(ch) //SWITCH CASE

case 1: //1ST CHOICE

System.out.println("PALINDROME");

palindrome();
 redo();

break;

case 2: //2ND CHOICE

System.out.println("SPECIAL");

special();

redo();

break;

default: //USER ENTERED INVALID VALUE

System.out.println("INVALID CHOICE");

void palindrome() //METHOD TO CHECK PALINDROME

for(int i=low;i<=up;i++)

num=i;

int r=0;

for(int j=num;j>0;j/=10)

int d=j%10;
 r=r*10+d; //REVERSE OF A NUMBER

if(r==num) //PALINDROME CHECK

System.out.println(num);

void special() //SPECIAL NUMBER CHECK

for(int i=low;i<=up;i++)

num=i;

int p=1,s=0,d;

for(int j=num;j>0;j/=10)

d=j%10;

p=1;

for(int k=1;k<=d;k++)

p*=k; //FACTORIAL OF NUMBER

s+=p;

if(s==num) //SPECIAL NUMBER CHECK

System.out.println(num);
 }

void redo() //RESTART OF THE PROGRAM UPON CHOICE

System.out.println("WANT THE PROGRAM AGAIN?\nYES=1\nNO=0");

int rd=sc.nextInt();

if(rd!=0)

System.out.println("WELCOME back!");

menu();

else

System.out.println("THANKS");

public static void main(String[] args) //MAIN METHOD

proj2 ob= new proj2();

ob.menu();

}
 ----------------OUTPUT---------------------
OUTPUT---------------------

CLASS NAME:
METHOD LISTINGS:
NAME RETURN TYPE PURPOSE

VARIABLE LISTINGS:
VARIABLE DATATYPE DESCRIPTION

3) Declare an array of n integers where n is user defined.

Insert the prime Fibonacci series into the array. Now
accept n no of values that you have accepted whether it
belongs to the prime Fibonacci series and find their sum.
Print the number which matches with the array and also
print the sum.
import java.util.Scanner;
class proj3
{
int n,arr1[],c=0,a=0,b=1,c1=0,c2,m,s=0; //VARIABLE DECLARATION
boolean tf;
Scanner sc= new Scanner(System.in);
void input() //METHOD TO INPUT VALUES AND STORE FIBO ARRAY
{
System.out.println("ENTER N");
n= sc.nextInt();
arr1=new int[n];
fibo(n);
}
void fibo(int n1) //METHOD CALCULATES PRIME FIBONACCI SERIES
{
while(c<=n1)
{
c=a+b;
if(c>n1)
break;
a=b;
b=c; //FIBONACCI CALCULATIONS
if(c!=1)
{
tf=prime(c); //PRIME CHECK OF FIBONACCI NUMBERS
if(tf==true)
{
arr1[c1]=c;
c1++;
}}}
System.out.println("ARRAY="); //DISPLAY OF PRIME FIBO SERIES
for(int i=0;i<c1;i++)
System.out.println(arr1[i]);
}
boolean prime(int n2) //TO CHECK IF A NUMBER IS PRIME
{
c2=0;
for(int i=1;i<=n2;i++)
{
if(n2%i==0)
c2++;
}

if(c2==2)
return true;
else
return false;
}
void calc() //TO CALCULATE THE SUM OF MATCHING NUMBERS
{
System.out.println("ENTER the value of M");
int m=sc.nextInt();
if(m<n)
{
System.out.println("ENTER "+m+" VALUES");
 int m1[]=new int[n];
for(int i=0;i<m;i++)
{
t1[i]=sc.nextInt(); //ENTERING M no. of VALUES FROM USER
for(int j=0;j<c1;j++)
{
if(t1[i]==arr1[j]) //LINEAR SEARCH OF MATCHING VALUES
{
s+=t1[i]; //SUM OF MATCHING VALUES
System.out.println("MATCH= "+t1[i]);
}
}}
}
System.out.println("SUM="+s);
}
public static void main(String[]args) //MAIN METHOD
{
proj3 ob= new proj3(); //OBJECT CREATION AND CALLING
ob.input();
ob.calc();
}
}

------OUTPUT-------
CLASS NAME:
METHOD LISTINGS:
NAME RETURN TYPE PURPOSE

VARIABLE LISTINGS:
VARIABLE DATATYPE DESCRIPTION
4) Write a program menu driven to find the binary octal
and hexadecimal values of a number accepted the user.
The program will remain until the user presses zero.
import java.util.Scanner;
class proj4
{
Scanner sc= new Scanner(System.in); //SCANNER CLASS
int n,ch,d=0,rd; //VARIABLE DECLARATION
String s1="";
void input() //TO INPUT VALUES FROM USER
{
System.out.println("--MENU--"); //MENU DRIVEN LIST
System.out.println("ENTER A DECIMAL NUMBER");
n=sc.nextInt();
System.out.println("ENTER CHOICE OF CONVERSION");
System.out.println("1.BINARY\n2.OCTAL\n3.HEXADECIMAL");
ch=sc.nextInt(); //ENTER OF CHOICE

switch(ch) //SWITCH CASE

{
case 1: //CHOICE - BINARY CONVERSION
binary();
redo();
break;

case 2: //CHOICE- OCTAL CONVERSION

octal();
redo();
break;

case 3: //CHOICE- HEXADECIMAL CONVERSION

hexa();
redo();
 break;

default: //INVALID CHOICE

System.out.println("INVALID CHOICE");
}
}
void binary() //FOR BINARY CONVERSION
{
s1="";
System.out.println("--BINARY EQUIVALENT--");
while(n>0)
{
d=n%2;
n=n/2;
s1=d+s1;
}
System.out.println(s1); //DISPLAY OF BINARY NUMBER
}
void octal() //OCTAL CONVERSION
{
s1="";
System.out.println("--OCTAL EQUIVALENT--");
while(n>0)
{
 d=n%8;
n=n/8;
s1=d+s1;
}
System.out.println(s1); //DISPLAY OF OCTAL NUMBER
}
void hexa() //HEXADECIMAL CONVERSION
{
s1="";
System.out.println("--HEXADECIMAL EQUIVALENT--");
while(n>0)
{
d=n%16;
n=n/16;
switch(d) // HEXADECIMAL HAS A RANGE OF ALPHABETS (10-15)~(A-F)
{
case 10:
s1='A'+s1;
break;
case 11:
s1='B'+s1;
break;
case 12:
s1='C'+s1;
 break;
case 13:
s1='D'+s1;
break;
case 14:
s1='E'+s1;
break;
case 15:
s1='F'+s1;
break;
default:
s1=d+s1;
}
}
System.out.println(s1); //DISPLAY OF HEXADECIMAL NUMBER
}
void redo() //IF THE USER WANTS TO RE USE THE PROGRAM
{
System.out.println("DO YOU WANT TO REDO IT AGAIN?YES=1\nNO=0");
rd=sc.nextInt();
if(rd!=0)
{
System.out.println("WELCOME BACK!");
input();
 }
else
System.out.println("THANKS");
}
public static void main(String [] args) //OBJECT CREATION OF CLASS
{
proj4 ob= new proj4();
ob.input();
}
}

---------OUTPUT--------
CLASS NAME:
METHOD LISTINGS:
NAME RETURN TYPE PURPOSE

VARIABLE LISTINGS:
VARIABLE DATATYPE DESCRIPTION

5) Accept a number from the user find out all primes

which all closet to that number.
import java.util.Scanner;
class proj5
{
Scanner sc= new Scanner(System.in);
int n,copy,a,b,c,d,diff1,diff2,cpr; //VARIABLE DECLARATION
void input() //METHOD TO INPUT VALUES CHECK FOR PRIME
{
System.out.println("ENTER N");
n=sc.nextInt(); //INPUT OF VALUE FROM USER
copy=n;
for(int i=n;i>2;i--)
{
//TWIN PRIME CHECK OF no.s LESS THAN n
if(prime(i)==true &&prime(i-2)==true)
{
a=i;
b=i-2;
break;
}
}
while(copy>=n)
{
//TWIN PRIME CHECK OF no.s MORE THAN n
if(prime(copy)==true &&prime(copy+2)==true)
{
c=copy;
d=copy+2;
 break;
}
copy++;
}
diff1=n-a; //DIFFERENCE OF TWIN PRIME PAIRS FROM n
diff2=c-n;
if(diff1==diff2) //IF BOTH PAIRS ARE EQUALLY DISTANT
{
System.out.println("BOTH TWIN PRIME PAIRS ARE:\n"+ b+" and
"+a+"\n"+c+" and "+d);
}
else if(diff2>diff1) //IF THE 1ST PAIR IS NEARER
System.out.println(" TWIN PRIME PAIRS ARE: "+ b+" and "+a);
else if(diff1>diff2) //IF THE 2ND PAIR IS NEARER
{
System.out.println(" TWIN PRIME PAIRS ARE: "+ c+" and "+d);
}
}
boolean prime(int n1) //PRIME CHECK OF NUMBERS
{
cpr=0;
for(int k=1;k<=n1;k++)
{
if(n1%k==0)
 cpr++;
}
if(cpr==2)
return true;
else
return false;
}
public static void main(String [] args) //MAIN METHOD
{
proj5 ob= new proj5();
ob.input();
}
}

-------OUTPUT------
CLASS NAME:
METHOD LISTINGS:
NAME RETURN TYPE PURPOSE

VARIABLE LISTINGS:
VARIABLE DATATYPE DESCRIPTION

6) WRITE A PROGRAM MENU DRIVEN TO FIND HCF AND

THE LCM OF THE 2 NUMBERS. THE PROGRAM WILL
CONTINUE UNLESS THE USERPRESSES ZERO. USE SWITCH
CASE AND OVERLOADED THE METHOD, CALCULATE TO
FIND THE HCF AND LCM. THE METHOD FOR HCF SHOULD
RETURN THE HCF OF 2 NUMBERS AND METHOD LCM
SHOULD ALSO RETURN LCM OF 2 NUMBERS

import java.util.Scanner;
class proj6
{
int a,b,choice,lcm=0,hcf=0,p=1; //VARIABLE DECLARATION
Scanner sc= new Scanner(System.in);
void input() //METHOD TO DISPLAY MENU AND PROCEED IN CALCULATIONS
{
System.out.println("ENTER 2 NUMBERS");
a=sc.nextInt(); //ENTERING VALUES FROM USER
b=sc.nextInt();
System.out.println("--MENU--"); //MENU OF CHOICES
System.out.println("--ENTER CHOICE--");
System.out.println("1.HCF\n2.LCM");
choice=sc.nextInt();
switch(choice) //SWITCH CASE
{
case 1: //1ST CHOICE
System.out.println("--HCF--");
hcf=calc(a,b); //HCF OF 2 NUMBERS
System.out.println("HCF="+ hcf);
redo();
break;

case 2: //2ND CHOICE

System.out.println("--LCM--");
p=1;
lcm=calc(a,b,p); //LCM OF 2 NUMBERS
 System.out.println("LCM="+ lcm);
redo();
break;

default:
System.out.println("INVALID INPUT");
}
}
//FOLLOWING ARE OVERLOADED METHODS
int calc(int a1,int b1) //TO CALCULATE HCF
{
int p=1;
for(int i=2;i<=Math.min(a1,b1);
{
if(a1%i==0&&b1%i==0)
{
p*=i;
a1=a1/i;
b1=b1/i;
}
else
i++;
}
return p;
 }
int calc(int a1,int b1,int p1) //TO CALCULATE LCM
{
p=1;
for(int i=2;i<=Math.min(a1,b1);)
{
if(a1%i==0&&b1%i==0)
{
p*=i;
a1=a1/i;
b1=b1/i;
}
else
i++;
}
p*=a1*b1;
return p;
}
void redo() //IF THE USER WISHES TO RE-USE THE PROGRAM
{
System.out.println("DO YOU WANT TO REDO THE
PROGRAM?\nYES=1\nNO=0");
int ch=sc.nextInt();
if(ch!=0)
 {
System.out.println("WELCOME AGAIN");
input();
}
else
System.out.println("THANK YOU FOR USING");
}
static void main() //MAIN METHOD
{
proj6 ob= new proj6();
ob.input();
}
}

----OUTPUT-----
CLASS NAME:
METHOD LISTINGS:
NAME RETURN TYPE PURPOSE

VARIABLE LISTINGS:
VARIABLE DATATYPE DESCRIPTION
-------------THANK YOU------------------