Function

Duration 3 day's
17/09/2023 - 19/09/2023

Author: SaurabhKumarDev

Function Method/Assignment.java

@@ -0,0 +1,34 @@
+public class Assignment {
+    public static float average(int a, int b, int c) {
+        float avg = (a+b+c)/3;
+        return avg;
+    }
+    public static boolean isEven(int n) {
+        return (n%2 == 0)? true : false;
+    }
+    public static boolean  palindrome(int n) {
+        int reverse = 0, num = n;
+        while (num>0) {
+            int rem = num%10;
+            reverse = (reverse * 10) + rem;
+            num /= 10;
+        }
+        return (n == reverse)? true : false;
+    }
+    public static void method() {
+        int a = 8, b = 9;
+        double d = 45;                              // toRadians need double type of dataType
+        System.out.println("Minimum : "+Math.min(a,b));
+        System.out.println("Maximum : "+Math.max(a,b));
+        System.out.println("Square root : "+Math.sqrt(a));
+        System.out.println("Power : "+Math.pow(a,b));       //a^b
+        System.out.println("Absolute : "+Math.abs(8.9));
+        double c = Math.toRadians(d);               // Used to convert an angle measured in degrees
+        System.out.println("Sin : "+Math.sin(c));   // Trignometric table
+        System.out.println("Tan : "+Math.tan(c));
+    }
+    public static int SumOfDigit(int n) {
+        if (n == 1) { return 1; }
+        return n + SumOfDigit(n-1);
+    }
+}

Function Method/BinaryToDecimal.java

@@ -0,0 +1,15 @@
+public class BinaryToDecimal {
+    public static void main(String[] args) {
+
+        int binary = 10001000;
+
+        int count = -1, result = 0;
+        while (binary > 0) {
+            count++;
+            int rem = binary%10;
+            result = result + (rem) * ((int) Math.pow(2, count));
+            binary /= 10;
+        }
+        System.out.print(result);
+    }
+}

Function Method/BinomialCofficient.java

@@ -0,0 +1,23 @@
+public class BinomialCofficient {
+    /*
+    * Bionomial Cofficient
+    * C(n,r) = n! / (r! * (n-r)!)
+    */
+
+    static int factorial(int n) {
+        if (n == 0) { return 1; }
+        return n * factorial(n-1);
+    }
+
+    public static int bionomial(int n, int r) {
+        int n_fact = factorial(n);
+        int r_fact = factorial(r);
+        int nr_fact = factorial(n-r);
+
+        return n_fact / (r_fact * nr_fact);
+    }
+
+    public static void main(String[] args) {
+        System.out.print(bionomial(5, 2));
+    }
+}

Function Method/CallByValue.java

@@ -0,0 +1,26 @@
+public class CallByValue {
+    // In call by value method, the value of the actual parameters is copied into the formal parameters.
+
+    // Example :- Swap
+
+    // Copied the actual parameter value only
+    // Doing their job within the function
+    // No Changed in actual parameter after execution of this function
+    // This is a Call By Value
+    public static void Swap (int a, int b) {
+        int temp = a;
+        a = b;
+        b = temp;
+        System.out.println("value of A : "+a);
+        System.out.println("Value of B : "+b);
+    }
+
+    public static void main(String[] args) {
+        // Actual Parameter Value of A and B
+        int a = 5, b = 10;
+
+        Swap(a,b);
+        System.out.println("Value of A after function : "+a);
+        System.out.print("Value of B after function : "+b);
+    }
+}

Function Method/DecimalToBinary.java

@@ -0,0 +1,14 @@
+public class DecimalToBinary {
+    public static void main(String[] args) {
+        int number = 7;
+        int result = 0, count = 0;
+
+        while (number > 0) {
+            int rem = number%2;
+            result = result + (rem * ((int) Math.pow(10, count)));
+            count++;
+            number /= 2;
+        }
+        System.out.print(result);
+    }
+}

Function Method/Factorial.java

@@ -0,0 +1,15 @@
+public class Factorial {
+    // 5! = 5*4*3*2*1
+    public static int factorial(int n) {
+        if (n == 0) {
+            return 1;
+        }
+
+        // Here, I used Recursion for multiple the value of n with n-1
+        return n * factorial(n-1);
+    }
+
+    public static void main(String[] args) {
+        System.out.print(factorial(5));
+    }
+}

Function Method/Overloading.java

@@ -0,0 +1,24 @@
+public class Overloading {
+    /* Function Overloading */
+
+    // Same returnType and functionName, Different 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;
+    }
+
+    // Different returnType and parameter, Same functionName
+    public static float sum(float a, float b) {
+        return a+b;
+    }
+
+    /*
+    Different returnType, Same functionName and paramter
+        public static long sum(int a, int b) {
+            return a+b;
+        }
+    */
+
+}

Function Method/Prime.java

@@ -0,0 +1,54 @@
+public class Prime {
+
+    // Check if number is prime or not
+    public static boolean isPrime(int n) {
+        if (n == 1) {
+            return false;
+        } else if (n == 2){
+            return true;
+        }
+        for (int i = 2; i < n; i++) {
+            if (n % i == 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+
+
+    // Optimized way to find prime
+    public static Boolean Prime(int n) {
+        if (n == 1) {
+            return false;
+        } else if (n == 2){
+            return true;
+        }
+
+        // Math.sqrt(n) = UnderRoot N; UnderRoot N * UnderRoot N = N So half it to minimize the complexity
+        // 1*6
+        // 2*3
+        // 3*2
+        // 6*1
+
+        for (int i=2; i<(n/2); i++) {
+            if (n%i == 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+
+
+    // Print all Prime number
+    public static void printPrime(int first, int last) {
+        for (int n=first; n<=last; n++) {
+            if(isPrime(n) == true) {
+                System.out.print(n+"  ");
+            }
+        }
+    }
+
+    public static void main(String[] args) {
+        printPrime(1,20);
+    }
+}

Function Method/ProductOfa_b.java

@@ -0,0 +1,18 @@
+public class ProductOfa_b {
+
+    // Created function
+    //  Name = product
+    //  Parameter = a and b = Formal Parameter
+    //  Return type = int
+    public static int product (int a, int b) {
+        return a*b;
+    }
+
+    public static void main(String[] args) {
+        int a = 5, b = 10;
+
+        // product function called in main function for use
+        // Passes the argument or actual parameter
+        System.out.print("Product : "+product(a, b));
+    }
+}