CS 1332 TOP Study Guide Questions and CORRECT Answers

CS 1332 TOP Study Guide Questions and CORRECT Answers ArrayList Constructor() (code) ✔✔✔this.backingArray = (T[]) new Object[INITIAL_CAPACITY]; this.size = 0; ArrayList RemoveAtIndex() (code) ✔✔✔ BIG O - O(n) Steps: 1. Store element to return 2. edge case - removing from end 3. edge case - list empty 4. shift element to be removed to back of the list and null out { T element = backingArray[index]; if (index == size - 1) { backingArray[index] = null; } else if (size == 0) { return null; } else { for(int i = index; i < size - 1; i ++) { backingArra y[i] = backingArray[i + 1]; } backingArray[size - 1] = null; } size -= 1; return element; } ArrayList isEmpty() (code) ✔✔✔ public boolean isEmpty() { return size == 0; } ArrayList removeFromFront() (code) ✔✔✔ BIG O - O(n) Steps: 1. store element to return 2. edge case - if empty 3. shift all elements --> front element is at the back { T element = backingArray[0]; if (size == 0) { return null; } for (i = 0; i < size - 1; i++) { backingArray[i] = backingArray[i + 1]; } back ingArray[size - 1] = null; size -= 1; return element; } ArrayList removeFromBack() (code) ✔✔✔ BIG O - O(1) Steps: 1. store element to return 2. check if empty 3. set the last element to null { T element = backingArray[size - 1]; if (size == 0) { return null; } backingArray[size - 1] = null; size -= 1; return element; } ArrayList get() (code) ✔✔✔ BIG O - O(1) { return backingArray[index]; } ArrayList addAtIndex() (code) ✔✔✔ BIG O - O(n) Steps: 1. does index = size, add to back 2. regrow an d shift