ArrayList Basics
This value is the size of an ArrayList when it is first created.
What is 0?
The ArrayList method that returns the size of an ArrayList.
What is .size()?
These loops can be used to traverse through an ArrayList.
What are for loops, while loops, and for-each loops?
This value of a desired element is usually returned by a searching algorithm.
What is an index value?
These two iterative sorting algorithms are discussed in Unit 7 of APCSA.
What are Selection Sort and Insertion Sort?
This represents the correct declaration for a String ArrayList called example.
What is ArrayList<String> example = new ArrayList<String>();?
The ArrayList method that removes an element from the list, taking the index of the element as a parameter.
What is .remove(int index)?
This code statement will yield the last element of an ArrayList (called example).
What is example.get(example.size()-1)?
This searching algorithm checks every component in a data set (starting at the first element) until the value is found or all components in the data set have been checked.
What is linear search?
This is an approximation of the duration of the algorithm given N input elements.
What is Big O (Order of N)?
This is a re-sizable data structures that permits adding and expelling things to change its size during runtime.
What is an ArrayList?
The ArrayList method for attaining an element of an ArrayList, taking the index of this element as a paramter.
What is .get(int index)?
This arithmetic expression (or an equivalent one) must be present in an ArrayList traversal when adding an element from an ArrayList (int i is declared at start of traversal).
What is i++?
This searching algorithm disposes half of the data set in every iteration until the value is found or all the elements have been checked.
What is binary search?
This searching algorithm finds the smallest element in a data set and moves it to the beginning of the data set by swapping with the front element.
What is Selection Sort?
ArrayLists use these special kinds of classes so they can hold primitive data types like ints or doubles.
What are wrapper classes?
The ArrayList method to change an element of an ArrayList, taking the index of this element and what it will be changed to as parameters.
What is .set(int index, E obj)?
This arithmetic expression (or an equivalent one) must be present in an ArrayList traversal when removing an element from an ArrayList (int i is declared at start of traversal).
What is i--?
A binary search begins at this position of a data set.
What is the center/middle?
This sorting algorithm works by shifting each element in a data set one at a time, iterating through the input elements and expanding the sorted data set each time by comparing the current element to the sorted data set's greatest value.
An ArrayList class is in this Java package.
What is java.util?
The overloaded ArrayList method.
What is .add(E obj)/.add(int index, E obj)?
Accessing an index value outside the given range of an ArrayList will yield this error.
What is an ArrayIndexOutOfBoundsException?
A data set must be this in order for binary search to be applied.
What is sorted?
Students must be familiar with this sorting algorithm, while not from Unit 7 of APCSA, which uses recursion to sort a data set.
What is merge sort?