diff --git a/OOP/Java/Lab/Week3/Armstrong.java b/OOP/Java/Lab/Week3/Armstrong.java
new file mode 100644
index 0000000..0354ca9
--- /dev/null
+++ b/OOP/Java/Lab/Week3/Armstrong.java
@@ -0,0 +1,28 @@
+import java.util.Scanner;
+
+class Armstrong{
+    public static void main(String args[]){
+        Scanner sc = new Scanner(System.in);
+
+        int a,b,digit;
+        int digisum=0;
+
+        System.out.println("Enter the number you went to check for Armstrong-ness:");
+        a = sc.nextInt();
+
+        b = a;
+
+        while(b!=0){
+            digit = b%10;
+            digisum += (digit*digit*digit);
+            b /= 10;
+        }
+
+        if(digisum == a){
+            System.out.println("The number is an armstrong number.");
+        }else{
+            System.out.println("The number is not an armstrong number.");
+        }
+
+    }
+}
\ No newline at end of file
diff --git a/OOP/Java/Lab/Week3/ArraySearch.java b/OOP/Java/Lab/Week3/ArraySearch.java
new file mode 100644
index 0000000..9b57821
--- /dev/null
+++ b/OOP/Java/Lab/Week3/ArraySearch.java
@@ -0,0 +1,23 @@
+import java.util.Scanner;
+public class ArraySearch {
+    public static void main(String args[]){
+        Scanner sc = new Scanner(System.in);
+        int flag=0;
+
+        int[] array = {1,2,3,1,5,6,1,8,9};
+
+        System.out.println("Enter the search value:");
+        int b = sc.nextInt();
+
+        System.out.println("The value is found at the locations: ");
+        for(int i=0;i<9;i++){
+            if(array[i] == b){
+                System.out.print(" a["+i+"]");
+                flag++;
+            }
+        }
+        if(flag==0){
+            System.out.print("None. The input value does not exist in the array.");
+        }
+    }
+}
diff --git a/OOP/Java/Lab/Week3/LadderFor.java b/OOP/Java/Lab/Week3/LadderFor.java
new file mode 100644
index 0000000..74be932
--- /dev/null
+++ b/OOP/Java/Lab/Week3/LadderFor.java
@@ -0,0 +1,11 @@
+public class LadderFor {
+    public static void main(String args[]){
+        for(int i = 1; i<=5 ; i++){
+            for (int j = 0; j<i; j++){
+                System.out.print(i+" ");
+            }
+            System.out.println("");
+        }
+    }
+    
+}
diff --git a/OOP/Java/Lab/Week3/LadderForEach.java b/OOP/Java/Lab/Week3/LadderForEach.java
new file mode 100644
index 0000000..3412d23
--- /dev/null
+++ b/OOP/Java/Lab/Week3/LadderForEach.java
@@ -0,0 +1,14 @@
+public class LadderForEach {
+    public static void main(String args[]){
+        int[] array = {1,2,3,4,5};
+
+        for(int i: array){
+            for (int j = 0; j<i; j++){
+                System.out.print(i+" ");
+            }
+            System.out.println("");
+        }
+
+    }
+    
+}
diff --git a/OOP/Java/Lab/Week3/PrimeGen.java b/OOP/Java/Lab/Week3/PrimeGen.java
new file mode 100644
index 0000000..4e752df
--- /dev/null
+++ b/OOP/Java/Lab/Week3/PrimeGen.java
@@ -0,0 +1,27 @@
+import java.util.Scanner;
+
+public class PrimeGen {
+    public static void main(String args[]){
+        Scanner sc = new Scanner(System.in);
+
+        System.out.println("Enter the numbers you want as the lower and upper limits of the prime number generator: ");
+        int n = sc.nextInt();
+        int m = sc.nextInt();
+
+        System.out.println("The Prime Numbers between " + n + " & " + m + " are:");
+
+        for(int i = n; i<=m; i++){
+            int flag = 0;
+            for(int j = 2; j<i; j++){
+                if((i%j)==0){
+                    flag++;
+                }
+            }
+
+            if(flag == 0){
+                System.out.print(i+" ");
+            }
+
+        }
+    }
+}