Which of the following is a true statement?
-
All implementations of the List interface provide fast random access.
-
A LinkedList provides faster random access than an ArrayList.
-
The LinkedList implements the RandomAccess interface.
-
The RandomAccess interface declares the next and hasNext methods.
-
None of the above.
Statement A is false - only implementations of RandomAccess (ArrayList, Vector) provide fast random access. Statement B is false - LinkedList has slower random access than ArrayList. Statement C is false - LinkedList does NOT implement RandomAccess. Statement D is false - RandomAccess is a marker interface with no methods. Thus 'None of the above' (E) is correct.
None of the listed statements hold: not all List implementations offer fast random access (LinkedList doesn't), LinkedList is actually slower than ArrayList for random access since it must traverse nodes, LinkedList does not implement RandomAccess (only index-based structures like ArrayList do), and RandomAccess is an empty marker interface — it declares no methods at all, let alone next/hasNext (those belong to Iterator). Since every specific claim is false, "None of the above" is correct.