Exploring Linked Lists Concepts

What is a singly linked list?

• A list where each node contains data and two pointers (next and previous)

• A list where each node contains data and a single pointer to the next node

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

• A list stored in contiguous memory locations

In a singly linked list, what does the pointer of the last node typically contain?

• The address of the first node

• The address of the previous node

• NULL

• The address of the middle node

• Searching for an element

• Inserting a node at the beginning

• Accessing the last element

• Reversing the list

In a doubly linked list, each node contains:

• Data and one pointer

• Only data with no pointers

• Data, a pointer to the next node, and a pointer to the previous node

• Data and a pointer to the last node

What is the main advantage of a doubly linked list over a singly linked list?

• It uses less memory

• It allows traversal in both forward and backward directions

• It has faster insertion at the beginning

• It does not require dynamic memory allocation

In a circular linked list, the last node points to:

• NULL

• The second node

• The first node

• Itself

Which of the following is a key disadvantage of linked lists compared to arrays?

• Linked lists cannot store integers

• Linked lists do not support dynamic sizing

• Linked lists require extra memory for storing pointers

• Linked lists cannot be traversed sequentially

What is the time complexity of inserting a node at the end of a singly linked list without a tail pointer?

Which data structure uses contiguous memory allocation?

• Singly linked list

• Doubly linked list

• Circular linked list

• Array