diff --git a/Assignment-3/javaparser-1.0.0/Test.java b/Assignment-3/javaparser-1.0.0/Test_0.java
similarity index 93%
rename from Assignment-3/javaparser-1.0.0/Test.java
rename to Assignment-3/javaparser-1.0.0/Test_0.java
index 92c3fd6..29157d9 100644
--- a/Assignment-3/javaparser-1.0.0/Test.java
+++ b/Assignment-3/javaparser-1.0.0/Test_0.java
@@ -1,4 +1,4 @@
-public class Test {
+public class Test_0 {
     public int methodForLoop() {
         int val = 1;
 
@@ -18,4 +18,4 @@ public class Test {
 
 
 
-}
\ No newline at end of file
+}
diff --git a/Assignment-3/javaparser-1.0.0/Test_1.java b/Assignment-3/javaparser-1.0.0/Test_1.java
new file mode 100644
index 0000000..9e12ce8
--- /dev/null
+++ b/Assignment-3/javaparser-1.0.0/Test_1.java
@@ -0,0 +1,28 @@
+public class test_1{
+  public int calculate(int x){
+    switch(x){
+      case 1: x += 10;
+      break;
+      case 2: x *= 2:
+      break;
+      default: x = -1;
+    }
+    try{
+      x = riskyOp(x);
+    } catch (Exception e){
+      x = 0;
+    }
+    return finalValue(x);
+  }
+  private int riskyOp(int input) Exception {
+    if (input < 0){
+      throw new Exception("Negative input");
+    }
+    return input + 5;
+  }
+  private int finalValue(int val){
+    return val*2;
+  }
+
+int result = this.calculate(2);
+}
diff --git a/Assignment-3/javaparser-1.0.0/Test_2.java b/Assignment-3/javaparser-1.0.0/Test_2.java
new file mode 100644
index 0000000..6e194d2
--- /dev/null
+++ b/Assignment-3/javaparser-1.0.0/Test_2.java
@@ -0,0 +1,12 @@
+public class Test_2{
+  public int factorial(int n){
+    if(n < 0){
+      reutrn -1;
+    }
+    if (n == 0|| n==1){
+      return 1;
+    }
+    return n * factorial(n-1);
+  }
+  int result = this.factorial(5);
+}
diff --git a/Assignment-3/javaparser-1.0.0/Test_3.java b/Assignment-3/javaparser-1.0.0/Test_3.java
new file mode 100644
index 0000000..8304e7e
--- /dev/null
+++ b/Assignment-3/javaparser-1.0.0/Test_3.java
@@ -0,0 +1,17 @@
+public class Test_3{
+  public int search(int [][] matrix, int to_search){
+    for(int i = 0; i < matrix.lenght; i++){
+      for(int j = 0; j < matrix[i].legth; j++) {
+        if (matrix[i][j] == to_search){
+          return true;
+        }
+      }
+    }
+    return false;
+
+    boolean result = this.contains(new int[][] {
+      {1,2,3},
+      {22,42,45},
+      {38,26,16}}, 42);
+  }
+