Programs

Java Programs For Freshers

 PrimeOrNot
public class prime
{
public static void main(String[] args)
{
Scanner scn=new scanner(System.in);
int n=scn.nextInt();
if(n==0)
{
System.out.println("composite number or not prime");
}
if(n==1)
{
Sopln("not prime number");
}
int flag=1
for(int i=2;i<n/2;i++)
{
if(n%i==0)
flag=0;
break;
}
if(flag==1)
{
Sopln("prime number");
}
}

Check Whether prime or Not
public class prime
{
static boolean isprime(int n)
{
if(n<2)
{
return false;
}
for(int i=2;i<n/2;i++)
{
if(n%i==0)
{
return false;
}
return true;
}
public class demo
{
public static void main(String[] args)
{
for(int i=0;i<=100;i++)
if(isprime(i))
{
Sopln(i);
}
}

Write next prime number
public class prime
{
psvm(--------------)
{
int n=13;
int m=n+1;
while(true)
{
int flag=1;
for(int i=2;i<m/2;i++)
{
if(n%i==0)
flag=0;
break;
}
if(flag==1)
{
Sopln(m);
break;
}
m++;
}


Range between a&b
public class prime
{
psvm(---------------------)
{
println("Enter a range");
Scanner scn=new Scanner(System.in);
int a=scn.nextInt();
int b=scn.nextInt();
for(int i=a;i<=b;i++)
{
if(i==1)
continue;
flag=1;
for(int i=2;i<i/2;i++)
{
if(n%i==0)
{
flag=0;
break;
}
}
if(flag==1)
{
Sopln(i);
}
}
Fibbonocci_Series
public class fibbonocci
{
static int fib(int n)
{
if(n==1)return 0;
if(n==2)return 1;
return fib(n-1)+fib(n-2);
}
psvm(---------------)
{
Sopln("fib(10)");
}}
Factorial_Number
public class factorial
{
static int fact(int n)
{
if(n==0||n==1)
return 0;
return n*fact(n-1);
}
psvm(-----------------------)
{
Sopln(fact(4));
}
}
Palindrome_Or_Not
public class palindrome
{
static boolean ispalindrome(string s)
{
s=s.toLowercase();
int len=s.length();
for(int i=0;i<len/2;i++)
{
if(s.charAt(i)!=s.charAt(len-1))
{
return false;
}
return true;
}
psvm(---------------------------)
{
Sopln(ispalindrome("malyalam");
}
}
String_Reverse
public class reverse
{
string s="java";
Sopln(s);
static string rev(string s)
{
string s1=" ";
for(int i=len()-1;i>0;i--)
{
s1+=s.charAt(i);
}
return s1;
}
}

 Print_1to10_without_loop
Public class print
{
public static void printwithoutloop(-------------)
{
if(n<=10)
sopln(n);
print.printwithoutloop(n+1);
}
}
psvm(-------------)
{
print.printwithoutloop(1);
}
}
Print_with_loop
public class loop
{
psvm(------------------)
{
for(int i=1;i<=10;i++)
}
} 

 Find_Occurances
Public class Findoccurances
{
psvm(----------------------------)
{
Scanner scn=new Scanner(System.in);
{
String s=scn.next();
while(s.length>0)
{
char c=s.charAt();
int n=s.length()-s.replace(" "," ").length();
Sopln(c+" "+n);
s=s.replace(c,",");
}
}
CaseSensitive

 public class caseletter
{
psvm(------------------------------)
{
string s=scn.nextInt();
char c;
String s1=" ";
for(int i=0;i<s.length;i++)
{
c=s.charAt(i);
if(c>='A' && c<='Z')
{
s1+=character.toLowercase();
}
else
{
s1+=character.touppercase();
}
}
Sopln(s1);
}
}

 Anagram
public class Anagram
{
psvm(---------------------------)
{
Scanner scn=new Scanner(System.in);
string s1=scn.next();
string s2=scn.next();
int l1,l2,flag=0;
l1=s1.length();
l2=s2.length();
if(l1==l2)
{
for(int i=0;i<=l1;i++)
{
flag=1;
for(int j=0;j<=l2;i++)
{
flag=0;
break;
}
}
if(flag==1)
{
Sopln("Anagram");
else
Sopln("Not Anagram");
}
}