If you do not need efficient random access but need to efficiently move sequentially through the list, then use the _____________ class.
a. Vector
b. LinkedList
c. HashSet
d. TreeSet
B
You might also like to view...
You can simulate atomicity by ensuring that ________.
a. at least one thread carries out its operations on an object at a time b. two threads carry out their operations on an object in parallel c. only one thread carries out its operations on an object at a time d. None of the above.
When we reduce the capacity of an array to one half, it is possible to run out of heap memory because:
A. This statement is false. It is not possible to run out of heap memory when reducing the size of an adjustable array. B. a linked list has to be made to copy the array into before the size is reduced C. a smaller array is created in the heap first D. each line of code in a function uses up some heap memory