Emad's

src/main/java/com/dtcc/exams/part1/BasicUtilities.java

@@ -3,19 +3,31 @@
 public class BasicUtilities {
 
     public Boolean isGreaterThan5(Integer value) {
-        return null;
+        if (value >= 5) {
+            return true;
+        } else
+            return false;
     }
 
+
     public Boolean isLessThan7(Integer value) {
-        return null;
+        if (value < 7) {
+            return true;
+        }
+        return false;
     }
 
     public Boolean isBetween5And7(Integer valueToEvaluate) {
-        return null;
+        if (valueToEvaluate >= 5 || valueToEvaluate <= 7) {
+            return true;
+        } else return false;
     }
 
     public Boolean startsWith(String string, Character character) {
-        return null;
+        String firstChar= String.valueOf(string.charAt(0));
+        if (character.toString().equalsIgnoreCase(firstChar)) {
+            return true;
+        } else
+            return false;
     }
-
 }

src/main/java/com/dtcc/exams/part1/DelTechConcatenator.java

@@ -1,20 +1,31 @@
 package com.dtcc.exams.part1;
 
 public class DelTechConcatenator {
+    Integer input;
 
     public DelTechConcatenator(Integer input) {
+        this.input=input;
     }
 
     public Boolean isDel() {
-        return null;
+        if(input%3 == 0){
+            return true;
+        }
+        return false;
     }
 
     public Boolean isTech() {
-        return null;
+        if(this.input%5 == 0){
+            return true;
+        }
+        return false;
     }
 
     public Boolean isDelTech() {
-        return null;
+        if(this.input%15 == 0){
+            return true;
+        }
+        return false;
     }
 
 }

src/main/java/com/dtcc/exams/part1/IntegerArrayUtilities.java

@@ -1,21 +1,34 @@
 package com.dtcc.exams.part1;
 
+
+import java.util.ArrayList;
+
 public class IntegerArrayUtilities {
 
     public Boolean hasEvenLength(Integer[] array) {
-        return null;
+        if(array.length %2 == 0){
+            return true;
+        }
+        return false;
     }
 
     public Integer[] range(int start, int stop) {
-        return null;
+
+        int arr = (start-stop);
+        Integer[] range = new Integer[Math.abs(arr)+1];
+        for(int i = start; i <= stop; i++){
+            range[i]= i;
+        }
+        return range;
     }
 
     public Integer getSumOfFirstTwo(Integer[] array) {
-        return null;
+
+        return (array[0] + array[1]);
     }
 
     public Integer getProductOfFirstTwo(Integer[] array) {
-        return null;
+        return (array[0] * array[1]);
     }
 
 }

src/main/java/com/dtcc/exams/part2/ArrayUtility.java

@@ -1,21 +1,56 @@
 package com.dtcc.exams.part2;
 
+import java.util.Arrays;
+import java.util.Collections;
+
 public class ArrayUtility {
 
     public Integer[] merge(Integer[] array1, Integer[] array2) {
-        return null;
+        Integer[] mergedArray = new Integer[array1.length+array2.length];
+        System.arraycopy(array1,0,mergedArray,0, array1.length);
+        System.arraycopy(array2,0,mergedArray,array1.length,array2.length);
+        return mergedArray;
     }
 
     public Integer[] rotate(Integer[] array, Integer index) {
-        return null;
+        Collections.rotate(Arrays.asList(array), -index);
+        return array;
     }
 
     public Integer countOccurrence(Integer[] array1, Integer[] array2, Integer valueToEvaluate) {
-        return null;
+       int count = 0;
+        for (Integer integer : array1) {
+            if (integer.equals(valueToEvaluate)) {
+                count++;
+            }
+        }
+        for (Integer integer : array2) {
+            if (integer.equals(valueToEvaluate)) {
+                count++;
+            }
+        }
+        return count;
     }
 
     public Integer mostCommon(Integer[] array) {
-        return null;
-    }
+        Arrays.sort(array);
+        int maxCount = 1, tempCount;
+        int most = array[0];
+        int currentArray;
 
+        for(int i = 0; i < array.length-1; i++) {
+            currentArray = array[i];
+            tempCount=0;
+            for(int j = 1; j < array.length; j++){
+                if(currentArray == array[j]){
+                    tempCount++;
+                    }
+                    if(tempCount > maxCount) {
+                        most = currentArray;
+                        maxCount = tempCount;
+                    }
+                }
+            }
+        return most;
+    }
 }

src/main/java/com/dtcc/exams/part2/ListUtility.java

@@ -1,31 +1,52 @@
 package com.dtcc.exams.part2;
 
+import org.apache.commons.lang3.StringUtils;
+import java.util.ArrayList;
 import java.util.List;
 
 public class ListUtility {
+    List<Integer> list = new ArrayList<>();
 
     public Boolean add(int i) {
-        return null;
+        return list.add(i);
     }
 
     public Integer size() {
-        return null;
+        return list.size();
     }
 
     public List<Integer> getUnique() {
-        return null;
+        list.stream().distinct();
+        return list;
     }
 
     public String join() {
-        return null;
+        return StringUtils.join(list, ", ");
     }
 
     public Integer mostCommon() {
-        return null;
+        int maxCount = 1, tempCount;
+        int most = list.get(0);
+        int currentList;
+
+        for(int i = 0; i < list.size()-1; i++) {
+            currentList = list.get(i);
+            tempCount=0;
+            for(int j = 1; j < list.size(); j++){
+                if(currentList == list.get(j)){
+                    tempCount++;
+                }
+                if(tempCount > maxCount) {
+                    most = currentList;
+                    maxCount = tempCount;
+                }
+            }
+        }
+        return most;
     }
 
     public Boolean contains(Integer valueToAdd) {
-        return null;
+        return list.contains(valueToAdd);
     }
 
 }

src/main/java/com/dtcc/exams/part3/Bird.java

@@ -1,8 +1,18 @@
 package com.dtcc.exams.part3;
 
-public class Bird {
+public abstract class Bird implements Animal{
 
     public String move() {
+        return "fly";
+    }
+
+    @Override
+    public int getSpeed() {
+        return 0;
+    }
+
+    @Override
+    public String color() {
         return null;
     }
 
@@ -14,4 +24,5 @@ public String getMigrationMonth() {
         return null;
     }
 
+    public abstract int speed();
 }

src/main/java/com/dtcc/exams/part3/Horse.java

@@ -1,4 +1,20 @@
 package com.dtcc.exams.part3;
 
-public class Horse {
+public class Horse implements Animal{
+
+    @Override
+    public String move() {
+        return "gallop";
+    }
+
+    @Override
+    public int getSpeed() {
+        return 40;
+    }
+
+    @Override
+    public String color() {
+        return "black";
+    }
 }
+

src/main/java/com/dtcc/exams/part3/PeregrineFalcon.java

@@ -1,4 +1,14 @@
 package com.dtcc.exams.part3;
 
-public class PeregrineFalcon {
+public class PeregrineFalcon extends Bird{
+
+    @Override
+    public String color(){
+        return "brown";
+    }
+
+    @Override
+    public int speed(){
+        return 13;
+    }
 }

src/main/java/com/dtcc/exams/part3/RedRobin.java

@@ -1,4 +1,23 @@
 package com.dtcc.exams.part3;
 
-public class RedRobin {
+public class RedRobin extends Bird{
+    String migrationMonth;
+
+    @Override
+    public int speed() {
+        return 10;
+    }
+    @Override
+    public String color() {
+        return "red";
+    }
+    @Override
+    public String getMigrationMonth() {
+        return migrationMonth;
+    }
+
+    @Override
+    public void setMigrationMonth(String migrationMonth) {
+        this.migrationMonth = migrationMonth;
+    }
 }

src/main/java/com/dtcc/exams/part3/SpeedComparator.java

@@ -1,4 +1,20 @@
 package com.dtcc.exams.part3;
 
-public class SpeedComparator {
+import java.util.Comparator;
+
+public class SpeedComparator implements Comparator<Animal> {
+
+    public int compare(Animal animal1, Animal animal2){
+
+        if(animal1.getSpeed() == animal2.getSpeed()){
+            return 0;
+        }
+        else if(animal1.getSpeed() > animal2.getSpeed()) {
+            return -1;
+        }
+        else
+        return 1;
+    }
+
 }
+