AP Computer Science Amediummcq1 pt
Inserting at the front of an ArrayList is slower than appending because
A.existing elements must shift right
B.the list must be copied to a bigger list
C.insertion is always instant
D.the front is reserved
Explanation
Core Concept
Insertion at index 0 moves every element.
Correct Answer
Aexisting elements must shift right
More Unit 7: ArrayList practice questions
- hardWhich code reverses an ArrayList<Integer> list in place?
- hardTo remove every negative value from an Integer list, use
- mediumAn ArrayList is backed internally by
- mediumAn ArrayList is preferable to an array when
- mediumWhich expression finds the last element of a nonempty Integer list?
Practice more AP Computer Science A questions with full explanations
Practice Unit 7: ArrayList Questions →