Solved

If You Do Not Need Efficient Random Access but Need

Question 7

Multiple Choice

If you do not need efficient random access but need to efficiently move sequentially through the list,then use the _____________ class.

A) Vector< T >
B) LinkedList< T >
C) HashSet< T >
D) TreeSet< T >

Related Questions

Q2: The number of entries that may be

Q3: Write a Java statement to resize the

Q4: All of the following are members of

Q5: Elements of a vector must be of

Q6: A collection is a data structure for

Q8: For-each loops can not be used with

Q9: If you want a class that implements

Q10: To use Java's Vector class,you must import

Q11: Compare and contrast vectors and arrays.

Q12: The interface SortedSet and the concrete class