Amazon needs a simple service to create, read, update and delete customer addresses. 1. Write the interface for this service. What methods are needed? What parameters would each method require and what data would each method return? 2. Using the following assumptions, describe how you would design your system: You need to store 10 TB of addresses. Your service must support 10,000 transactions per second. Each of your databases can only handle 1TB of data. Each of your application servers can only handle 1,000 TPS Question 1: 1. What is the runtime complexity for the code below? 2. What is the space complexity for the code below? Queue<TreeNode> queue = new LinkedList<BinaryTree.TreeNode>() ; public void myMethod(TreeNode root) { if (root == null) return; queue.clear(); queue.add(root); while(!queue.isEmpty()){ TreeNode node = queue.remove(); if(node.left != null) queue.add(node.left); if(node.right != null) queue.add(node.right); Question 2: 1. What is the runtime complexity for the code below? // Precondition: array[] is sorted int search(int array[], int numberToFind, int min, int max) { while (max >= min) { int index = midpoint(min, max); if(array[index] == numberToFind) return index; else if (array[index] < numberToFind) min = index + 1; else max = index - 1; } // numberToFind was not found System.out.println("Not Found"); }
