Its a java question Array list: a simple array implementation, which has an inst

Question

Its a java question Array list: a simple array implementation, which has an instance reference variable to the array, as well as an instance variable containing the number of elements in the array. Circular ArrayList: a circular array implementation, which has an instance reference variable to the array, as well as instance variables for the current front and rear elements in the array. Linked List a (singly) linked list implementation, which has an instance reference variable to the current head Node of the list. DoublyLinkedList: a doubly linked list implementation, which has an instance reference variable to the current head Node of the list and an instance reference variable to the current tail Node of the list, and doubly linked Nodes. For each of the six methods below, indicate for each implementation if the method can be Fast (that is, its execution time is constant) or if it will be Slow (that is. proportional R the number of elements in the list). Note that both array implementations are based on dynamic arrays, and thus can accommodate any number of elements. However, the array is not automatically shrunk.

Explanation / Answer

Hope it helps, do give your response.

Array List Circular ArrayList LinkedList Doubly LinkedList void addFirst(E elem) Slow Fast Fast Fast void addLast(E elem) Fast Fast Slow Slow void add(E elem, int pos) Slow Slow Slow Slow E get(int pos) Fast Fast Slow Slow void removeFirst() Slow Fast Fast Fast void removeLast() Fast Fast Slow Slow

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

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