diff --git a/AaronKhoo_Lab2.zip b/AaronKhoo_Lab2.zip
new file mode 100644
index 0000000..28f08b0
Binary files /dev/null and b/AaronKhoo_Lab2.zip differ
diff --git a/BankersAlgorithmLab/StarterCode_Java/Banker.java b/BankersAlgorithmLab/StarterCode_Java/Banker.java
new file mode 100644
index 0000000..50ff7f0
--- /dev/null
+++ b/BankersAlgorithmLab/StarterCode_Java/Banker.java
@@ -0,0 +1,318 @@
+import java.io.BufferedReader;
+import java.io.FileReader;
+import java.io.IOException;
+import java.lang.reflect.Array;
+import java.util.Arrays;
+
+public class Banker {
+	private int numberOfCustomers;	// the number of customers
+	private int numberOfResources;	// the number of resources
+
+	private int[] available; 	// the available amount of each resource
+	private int[][] maximum; 	// the maximum demand of each customer
+	private int[][] allocation;	// the amount currently allocated
+	private int[][] need;		// the remaining needs of each customer
+
+	/**
+	 * Constructor for the Banker class.
+	 * @param resources          An array of the available count for each resource.
+	 * @param numberOfCustomers  The number of customers.
+	 */
+	public Banker (int[] resources, int numberOfCustomers) {
+		// TODO: set the number of resources
+		this.numberOfResources = resources.length;
+
+        // set the number of customers
+        this.numberOfCustomers = numberOfCustomers;
+
+        // set the value of bank resources to available
+        this.available = Arrays.copyOf(resources, resources.length);
+
+        // set the array size for maximum, allocation, and need
+        this.maximum = new int[this.numberOfCustomers][this.numberOfResources];
+        this.allocation = new int[this.numberOfCustomers][this.numberOfResources];
+        this.need = new int[this.numberOfCustomers][this.numberOfResources];
+	}
+
+	/**
+	 * Sets the maximum number of demand of each resource for a customer.
+	 * @param customerIndex  The customer's index (0-indexed).
+	 * @param maximumDemand  An array of the maximum demanded count for each resource.
+	 */
+	public void setMaximumDemand(int customerIndex, int[] maximumDemand) {
+		// TODO: add customer, update maximum and need
+		// System.out.println(Arrays.toString(maximumDemand));
+		// System.out.println(Arrays.toString(available));
+		maximum[customerIndex] = Arrays.copyOf(maximumDemand, maximumDemand.length);
+        need[customerIndex] = Arrays.copyOf(maximumDemand, maximumDemand.length);
+	}
+
+	/**
+	 * Prints the current state of the bank.
+	 */
+	public void printState() {
+        System.out.println("\nCurrent state:");
+        // print available
+        System.out.println("Available:");
+        System.out.println(Arrays.toString(available));
+        System.out.println("");
+
+        // print maximum
+        System.out.println("Maximum:");
+        for (int[] aMaximum : maximum) {
+            System.out.println(Arrays.toString(aMaximum));
+        }
+        System.out.println("");
+        // print allocation
+        System.out.println("Allocation:");
+        for (int[] anAllocation : allocation) {
+            System.out.println(Arrays.toString(anAllocation));
+        }
+        System.out.println("");
+        // print need
+        System.out.println("Need:");
+        for (int[] aNeed : need) {
+            System.out.println(Arrays.toString(aNeed));
+        }
+        System.out.println("");
+	}
+
+	/**
+	 * Requests resources for a customer loan.
+	 * If the request leave the bank in a safe state, it is carried out.
+	 * @param customerIndex  The customer's index (0-indexed).
+	 * @param request        An array of the requested count for each resource.
+	 * @return true if the requested resources can be loaned, else false.
+	 */
+	public synchronized boolean requestResources(int customerIndex, int[] request) {
+		// TODO: print the request
+		System.out.printf("Customer %d requesting\n",customerIndex);
+        System.out.println(Arrays.toString(request));
+
+		// TODO: check if request larger than need
+		for (int i=0; i<numberOfResources;i++) {
+			if (request[i]>need[customerIndex][i]) {
+				// System.out.println("Request not valid");
+				return false;
+			}
+		}
+		
+
+		// TODO: check if request larger than available
+		for (int i=0; i<numberOfResources;i++) {
+			if (request[i]>available[i]) {
+				// System.out.println("Resources not available");
+				return false;
+			}
+		}
+
+		// TODO: check if the state is safe or not
+		if (!checkSafe(customerIndex, request)) {
+			// System.out.println("State not safe");
+			return false;
+		}
+
+
+		// TODO: if it is safe, allocate the resources to customer customerIndex
+		for (int i = 0; i < request.length; i++) {
+			available[i]-=request[i];
+			need[customerIndex][i]-=request[i];
+			allocation[customerIndex][i]+=request[i];
+		}
+
+		// System.out.printf("Available - %a",Arrays.toString(available));
+
+		return true;
+	}
+
+	/**
+	 * Releases resources borrowed by a customer. Assume release is valid for simplicity.
+	 * @param customerIndex  The customer's index (0-indexed).
+	 * @param release        An array of the release count for each resource.
+	 */
+	public synchronized void releaseResources(int customerIndex, int[] release) {
+		// TODO: print the release
+		System.out.printf("Customer %d releasing\n",customerIndex);
+		System.out.println(Arrays.toString(release));
+		
+		// TODO: release the resources from customer customerIndex
+		for (int i = 0; i < release.length; i++) {
+			available[i]+=release[i];
+			need[customerIndex][i]+=release[i];
+			allocation[customerIndex][i]-=release[i];
+		}
+
+	}
+
+	/**
+	 * Checks if the request will leave the bank in a safe state.
+	 * @param customerIndex  The customer's index (0-indexed).
+	 * @param request        An array of the requested count for each resource.
+	 * @return true if the requested resources will leave the bank in a
+	 *         safe state, else false
+	 */
+	private synchronized boolean checkSafe(int customerIndex, int[] request) {
+		// TODO: check if the state is safe
+
+		// temp_avail = available - request;
+		int[] temp_avail = new int[numberOfResources];
+		for (int i = 0; i < numberOfResources; i++) temp_avail[i]=available[i]-request[i];
+
+		// temp_need(customerIndex) = need - request;
+		int[][] temp_need = new int[numberOfCustomers][numberOfResources];
+		for (int p = 0; p < numberOfCustomers; p++) {
+			for (int i=0;i<numberOfResources;i++) {
+				temp_need[p][i]=need[p][i];
+			}
+		}
+		for (int i=0;i<numberOfResources;i++) temp_need[customerIndex][i]-=request[i];
+
+		// temp_allocation(customerIndex) = allocation + request;
+		int[][] temp_allocation = new int[numberOfCustomers][numberOfResources];
+		for (int p = 0; p < numberOfCustomers; p++) {
+			for (int i=0;i<numberOfResources;i++) {
+				temp_allocation[p][i]=allocation[p][i];
+			}
+		}
+		for (int i=0;i<numberOfResources;i++) temp_allocation[customerIndex][i]+=request[i];
+
+		// work = temp_avail;
+		int[] work = new int[numberOfResources];
+		for (int i=0;i<numberOfResources;i++) work[i]=temp_avail[i];
+
+		// finish(all) = false;
+		boolean[] finish = new boolean[numberOfCustomers];
+        for (int i = 0; i < numberOfCustomers; i++) finish[i] = false;
+
+		// possible = true;
+		
+		boolean possible = true;
+		while (possible) {
+            possible = false;
+            for (int p = 0; p < numberOfCustomers; p++) {
+				if (!finish[p]) {
+					int sum=0;
+					for (int i=0;i<numberOfResources;i++) {
+						if (temp_need[p][i]<=work[i]) sum++;
+					}
+					if (sum==numberOfResources){
+						possible=true;
+						for (int i=0;i<numberOfResources;i++) work[i]+=temp_allocation[p][i];
+						finish[p]=true;
+					}
+				}
+			}
+        }
+		for(boolean fin: finish) if(!fin) return false;
+		return true;
+	}
+
+	/**
+	 * Parses and runs the file simulating a series of resource request and releases.
+	 * Provided for your convenience.
+	 * @param filename  The name of the file.
+	 */
+	public static void runFile(String filename) {
+
+		try {
+			BufferedReader fileReader = new BufferedReader(new FileReader(filename));
+
+			String line = null;
+			String [] tokens = null;
+			int [] resources = null;
+
+			int n, m;
+
+			try {
+				n = Integer.parseInt(fileReader.readLine().split(",")[1]);
+			} catch (Exception e) {
+				System.out.println("Error parsing n on line 1.");
+				fileReader.close();
+				return;
+			}
+
+			try {
+				m = Integer.parseInt(fileReader.readLine().split(",")[1]);
+			} catch (Exception e) {
+				System.out.println("Error parsing n on line 2.");
+				fileReader.close();
+				return;
+			}
+
+			try {
+				tokens = fileReader.readLine().split(",")[1].split(" ");
+				resources = new int[tokens.length];
+				for (int i = 0; i < tokens.length; i++)
+					resources[i] = Integer.parseInt(tokens[i]);
+			} catch (Exception e) {
+				System.out.println("Error parsing resources on line 3.");
+				fileReader.close();
+				return;
+			}
+
+			Banker theBank = new Banker(resources, n);
+
+			int lineNumber = 4;
+			while ((line = fileReader.readLine()) != null) {
+				tokens = line.split(",");
+				if (tokens[0].equals("c")) {
+					try {
+						int customerIndex = Integer.parseInt(tokens[1]);
+						tokens = tokens[2].split(" ");
+						resources = new int[tokens.length];
+						for (int i = 0; i < tokens.length; i++)
+							resources[i] = Integer.parseInt(tokens[i]);
+						theBank.setMaximumDemand(customerIndex, resources);
+					} catch (Exception e) {
+						System.out.println("Error parsing resources on line "+lineNumber+".");
+						fileReader.close();
+						return;
+					}
+				} else if (tokens[0].equals("r")) {
+					try {
+						int customerIndex = Integer.parseInt(tokens[1]);
+						tokens = tokens[2].split(" ");
+						resources = new int[tokens.length];
+						for (int i = 0; i < tokens.length; i++)
+							resources[i] = Integer.parseInt(tokens[i]);
+						theBank.requestResources(customerIndex, resources);
+					} catch (Exception e) {
+						System.out.println("Error parsing resources on line "+lineNumber+".");
+						fileReader.close();
+						return;
+					}
+				} else if (tokens[0].equals("f")) {
+					try {
+						int customerIndex = Integer.parseInt(tokens[1]);
+						tokens = tokens[2].split(" ");
+						resources = new int[tokens.length];
+						for (int i = 0; i < tokens.length; i++)
+							resources[i] = Integer.parseInt(tokens[i]);
+						theBank.releaseResources(customerIndex, resources);
+					} catch (Exception e) {
+						System.out.println("Error parsing resources on line "+lineNumber+".");
+						fileReader.close();
+						return;
+					}
+				} else if (tokens[0].equals("p")) {
+					theBank.printState();
+				}
+			}
+			fileReader.close();
+		} catch (IOException e) {
+			System.out.println("Error opening: "+filename);
+		}
+
+	}
+
+	/**
+	 * Main function
+	 * @param args  The command line arguments
+	 */
+	public static void main(String [] args) {
+		if (args.length > 0) {
+			runFile(args[0]);
+		}
+	}
+
+}
\ No newline at end of file
diff --git a/README.pdf b/README.pdf
new file mode 100644
index 0000000..983be50
Binary files /dev/null and b/README.pdf differ