Quiz on Linked Lists and Arrays

What is a key difference between an array and a linked list?

• An array can change size dynamically.

• A linked list allows direct access to any element.

• An array uses consecutive memory locations for its elements.

• A linked list is always faster than an array.

Why is it inefficient to add an element to the beginning of an array?

• You have to create a new array.

• You must move all elements down one index.

• Arrays do not allow adding elements.

• It requires more memory than linked lists.

What is a pointer in the context of linked lists?

• A type of data structure.

• A reference to the next node's memory address.

• A method to access array elements.

• A way to delete nodes from a list.

In a singly linked list, what does the last node's "next" pointer point to?

• The first node.

• The last node itself.

• Null.

• The previous node.

What is the main advantage of using a linked list over an array?

• Linked lists are always faster for accessing elements.

• Linked lists can easily add and remove elements from any position.

• Linked lists use less memory than arrays.

• Linked lists allow for random access of elements.

Which of the following best describes a doubly linked list?

• Each node has a pointer to the next node only.

• Each node has pointers to both the next and previous nodes.

• It can only be traversed in one direction.

• It cannot be used to remove nodes.

How would you add a new node named "Lizzie" between "Victoria" and "Edward" in a linked list?

• Move "Edward" to the end of the list.

• Update the pointer of "Victoria" to point to "Lizzie" and "Lizzie" to point to "Edward".

• Replace "Victoria" with "Lizzie".

• Delete "Edward" and add "Lizzie" at the end.

What is a circular linked list?

• A list where all nodes point to the last node.

• A list where the last node points back to the first node.

• A list that cannot be traversed.

• A list that only contains one node.

What happens when you remove a node from a linked list?

• You must move all the nodes above it.

• You only need to update the pointers of the surrounding nodes.

• The entire list must be recreated.

• The node is deleted but remains in memory.

Which type of linked list allows traversal in both directions?

• Singly linked list

• Circular linked list

• Doubly linked list

• Static linked list