Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
15 changes: 11 additions & 4 deletions src/main/java/com/dtcc/exams/part1/BasicUtilities.java
Original file line number Diff line number Diff line change
Expand Up @@ -3,19 +3,26 @@
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;}
else {return false;}
}

public Boolean isBetween5And7(Integer valueToEvaluate) {
return null;
if(valueToEvaluate<=7 && valueToEvaluate>=5){return true;}
else {return false;}
}

//is this extra method?
public Boolean startsWith(String string, Character character) {
return null;
String strCheck=string.charAt(0)+"";
String strChar=character+"";
if(strCheck.equalsIgnoreCase(strChar)){return true;}
else{return false;}
}

}
15 changes: 11 additions & 4 deletions src/main/java/com/dtcc/exams/part1/DelTechConcatenator.java
Original file line number Diff line number Diff line change
@@ -1,20 +1,27 @@
package com.dtcc.exams.part1;

public class DelTechConcatenator {

Integer input;
public DelTechConcatenator(Integer input) {
this.input=input;
}

public Boolean isDel() {
return null;
if(this.input %3 ==0){return true;}
else {return false;}
// return (this.input%3==0);
}

public Boolean isTech() {
return null;
if(this.input % 5 ==0){return true;}
else {return false;}
// return (this.input%5==0);
}

public Boolean isDelTech() {
return null;
if(this.input % 3 == 0 && this.input % 5 == 0){return true;}
else {return false;}
// return (this.input%3==0 || this.input%5==0);
}

}
21 changes: 17 additions & 4 deletions src/main/java/com/dtcc/exams/part1/IntegerArrayUtilities.java
Original file line number Diff line number Diff line change
@@ -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;}
else {return false;}
}

public Integer[] range(int start, int stop) {
return null;
ArrayList<Integer> numArrayList=new ArrayList<>();
for(int i=start;i<=stop;i++){
numArrayList.add(i);
}
Integer[] numArray=new Integer[numArrayList.size()];
for(int i=0;i<numArray.length;i++){
numArray[i]=(Integer)numArrayList.get(i);
}
return numArray;
}

public Integer getSumOfFirstTwo(Integer[] array) {
return null;
Integer sum=array[0]+array[1];
return sum;
}

public Integer getProductOfFirstTwo(Integer[] array) {
return null;
return array[array.length-2]*array[array.length-1];
//return array[0]*array[1];
}

}
59 changes: 54 additions & 5 deletions src/main/java/com/dtcc/exams/part2/ArrayUtility.java
Original file line number Diff line number Diff line change
@@ -1,21 +1,70 @@
package com.dtcc.exams.part2;

import java.util.ArrayList;
import java.util.Arrays;

public class ArrayUtility {

public Integer[] merge(Integer[] array1, Integer[] array2) {
return null;
int totalArrayLength = array1.length + array2.length;
Integer totalArray[]=new Integer[totalArrayLength];
//copy array1 to totalArray
System.arraycopy(array1,0,totalArray,0,array1.length);
//copy array2 to totalArray from length (array1.length)
System.arraycopy(array2,0,totalArray,array1.length,array2.length);

System.out.printf("Array: "+totalArray.toString());
return totalArray;
}

public Integer[] rotate(Integer[] array, Integer index) {
return null;
Integer[] rotatedArray=new Integer[array.length];
Integer[] numArrayRemove=new Integer[index];
Integer[] numArryAdd=new Integer[array.length-index];

for(int i=0;i<index;i++){ //first index-number elements.
numArrayRemove[i]=array[i];
}

for(int i=index,j=0;i<array.length;i++,j++){ //remaining elements after index number elements.
numArryAdd[j]=array[i];
}
System.arraycopy(numArryAdd,0,rotatedArray,0,numArryAdd.length);
System.arraycopy(numArrayRemove,0,rotatedArray,numArryAdd.length,numArrayRemove.length);
return rotatedArray;
}

public Integer countOccurrence(Integer[] array1, Integer[] array2, Integer valueToEvaluate) {
return null;
Integer count=0;
for(int i=0;i<array1.length;i++){
if(array1[i]==valueToEvaluate){count++;}
}
for(int i=0;i<array2.length;i++){
if(array2[i]==valueToEvaluate){count++;}
}
return count;
}

public Integer mostCommon(Integer[] array) {
return null;
}
Arrays.sort(array);
int mostCommonNumber=array[0];
int countOccurence=1;
int maxCount=1;

for(int i=1;i<array.length-1;i++){
if(array[i]==array[i+1]){
countOccurence++;
mostCommonNumber=array[i-1];
}
else{
if(countOccurence>maxCount){
mostCommonNumber=array[i-1];
maxCount=countOccurence;
countOccurence=1;

}
}
}
return mostCommonNumber;
}
}
71 changes: 63 additions & 8 deletions src/main/java/com/dtcc/exams/part2/ListUtility.java
Original file line number Diff line number Diff line change
@@ -1,31 +1,86 @@
package com.dtcc.exams.part2;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;

public class ListUtility {

private List<Integer> list=new ArrayList<Integer>();

public Boolean add(int i) {
return null;
/* Integer num=i;

if(num==null){
return false;
}
else {
this.list.add(i);
if(list.contains(i)){
return true;
}
return false;
}*/
return list.add(i);
}

public Integer size() {
return null;
return list.size();
}

public List<Integer> getUnique() {
return null;
List<Integer> newList=new ArrayList<Integer>();
for(int i=0;i< list.size();i++){
if(!newList.contains(list.get(i))){ //if newList does not contain the element then add.
newList.add(list.get(i));
}

}
return newList;
}

public String join() {
return null;
String strJoin="";
for(int i=0;i< list.size();i++){
strJoin += list.get(i);
if(i<=list.size()-2) {strJoin += ", "; }
}
System.out.println(strJoin);
return strJoin;
}

public Integer mostCommon() {
return null;
}
Collections.sort(this.list);
for(Integer i:list) System.out.println(i);
//to sort the list.
int mostCommonNumber=list.get(0);
int countOccurence=1;
int maxCount=1;

public Boolean contains(Integer valueToAdd) {
return null;
for(int i=1;i<list.size()-1;i++) {
if(list.get(i).equals(list.get(i+1))) {
countOccurence++;
mostCommonNumber = list.get(i - 1);
}
else{
if(countOccurence>maxCount){
mostCommonNumber=list.get(i-1);
maxCount=countOccurence;
countOccurence=1;

}
}
}
return mostCommonNumber;
}

public Boolean contains(Integer valueToAdd) {
// if(valueToAdd==null){return false;}
// else{
if (this.list.contains(valueToAdd)) {
return true;
} else { return false; }
// }
}
}
42 changes: 40 additions & 2 deletions src/main/java/com/dtcc/exams/part2/Router.java
Original file line number Diff line number Diff line change
@@ -1,22 +1,60 @@
package com.dtcc.exams.part2;

import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;

public class Router {

Map<String,String> map=new HashMap<>();

public void add(String path, String controller) {
map.put(path,controller);
}

public Integer size() {
return null;
return this.map.size();
}

public String getController(String path) {
return null;
String value=null;
for(Map.Entry m:this.map.entrySet()){ //this is how you traverse through the map.(Set)
if(m.getKey().equals(path)){
value= (String) m.getValue();
}
}
return value;
}

public void update(String path, String studentController) {
for(Map.Entry m:this.map.entrySet()) {
if (m.getKey().equals(path)) {
m.setValue(studentController);
}
}
}

public void remove(String path) {
for(Map.Entry m:this.map.entrySet()) {
if (m.getKey().equals(path)) {
map.remove(path);
}
}
}
public String toString()
{
System.out.println("in to string method.");
// Iterator hmIterator=map.entrySet().iterator(); //getting an iterator
// while(hmIterator.hasNext()){
// Map.Entry mapElement=(Map.Entry)hmIterator.next();
// System.out.println(mapElement.getKey() + " -> " + mapElement.getValue());}

String strReturn="";
for(Map.Entry m:this.map.entrySet()) {
String key = (String)m.getKey();
String value=(String)m.getValue();
strReturn+=(key+" -> " + value+"\n");
}
return strReturn;
}
}
5 changes: 2 additions & 3 deletions src/main/java/com/dtcc/exams/part3/Bird.java
Original file line number Diff line number Diff line change
@@ -1,15 +1,14 @@
package com.dtcc.exams.part3;

public class Bird {
public abstract class Bird implements Animal{

public String move() {
return null;
return "fly";
}

public void setMigrationMonth(String expected) {

}

public String getMigrationMonth() {
return null;
}
Expand Down
16 changes: 15 additions & 1 deletion src/main/java/com/dtcc/exams/part3/Horse.java
Original file line number Diff line number Diff line change
@@ -1,4 +1,18 @@
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";
}
}
11 changes: 10 additions & 1 deletion src/main/java/com/dtcc/exams/part3/PeregrineFalcon.java
Original file line number Diff line number Diff line change
@@ -1,4 +1,13 @@
package com.dtcc.exams.part3;

public class PeregrineFalcon {
public class PeregrineFalcon extends Bird {
@Override
public int getSpeed() {
return 13;
}

@Override
public String color() {
return "brown";
}
}
Loading