The Java API contains two important structures for managing array-based lists. O

Question

The Java API contains two important structures for managing array-based lists. One, the Vector, manages lists in a thread-safe manner (for concurrency) and the other, the newer ArrayList, does the same but without the overhead required for multiprocessing thread-safety. How do these implementations compare with our own? Look at the online Java API documentation for both and post the following five details, for each of them, into a text file, attach it back to this assignment and send it in (you should have five methods listed for the Vector and another five listed for the ArrayList in a tabular arrangement):

Find the methods in Vector and ArrayList that most closely match our own List methods of:

Explanation / Answer

2. retriveAt 2.get(index) 2. get(index)

3. seqSearch 3.contains(data) 3.contains(data)

4.removeAt 4.remove(index) 5.remove(index)

5. listSize 5.size() 6.size()

please give thumbs up thanks

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.