Topic 2: Linked Lists Quiz

What is a singly linked list?

• A type of array

• A linear data structure with one link per node

• A data structure with multiple links per node

• A circular data structure

What operation is efficient in a linked list compared to an array?

• Searching for an element

• Accessing elements by index

• Insertion and deletion

• Sorting elements

What does each node in a linked list contain?

• Only addresses of other nodes

• Data items and links

• Only link fields

• Only data fields

What is a circularly linked list?

• A list with no nodes

• A list that uses arrays

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

• A list that can only be traversed in one direction

What is the main disadvantage of circularly linked lists?

• Memory fragmentation

• Infinite loops due to circular pointers

• Complexity in insertion

• Inefficient memory use

What is the purpose of the GETNODE operation?

• To store data in a node

• To delete a node

• To allocate a node from available space

• To retrieve data from a node

In a doubly linked list, how many links does each node have?

• No links

• Three links

• Two links

• One link

What is the main advantage of a doubly linked list?

• Less memory usage

• Forward and backward traversal

• Easier to implement

• Faster access times

What is a multiply linked list?

• A list with only one link

• A list that is doubly linked

• A list that is circular

• A list with multiple data and link fields

What is the main drawback of sequential data structures like arrays?

• They are too complex

• Inefficient insertion and deletion

• They use too much memory

• They cannot store data