Question: Please code the following methods as per instructions public class ArrayList { /** * The initial capacity of the ArrayList. * * DO NOT MODIFY
Please code the following methods as per instructions
public class ArrayList
/**
* The initial capacity of the ArrayList.
*
* DO NOT MODIFY THIS VARIABLE!
*/
public static final int INITIAL_CAPACITY = 9;
// Do not add new instance variables or modify existing ones.
private T[] backingArray;
private int size;
/**
* Constructs a new ArrayList.
*
* Java does not allow for regular generic array creation, so you will have
* to cast an Object[] to a T[] to get the generic typing.
*/
public ArrayList() {
ArrayList
}
/**
* Adds the element to the specified index.
*
* Remember that this add may require elements to be shifted.
*
* Must be amortized O(1) for index size and O(n) for all other cases.
*
* @param index the index at which to add the new element
* @param data the data to add at the specified index
* @throws java.lang.IndexOutOfBoundsException if index < 0 or index > size
* @throws java.lang.IllegalArgumentException if data is null
*/
public void addAtIndex(int index, T data) {
}
/**
* Adds the element to the front of the list.
*
* Remember that this add may require elements to be shifted.
*
* Must be O(n).
*
* @param data the data to add to the front of the list
* @throws java.lang.IllegalArgumentException if data is null
*/
public void addToFront(T data) {
}
/**
* Adds the element to the back of the list.
*
* Must be amortized O(1).
*
* @param data the data to add to the back of the list
* @throws java.lang.IllegalArgumentException if data is null
*/
public void addToBack(T data) {
}
/**
* Removes and returns the element at the specified index.
*
* Remember that this remove may require elements to be shifted.
*
* Must be O(1) for index size - 1 and O(n) for all other cases.
*
* @param index the index of the element to remove
* @return the data formerly located at the specified index
* @throws java.lang.IndexOutOfBoundsException if index < 0 or index >= size
*/
public T removeAtIndex(int index) {
}
/**
* Removes and returns the first element of the list.
*
* Remember that this remove may require elements to be shifted.
*
* Must be O(n).
*
* @return the data formerly located at the front of the list
* @throws java.util.NoSuchElementException if the list is empty
*/
public T removeFromFront() {
}
/**
* Removes and returns the last element of the list.
*
* Must be O(1).
*
* @return the data formerly located at the back of the list
* @throws java.util.NoSuchElementException if the list is empty
*/
public T removeFromBack() {
}
/**
* Returns the element at the specified index.
*
* Must be O(1).
*
* @param index the index of the element to get
* @return the data stored at the index in the list
* @throws java.lang.IndexOutOfBoundsException if index < 0 or index >= size
*/
public T get(int index) {
}
/**
* Returns whether or not the list is empty.
*
* Must be O(1).
*
* @return true if empty, false otherwise
*/
public boolean isEmpty() {
}
/**
* Clears the list.
*
* Resets the backing array to a new array of the initial capacity and
* resets the size.
*
* Must be O(1).
*/
public void clear() {
}
/**
* Returns the backing array of the list.
*
* For grading purposes only. You shouldn't need to use this method since
* you have direct access to the variable.
*
* @return the backing array of the list
*/
public T[] getBackingArray() {
// DO NOT MODIFY THIS METHOD!
return backingArray;
}
/**
* Returns the size of the list.
*
* For grading purposes only. You shouldn't need to use this method since
* you have direct access to the variable.
*
* @return the size of the list
*/
public int size() {
// DO NOT MODIFY THIS METHOD!
return size;
}
}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
Study Help