What is a linked list?

• A linear data structure where elements are not stored in contiguous memory locations.

• A non-linear data structure.

• A data structure where elements are stored in contiguous memory locations.

• An abstract data type.

Which of the following is NOT a type of linked list?

• Singly linked list

• Doubly linked list

• Circular linked list

• Array linked list

In a singly linked list, each node contains:

• Data and pointer to the next node

• Data and pointer to the previous node

• Data and pointers to both next and previous nodes

• Only data

The first node in a linked list is called:

• Current node

• Root node

• Head node

• First node

The last node in a singly linked list points to:

• The head node

• The previous node

• NULL

• The second last node

What is a doubly linked list?

• Each node points to only the next node.

• Each node points to only the previous node.

• Each node points to both the next and previous nodes.

• Nodes do not point to any other node.

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

• NULL

• The first node (head)

• The middle node

• The last node itself

Which of the following operations is generally more efficient in linked lists than in arrays?

• Accessing an element at a specific index

• Inserting a new element at the beginning

• Searching for an element

• Sorting the elements

What is the time complexity to access the i-th element in a singly linked list?

• O(1)

• O(log n)

• O(n)

• O(n log n)

What is the time complexity to insert a new node at the beginning of a singly linked list?

• O(1)

• O(log n)

• O(n)

• O(n log n)