diff --git a/Surbhi_CheckArmstrongNum_q14.class b/Surbhi_CheckArmstrongNum_q14.class
new file mode 100644
index 0000000..6d742a9
Binary files /dev/null and b/Surbhi_CheckArmstrongNum_q14.class differ
diff --git a/Surbhi_CheckArmstrongNum_q14.java b/Surbhi_CheckArmstrongNum_q14.java
new file mode 100644
index 0000000..0b9976c
--- /dev/null
+++ b/Surbhi_CheckArmstrongNum_q14.java
@@ -0,0 +1,29 @@
+import java.util.*;
+public class Surbhi_CheckArmstrongNum_q14 {
+    public static void main(String args[]){
+        Scanner in = new Scanner(System.in);
+        System.out.print("Enter a number to check armstrong : ");
+        int num = in.nextInt();
+        int m = num;
+        int dig = 0;
+        while(m!=0)
+        {
+            m = m /10;
+            dig++;
+        }
+        m = num;
+        int sum = 0;
+        while(m!=0){
+            int r = m % 10;
+            sum += Math.pow(r,dig);
+            m = m/10;
+        }
+        if(sum == num){
+            System.out.println("Number is Armstrong.");
+        }
+        else{
+            System.out.println("Number is not Armstrong.");
+        }
+    }
+    
+}
diff --git a/Surbhi_CheckPalindromeNum.class b/Surbhi_CheckPalindromeNum.class
new file mode 100644
index 0000000..519aad9
Binary files /dev/null and b/Surbhi_CheckPalindromeNum.class differ
diff --git a/Surbhi_CheckPalindromeNum_q13.java b/Surbhi_CheckPalindromeNum_q13.java
new file mode 100644
index 0000000..1d0c834
--- /dev/null
+++ b/Surbhi_CheckPalindromeNum_q13.java
@@ -0,0 +1,21 @@
+import java.util.*;
+public class Surbhi_CheckPalindromeNum_q13 {
+    public static void main(String args[]){
+        Scanner in = new Scanner(System.in);
+        System.out.print("Enter any number to check palindrome : ");
+        int num = in.nextInt();
+        int m = num;
+        int rev = 0;
+        while(num != 0){
+            int r = num % 10;
+            rev = rev * 10 + r;
+            num = num / 10;
+        }
+        if(rev == m){
+            System.out.println("Palindrome");
+        }
+        else{
+            System.out.println("Not Palindrome");
+        }
+    }
+}
diff --git a/Surbhi_CheckPrime_q9.class b/Surbhi_CheckPrime_q9.class
new file mode 100644
index 0000000..fb9919c
Binary files /dev/null and b/Surbhi_CheckPrime_q9.class differ
diff --git a/Surbhi_CheckPrime_q9.java b/Surbhi_CheckPrime_q9.java
new file mode 100644
index 0000000..bdba40d
--- /dev/null
+++ b/Surbhi_CheckPrime_q9.java
@@ -0,0 +1,21 @@
+import java.util.*;
+public class Surbhi_CheckPrime_q9 {
+    public static void main(String args[]){
+        Scanner in = new Scanner(System.in);
+        System.out.print("Enter the number to check prime : ");
+        int num = in.nextInt();
+        int flag = 1;
+        for(int i = 2; i < num; i++){
+            if(num % i == 0){
+                flag = 0;
+                break;
+            }
+        }
+        if(flag == 1){
+            System.out.println(num + " is a Prime Number.");
+        }
+        else{
+            System.out.println(num + " is not a Prime Number.");
+        }
+    }    
+}
diff --git a/Surbhi_DigitSumOfNum_q11.class b/Surbhi_DigitSumOfNum_q11.class
new file mode 100644
index 0000000..d5282c1
Binary files /dev/null and b/Surbhi_DigitSumOfNum_q11.class differ
diff --git a/Surbhi_DigitSumOfNum_q11.java b/Surbhi_DigitSumOfNum_q11.java
new file mode 100644
index 0000000..5bc5e7a
--- /dev/null
+++ b/Surbhi_DigitSumOfNum_q11.java
@@ -0,0 +1,15 @@
+import java.util.*;
+public class Surbhi_DigitSumOfNum_q11 {
+    public static void main(String args[]){
+        Scanner in = new Scanner(System.in);
+        System.out.print("Enter any number : ");
+        int num = in.nextInt();
+        int sum = 0;
+        while(num != 0){
+            int r = num % 10;
+            sum += r;
+            num = num / 10;
+        }
+        System.out.println("Sum of digits : "+sum);
+    }
+}
diff --git a/Surbhi_EvenOrOdd_q2.java b/Surbhi_EvenOrOdd_q2.java
new file mode 100644
index 0000000..f292971
--- /dev/null
+++ b/Surbhi_EvenOrOdd_q2.java
@@ -0,0 +1,10 @@
+import java.util.*;
+public class Surbhi_EvenOrOdd_q2 {
+    public static void main(String args[]){
+        Scanner in = new Scanner(System.in);
+        System.out.print("Enter any number : ");
+        int num = in.nextInt();
+        String s = num % 2 == 0 ? "Number is Even" : "Number is Odd";
+        System.out.println(s);
+    }
+}
diff --git a/Surbhi_FindArmstrongInRange_q15.class b/Surbhi_FindArmstrongInRange_q15.class
new file mode 100644
index 0000000..f5fb308
Binary files /dev/null and b/Surbhi_FindArmstrongInRange_q15.class differ
diff --git a/Surbhi_FindArmstrongInRange_q15.java b/Surbhi_FindArmstrongInRange_q15.java
new file mode 100644
index 0000000..860c89f
--- /dev/null
+++ b/Surbhi_FindArmstrongInRange_q15.java
@@ -0,0 +1,39 @@
+import java.util.*;
+public class Surbhi_FindArmstrongInRange_q15 {
+    static int checkarmstrong(int num){
+        int m = num;
+        int dig = 0;
+        while(m!=0)
+        {
+            m = m /10;
+            dig++;
+        }
+        m = num;
+        int sum = 0;
+        while(m!=0){
+            int r = m % 10;
+            sum += Math.pow(r,dig);
+            m = m/10;
+        }
+        if(sum == num){
+            return 1;
+        }
+        else{
+            return 0;
+        }
+    }
+    public static void main(String args[]){
+        Scanner in = new Scanner(System.in);
+        System.out.print("Enter the starting of range : ");
+        int m = in.nextInt();
+        System.out.print("Enter the ending of range : ");
+        int n = in.nextInt();
+        System.out.println("Armstrong numbers are : ");
+        for(int i = m; i<=n; i++){
+            int res = checkarmstrong(i);
+            if(res == 1){
+                System.out.print(i + ", ");
+            }
+        }
+    }
+}
diff --git a/Surbhi_GreatestOfThreeNum_q7.class b/Surbhi_GreatestOfThreeNum_q7.class
new file mode 100644
index 0000000..7ce52ae
Binary files /dev/null and b/Surbhi_GreatestOfThreeNum_q7.class differ
diff --git a/Surbhi_GreatestOfThreeNum_q7.java b/Surbhi_GreatestOfThreeNum_q7.java
new file mode 100644
index 0000000..a0462c7
--- /dev/null
+++ b/Surbhi_GreatestOfThreeNum_q7.java
@@ -0,0 +1,14 @@
+import java.util.*;
+public class Surbhi_GreatestOfThreeNum_q7 {
+    public static void main(String args[])
+    {
+        Scanner in = new Scanner(System.in);
+        int a,b,c;
+        System.out.println("Enter the three numbers :");
+        a = in.nextInt();
+        b = in.nextInt();
+        c = in.nextInt();
+        int res = (a > b) ? ((a > c) ? a : c) : ((b > c) ? b : c);
+        System.out.println("Greatest number is : "+res);
+    }
+}
diff --git a/Surbhi_GreatestOfTwoNum_q6.class b/Surbhi_GreatestOfTwoNum_q6.class
new file mode 100644
index 0000000..6098e12
Binary files /dev/null and b/Surbhi_GreatestOfTwoNum_q6.class differ
diff --git a/Surbhi_GreatestOfTwoNum_q6.java b/Surbhi_GreatestOfTwoNum_q6.java
new file mode 100644
index 0000000..fa865a5
--- /dev/null
+++ b/Surbhi_GreatestOfTwoNum_q6.java
@@ -0,0 +1,13 @@
+import java.util.*;
+public class Surbhi_GreatestOfTwoNum_q6 {
+    public static void main(String args[])
+    {
+        Scanner in = new Scanner(System.in);
+        int a,b;
+        System.out.println("Enter the two numbers :");
+        a = in.nextInt();
+        b = in.nextInt();
+        int res = a > b ? a : b;
+        System.out.println("Greatest number is : "+res);
+    }
+}
diff --git a/Surbhi_LeapYear_q8.class b/Surbhi_LeapYear_q8.class
new file mode 100644
index 0000000..2553697
Binary files /dev/null and b/Surbhi_LeapYear_q8.class differ
diff --git a/Surbhi_LeapYear_q8.java b/Surbhi_LeapYear_q8.java
new file mode 100644
index 0000000..7026a9a
--- /dev/null
+++ b/Surbhi_LeapYear_q8.java
@@ -0,0 +1,14 @@
+import java.util.*;
+public class Surbhi_LeapYear_q8 {
+   public static void main(String args[]){
+    Scanner in = new Scanner(System.in);
+    System.out.println("Enter a year to check : ");
+    int y = in.nextInt();
+    if( y % 400 == 0 || (y % 4 == 0 && y % 100 != 0)){
+        System.out.println(y + "is a leap year.");
+    }
+    else{
+        System.out.println(y + " is not a leap year.");
+    }
+   } 
+}
diff --git a/Surbhi_PositiveOrNegative_q1.java b/Surbhi_PositiveOrNegative_q1.java
new file mode 100644
index 0000000..e012dc8
--- /dev/null
+++ b/Surbhi_PositiveOrNegative_q1.java
@@ -0,0 +1,17 @@
+import java.util.*;
+class Surbhi_PositiveOrNegative_q1
+{
+    public static void main(String args[]){
+        Scanner in = new Scanner(System.in);
+        int num;
+        System.out.print("Enter the number:");
+        num = in.nextInt();
+        if(num == 0){
+            System.out.println("Number is Zero");
+        }
+        else {
+            String res = num < 0 ? "Number is Negative" : "Number is positive";
+            System.out.println(res);
+        }
+    }
+}
\ No newline at end of file
diff --git a/Surbhi_PrimeInRange_q10.class b/Surbhi_PrimeInRange_q10.class
new file mode 100644
index 0000000..a380b06
Binary files /dev/null and b/Surbhi_PrimeInRange_q10.class differ
diff --git a/Surbhi_PrimeInRange_q10.java b/Surbhi_PrimeInRange_q10.java
new file mode 100644
index 0000000..7f3e027
--- /dev/null
+++ b/Surbhi_PrimeInRange_q10.java
@@ -0,0 +1,24 @@
+import java.util.*;
+public class Surbhi_PrimeInRange_q10 {
+    static int CheckPrime(int num){
+        for(int i = 2; i < num; i++){
+            if(num % i == 0){
+                return 0;
+            }
+        }
+        return 1;
+    }
+    public static void main(String args[]){
+        Scanner in = new Scanner(System.in);
+        System.out.print("Enter the start of range : ");
+        int start = in.nextInt();
+        System.out.print("Enter the end of range : ");
+        int end = in.nextInt();
+        System.out.println("Prime Numbers in the range from "+start+ " to "+end);
+        for(int i = start; i <= end; i++){
+            if (CheckPrime(i) == 1){
+                System.out.print(i+", ");
+            }
+        }
+    }
+}
diff --git a/Surbhi_ReverseOfNum_q12.class b/Surbhi_ReverseOfNum_q12.class
new file mode 100644
index 0000000..bf62cfb
Binary files /dev/null and b/Surbhi_ReverseOfNum_q12.class differ
diff --git a/Surbhi_ReverseOfNum_q12.java b/Surbhi_ReverseOfNum_q12.java
new file mode 100644
index 0000000..bb8dfc2
--- /dev/null
+++ b/Surbhi_ReverseOfNum_q12.java
@@ -0,0 +1,15 @@
+import java.util.*;
+public class Surbhi_ReverseOfNum_q12 {
+    public static void main(String args[]){
+        Scanner in = new Scanner(System.in);
+        System.out.print("Enter any number : ");
+        int num = in.nextInt();
+        int rev = 0;
+        while(num != 0){
+            int r = num % 10;
+            rev = rev * 10 + r;
+            num = num / 10;
+        }
+        System.out.println("Reverse : "+rev);
+    }
+}
diff --git a/Surbhi_SumOfNaturalNumbers_q3.java b/Surbhi_SumOfNaturalNumbers_q3.java
new file mode 100644
index 0000000..08f746b
--- /dev/null
+++ b/Surbhi_SumOfNaturalNumbers_q3.java
@@ -0,0 +1,13 @@
+import java.util.*;
+public class Surbhi_SumOfNaturalNumbers_q3 {
+    public static void main(String args[]){
+        Scanner in = new Scanner(System.in);
+        System.out.print("Enter the range : ");
+        int n = in.nextInt();
+        int sum = 0;
+        for(int i = 1; i <= n; i++){
+            sum += i;
+        }
+        System.out.println("Sum of first " + n + " natural numbers = "+ sum);
+    }
+}
diff --git a/Surbhi_SumOfNumInRange_q5.class b/Surbhi_SumOfNumInRange_q5.class
new file mode 100644
index 0000000..e875b6c
Binary files /dev/null and b/Surbhi_SumOfNumInRange_q5.class differ
diff --git a/Surbhi_SumOfNumInRange_q5.java b/Surbhi_SumOfNumInRange_q5.java
new file mode 100644
index 0000000..9ed974e
--- /dev/null
+++ b/Surbhi_SumOfNumInRange_q5.java
@@ -0,0 +1,16 @@
+import java.util.*;
+public class Surbhi_SumOfNumInRange_q5 {
+    public static void main(String args[]){
+        Scanner in = new Scanner(System.in);
+        int num1, num2,sum = 0;
+        System.out.println("Enter the starting number : ");
+        num1 = in.nextInt();
+        System.out.println("Enter the ending number : ");
+        num2 = in.nextInt();
+        for(int i = num1; i <= num2; i++){
+            sum += i;
+        }
+        System.out.println("Sum: "+sum);
+    }
+    
+}