Linked List

What is a linked list?

• A collection of data elements stored in contiguous memory locations.

• A sequence of elements where each element points to the next element.

• A collection of key-value pairs.

• A data structure where elements are stored in a hierarchical manner.

Which of the following is true about a singly linked list?

• Each node has a data part and a reference to the previous node.

• Each node has a data part and a reference to the next node.

• Each node has a data part and references to both the next and previous nodes.

• Nodes are stored in contiguous memory locations

What is the time complexity for inserting an element at the beginning of a singly linked list?

• O(1)

• O(n)

• O(log n)

• O(n log n)

In a doubly linked list, each node contains:

• Data and a reference to the next node.

• Data and a reference to the previous node.

• Data and references to both the next and previous nodes.

• Only data

Which operation is faster in a linked list compared to an array?

• • Accessing an element by index

• • Inserting an element at the beginning

• • Inserting an element at the end

• Accessing the last element

What is the disadvantage of a singly linked list compared to an array?

• Fixed size

• Slow insertions

• Inefficient random access

• Higher memory usage

In a circular linked list, how does the last node differ from a singly linked list?

• It points to a NULL.

• It does not point to any node.

• It points back to the first node.

• It has a reference to the previous node.

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

• Reduced memory usage

• Simplified insertion and deletion of nodes

• Easier traversal in both directions

• Faster searching

Which of the following is true for a circular doubly linked list?

• The last node points to the first node, and the first node points to the last node.

• The last node points to NULL.

• Each node points to the next node in a unidirectional manner.

• The nodes are stored in a sorted order.

What is the defining feature of a linked list?

• Elements are stored in contiguous memory locations.

• Elements are stored with pointers to the next element.

• Elements are stored in a last-in, first-out manner.

• • Elements are stored with pointers to both the previous and next elements.

  Answer: B