Today's 5 Questions 🎯

Today's 5 Questions 🎯

public class Daily_rev {
public static int factorial(int n){
int fact=1;
for(int i=1; i<=n; i++){
fact = fact*i;

}
return fact;
}
public static int BinomialCoff(int n, int r){
int nfact= factorial(n);
int rfact = factorial(r);
int nmr = factorial(n-r);
int result = nfact/(rfact*nmr);
return result;
}
public static void main(String[] args) {
System.out.println(BinomialCoff(5, 2));
}

}



//QES01: To find Binomial coff

public static boolean isPrime(int number){
if(number==2){
return true;
}
for(int i=2; i<=Math.sqrt(number); i++){
if(number%i==0){
return false;
}
}
return true;
}
public static void PrimeinRange(int n){
for(int i=2; i<=n; i++){
if(isPrime(i)){
System.out.println(i+" ");
}
}
}
public static void main(String[] args) {
PrimeinRange(20);
}

QES2: Print the prime number in range of 20

public static boolean isPrime(int number){
if(number==2){
return true;
}
for(int i=2; i<=Math.sqrt(number); i++){
if(number%i==0){
return false;
}
}
return true;

}
public static void main(String[] args) {
System.out.println(isPrime(6));
}

Print the number is prime or not
Note: This is optimize soln.

function overloading with parameter
public static int sum(int a, int b){
return a+b;
}
public static int sum(int a, int b, int c){
return a+b+c;
}
public static void main(String args[]){
int a=5;
int b=10;
int c=15;
int ans = sum(a, b);
int result=sum(a, b, c);
System.out.println(ans);
System.out.println(result);
}