diff --git a/Factorial.java b/Factorial.java
new file mode 100644
index 000000000..2c76d111b
--- /dev/null
+++ b/Factorial.java
@@ -0,0 +1,22 @@
+import java.util.*;
+
+public class Factorial {
+    public static void calculateFactorial(int n) {
+        if (n < 0) {
+            System.out.println("Invalid Number");
+            return;
+        }
+        int factorial = 1;
+        for (int i = n; i >= 1; i--) {
+            factorial = factorial * i;
+        }
+        System.out.println(factorial);
+        return;
+    }
+
+    public static void main(String args[]) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        calculateFactorial(n);
+    }
+}
\ No newline at end of file
diff --git a/FactorialByRecursion.java b/FactorialByRecursion.java
new file mode 100644
index 000000000..744edb396
--- /dev/null
+++ b/FactorialByRecursion.java
@@ -0,0 +1,15 @@
+public class FactorialByRecursion {
+    public static int calcfactorial(int n) {
+        if (n == 1 || n == 0) {
+            return 1;
+        }
+        int fact_nm1 = calcfactorial(n-1);
+        int fact_n = n * fact_nm1;
+        return fact_n;
+    }
+    public static void main(String args[]) {
+        int n = 5;
+        int ans = calcfactorial(n);
+        System.out.println(ans);
+    }
+}
diff --git a/Fibonacci.java b/Fibonacci.java
new file mode 100644
index 000000000..0a4b71960
--- /dev/null
+++ b/Fibonacci.java
@@ -0,0 +1,29 @@
+import java.util.*;
+
+public class Fibonacci {
+    public static int printFibonacci(int n) {
+        if (n == 0) {
+            return 0;
+        } else if (n == 1) {
+            return 1;
+        } else {
+            int a = 0, b = 1, result = 0;
+            for (int i = 2; i <= n; i++) {
+                result = a + b;
+                a = b;
+                b = result;
+            }
+            return result;
+        }
+    }
+    public static void main(String args[]) {
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter the number of terms in the fibonacci series : ");
+        int n = sc.nextInt();
+        System.out.println("Fibonacci series up to " + n + " terms : ");
+        for (int i = 0; i <n; i++) {
+            System.out.print(printFibonacci(i) + " ");
+        }
+        sc.close();
+    }
+}
\ No newline at end of file
diff --git a/FibonacciByRecursion.java b/FibonacciByRecursion.java
new file mode 100644
index 000000000..a5847d3ed
--- /dev/null
+++ b/FibonacciByRecursion.java
@@ -0,0 +1,17 @@
+public class FibonacciByRecursion {
+    public static void printFib(int a, int b, int n) {
+        if (n == 0) {
+            return;
+        }
+        int c = a + b;
+        System.out.println(c);
+        printFib(b, c, n - 1);
+    }
+    public static void main(String args[]) {
+        int a = 0, b = 1;
+        System.out.println(a);
+        System.out.println(b);
+        int n = 7;
+        printFib(a, b, n - 2);
+    }
+}