[go: up one dir, main page]
Scribd
Upload
4 views8 pages

XI-6AUG2025. Computer Code

The document contains Java classes for various number-related operations. The 'emirp' class checks if a number and its reverse are both prime, the 'special' class determines if a number is a special number based on the factorial of its digits, and the 'arraysum' and 'array2Dsum' classes handle summing elements in one-dimensional and two-dimensional arrays respectively. Each class includes methods for input, processing, and displaying results.

Uploaded by

akansha7414111995
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
4 views8 pages

XI-6AUG2025. Computer Code

The document contains Java classes for various number-related operations. The 'emirp' class checks if a number and its reverse are both prime, the 'special' class determines if a number is a special number based on the factorial of its digits, and the 'arraysum' and 'array2Dsum' classes handle summing elements in one-dimensional and two-dimensional arrays respectively. Each class includes methods for input, processing, and displaying results.

Uploaded by

akansha7414111995
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/ 8

/*

class - emirp

dm- n

mf- emirp() - n=0

void input() - input n

boolean isprime(int x) -

int reverse(int y) -

void check()

*/

import java.util.*;

class emirp

int n;

emirp()

n=0;

void input()

Scanner sc = new Scanner (System.in);

System.out.print("Enter a No: ");

n=sc.nextInt();

boolean isprime(int x)

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

if (x%i==0)

return false;

}
}

return true;

int reverse(int y)

int r=0;

while(y!=0)

r=r*10+y%10;

y=y/10;

return r;

void check()

if (isprime(reverse(n)) && isprime(n))

System.out.println("Emirp No");

else

System.out.println("Not an Emirp No");

public static void main()

emirp ob = new emirp();

ob.input();

ob.check();

}
/*

class - special

Data Members: num

MF:

special(int nn) - num=nn

int fact(int x) -

void check()

*/

import java.util.*;

class special

int num;

special(int nn)

num=nn;

int fact(int x)

int f=1;

for (int i=1;i<=x;i++)

f=f*i;

return f;

void check()

int s=0,p=num;

while(num!=0)

{
int d=num%10;

s=s+fact(d);

num=num/10;

if (p==s)

System.out.println("Special No");

else

System.out.println("Not a Special No");

public static void main()

Scanner sc = new Scanner (System.in);

int y;

System.out.print("Enter a Number: ");

y=sc.nextInt();

special ob = new special(y);

ob.check();

/*

class - arraySum

DM - A[],n,s

MF - arraySum(int nn) - nn stores size of array, n=nn, s=0,allocate the memory of array A

void input()

void display()
void sum()

*/

import java.util.*;

class arraysum

int A[],n,s;

arraysum(int nn)

n=nn;

s=0;

A=new int [n];

void input()

Scanner sc = new Scanner (System.in);

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

System.out.print("Enter No: ");

A[i]=sc.nextInt();

void display()

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

System.out.print(A[i]+ "\t");

System.out.println("\nSum of all the Elements = " + s);

void sum()

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

s+=A[i];

public static void main()

arraysum ob = new arraysum(5);

ob.input();

ob.sum();

ob.display();

/*

class - array2Dsum

DM - A[][],m,n,s

MF - arraySum(int mm,int nn) - mm,nn stores size of array,m=mm, n=nn, s=0,allocate the
memory of array A

void input()

void display()

void sum()

*/

import java.util.*;

class array2Dsum

int A[][],m,n,s;

array2Dsum(int mm,int nn)

m=mm;

n=nn;
s=0;

A=new int [m][n];

void input()

Scanner sc = new Scanner (System.in);

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

for (int j=0;j<n;j++)

System.out.print("Enter No: ");

A[i][j]=sc.nextInt();

void display()

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

for (int j=0;j<n;j++)

System.out.print(A[i][j]+ "\t");

System.out.println();

System.out.println("Sum of all the Elements = " + s);

void sum()

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

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

s+=A[i][j];

public static void main()

array2Dsum ob = new array2Dsum(3,4);

ob.input();

ob.sum();

ob.display();

You might also like