Java Programming for Complete Beginners - Java 16 - Step 04 - List Interface Implementations - ArrayList Versus LinkedLi

What is the underlying data structure used by both ArrayList and Vector?

• Linked List

• Array

• HashMap

• Tree

Why is accessing an element in an array considered fast?

• Because elements are stored in a linked manner

• Because elements are stored in a hash table

• Because elements are stored sequentially

• Because elements are stored in a tree structure

What is a major disadvantage of using arrays for insertion and deletion?

• They require additional memory allocation

• They are time-consuming operations

• They are not thread-safe

• They are not supported in Java

How are elements connected in a linked list?

• Through references to the next element

• Through a binary tree

• Through a sequential index

• Through a hash function

What makes deletion in a linked list easier compared to an array?

• Only the links need to be updated

• Elements are stored sequentially

• Elements are stored in a tree structure

• Elements are stored in a hash table

In what scenario would you prefer using an ArrayList over a LinkedList?

• When frequent insertions and deletions are needed

• When elements need to be accessed frequently by index

• When memory usage needs to be minimized

• When elements need to be stored in a tree structure

What is a key feature of a doubly linked list?

• It has a link to both the next and previous elements

• It uses a hash function for element access

• It stores elements in a tree structure

• It has a link to the next element only