Computer Science Assignments Solution
_________________________________________________________________________________________________________
_________________________________________________________________________________________________________
=====================================================================
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
=====================================================================
SOLUTIONS :-
Assignment 1
import
java.util.Scanner;
class
Assignment_1
{
Scanner S = new Scanner(System.in);
public int digit(int x,int y)
{
int j = x;
int i = 1;
while(j>0)
{
int d = j%10;
j=j/10;
if(i==y)
return d;
i++;
}
return j;
}
public int no_of_digits(int x)
{
int y = x;
int nod = 0;
while(y>0)
{
y=y/10;
nod++;
}
return nod;
}
public boolean isKaprekar(int x)
{
int square = x*x;
int nod = no_of_digits(square);
double n1=0,n2=0;
if(nod%2==0)
{
for(int i=1;i<=nod/2;i++)
n2 =n2+
digit(square,i)*Math.pow(10,(i-1));
for(int i=(nod/2)+1;i<=nod;i++)
n1 = n1+
digit(square,i)*Math.pow(10,(i-(nod/2)-1));
}
else
{
for(int i=1;i<=(nod+1)/2;i++)
n2 = n2+
digit(square,i)*Math.pow(10,(i-1));
for(int
i=((nod+1)/2)+1;i<=nod;i++)
n1 = n1+
digit(square,i)*Math.pow(10,(i-((nod+1)/2)-1));
}
if((n1+n2)==x)
return true;
else
return false;
}
}
Assignment 2
import
java.util.Scanner;
class
Assignment_2
{
Scanner S = new Scanner(System.in);
public boolean isPalindrome(int x)
{
int sum = 0;
int y = x;
while(x!=0)
{
sum = sum*10;
sum = sum+(y%10);
y= y/10;
}
if(sum==y)
return true;
else
return false;
}
public boolean isPrime(int x)
{
int killme = 0;
for(int i = 2;i<x;i++)
{
if(x%i==0)
killme++;
else
continue;
}
if(killme>0)
return false;
else
return true;
}
public boolean isPrimePalindrome(int x)
{
int y = x;
if(isPrime(y))
{
String str = Integer.toString(y);
String ns = "";
for(int i =
0;i<str.length();i++)
ns = str.charAt(i)+ns;
if(ns.equalsIgnoreCase(str))
return true;
}
return false;
}
void main()
{
System.out.println("Enter the
number to be checked for Prime Palindrome");
int no = S.nextInt();
if(isPrimePalindrome(no))
System.out.println("It is a
Prime Palindrome No.");
else
System.out.println("Not a
Prime Palindrome No.");
}
}
Assignment 3
import java.util.Scanner;
class Assignment_3
{
Scanner S = new Scanner(System.in);
public void main()
{
System.out.println("Enter the ISBN Number");
int no = S.nextInt();
if(isISBN(no))
System.out.println("It is a legal ISBN No.");
else
System.out.println("It is not a legal ISBN No.");
}
public boolean isISBN(long x)
{
long c = x;
long sum = 0;
for(int i = 1;i<=10;i++)
{
long d = c%10;
c=c/10;
sum = sum + (d*i);
}
if((sum%11)==0)
return true;
else
return false;
}
}
Assignment 4
import
java.util.Scanner;
class
Assignment_4
{
Scanner S = new Scanner(System.in);
public int unknown(int M,int N)
{
int result=0;
for(int i = M;i<=10000;i++)
{
int o = i;
int sum = 0;
while(o>0)
{
int d = o%10;
o=o/10;
sum = sum + d;
}
if(sum==N)
return i;
}
return result;
}
public void main()
{
System.out.println("Enter the
values of M and N");
int M = S.nextInt();
int N = S.nextInt();
if(((M>=100)&&(M<=10000))&&((N>0)&&(N<100)))
System.out.println("Result is
"+unknown(M,N));
else
System.out.println("Wrong values
of M and N Entered!");
}
}
Assignment 5
import
java.util.Scanner;
class
Assignment_5
{
Scanner S = new Scanner(System.in);
public int no_of_digits(int x)
{
int y = x;
int nod=0;
while(y>0)
{
y=y/10;
nod++;
}
return nod;
}
public boolean isPrime(int x)
{
int killme = 0;
for(int i = 2;i<x;i++)
{
if(x%i==0)
killme++;
else
continue;
}
if(killme>0)
return false;
else
return true;
}
public boolean isCircularPrime(int x)
{
int nod = no_of_digits(x);
int y = x;
while(isPrime(y)==true)
{
int c = y%10;
y = y/10;
y=(c*(power(10,(nod-1))))+y;
if(x==y)
return true;
}
return false;
}
public int power(int x, int y)
{
int result = 1;
while(y>0)
{
result = result*x;
y--;
}
return result;
}
}
-----x-----x-----x-----x-----x-----x-----x-----x-----x-----x-----x-----
No comments:
Post a Comment