Linked Lists

What is a singly linked list?

• A circular data structure with no links

• A linear data structure with one link per node

• A data structure that only stores integers

• A data structure with multiple links per node

What operation is efficient in linked lists compared to sequential data structures?

• Sorting elements

• Searching for an element

• Insertion and deletion operations

• Accessing elements by index

What does the link field in a node of a linked list hold?

• The data item of the node

• The address of the next node

• The size of the node

• The type of data stored

What is a circularly linked list?

• A list with multiple heads

• A list that has no nodes

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

• A list that can only be traversed in one direction

What is a doubly linked list?

• A list that only stores strings

• A list that cannot be traversed

• A list with two links per node for bidirectional traversal

• A list with only one link per node

What is the main advantage of a doubly linked list?

• It requires less memory than a singly linked list

• It allows for forward and backward traversal

• It is easier to implement

• It can store more data

What is the purpose of the GETNODE operation?

• To allocate a new node from available space

• To retrieve data from a node

• To traverse the list

• To delete a node from the list

What is a multiply linked list?

• A list with multiple data and link fields

• A list that can only link to one node

• A list that is not linked at all

• A list that only contains integers

What is a disadvantage of circularly linked lists?

• They are difficult to implement

• They cannot be traversed

• They can lead to infinite loops

• They require more memory than singly linked lists

In a doubly linked list, what do the LLINK and RLINK fields represent?

• Links to the data fields

• Links to the memory addresses

• Links to the first and last nodes

• Links to the previous and next nodes