Program to find the Even and Odd Series
public class Series
{
public static void main(String args[])
{
int i,n=20;
for(i=0;i<20;i++) {
if(i%2==0) {
System.out.println("Even number: "+i);
} else {
System.out.println("odd number: "+i);
}
}
}
}
Program to find given number is an Armstrong Number
public class Armstrong {
public static void main(String args[])
{
System.out.println("Enter the value");
Scanner s=new Scanner(System.in);
int a=s.nextInt();
int k=a;
int y,z=0;
while(k>0) {
y=k%10;
k=k/10;
z=z+(y*y*y);
}
if (z==x) {
System.out.println("armstrong");
} else{
System.out.println("Not armstrong");
}
}
}
}
Program Coding to find a Palindrome for String
public class Palindrome
{
public static void main(String args[])
{
String S="madam";
char c[]=S.toCharArray();
for(char d:c) {
System.out.println(d);
}
String b="";
for(int i=c.length-1;i>=0;i--) {
b=b+c[i];
}
System.out.println(b);
if(b.equals(S)){
System.out.println("palindrome");
} else {
System.out.println("Not palindrome");
}
}
}
Program To find a Number is Palindrome or Not
public class Palindrome {
public static void main(String args[])
{
int k=121;
for(k=121;k<=100;k++) {
int x=k,y=0,z=0;
while(k>0) {
y=k%10;
z=z*10+y;
k=k/10;
}
if(z==x) {
System.out.println("its a pal");
} else {
System.out.println("not pal");
}
}
}
}
Program Coding to Reverse a Number or String
public class Reverse
{
public static void main(String args[])
{
int num=12345;
int a,b=0;
while(num>0){
a=num%10;
b=b*10+a;
num=num/10;
}
System.out.println(b);
}
}
Program Coding to find a Given Number using Linear Search
public class Linear
{
public static void main(String args[])
{
int Array[]={12,43,56,76,32,14,56,90};
int SearchNumber=90,i;
for(i=0;i<=Array.length-1;i++){
if(Array[i]==SearchNumber){
System.out.println("Given Number is at" +i+ "position");
}
}
}
}
Program Coding to find a Given Number using Binary Search
class BinarySearch
{
public static void main(String args[])
{
int arr[]={1,2,3,4,5,6,7,8,9};
int imin=0,imax=arr.length-1;
int imid=(imin+imax)/2;
int key=8,position=0;
boolean flag=false;
while(imin<=imax){
if(arr[imid]>key){
imax=imid-1;
}
if(arr[imid]<key){
imin=imid+1;
}
if(arr[imid]==key){
position=imid+1;
flag=true;
break;
}
imid=(imin+imax)/2;
}
if(flag){
System.out.println(key+" is found at " +position);
} else {
System.out.println("key not found");
}
}
}
Program to find if the given number is Strong Number
public class StrongNumber
{
public static void main(String args[])
{
int n=146;
int temp=n;
int a,res=0;
while(n>0){
a=n%10;
int fact=1;
while(a>0){
fact=fact*a;
a--;
}
res+=fact;
n=n/10;
}
if(res==temp){
System.out.println("strong number");
} else {
System.out.println("Not Strong Number");
}
}
}
Program To Find the Given Number is Prime Number
public class PrimeNumber
{
public static void main(String args[])
{
int num=113;
int i=0;
for(i=2;i<num;i++){
if(num%i==0){
System.out.println("Not");
break;
}
}
if(i==num){
System.out.println("prime");
}
}
}
Program to find the Prime Numbers between given two numbers
public class PrimeSeries
{
public static void main(String args[])
{
int Number=100;
int i,j;
for(i=1;i<=Number;i++){
for(j=2;j<i;j++){
if(i%j==0){
System.out.println("Not prime "+i);
break;
}
}
if(i==j) {
System.out.println("prime Number "+i);
}
}
}
}
Program to find Fibonacci series values upto given number
public class Fibonacci
{
public static void main(String args[])
{
int Number=9;
int i,j,f0=0,f1=1,f2;
for(i=0;i<=9;i++){
f2=f0+f1;
f0=f1;
f1=f2;
f2=f0;
System.out.println(f2);
}
}
}
No comments:
Post a Comment