DATA STRUCTURES TLP 1

What is the purpose of the head pointer in a linked list?

• To store the data

• To point to the last node

• To point to the first node

• To point to the middle node

What is the primary advantage of using a circular linked list?

• Efficient memory usage

• Ease of implementation

• Supports bidirectional traversal

• Faster searching

How is a circular linked list different from a singly linked list?

• Circular linked list has loops

• Circular linked list has a single node

• Circular linked list has no pointers

• Circular linked list has a last node pointing to the first

What is the primary advantage of using a linked list over an array?

• Constant time access to elements

• Better cache locality

• Dynamic size and ease of insertion/deletion

• Fixed size and efficient memory usage

What is the key difference between static and dynamic representation of a linked list?

• Static representation uses pointers

• Dynamic representation uses arrays

• Dynamic representation allocates memory during runtime

• Static representation allows variable size

What is the primary disadvantage of a circular linked list?

• Difficulty in implementation

• Poor cache locality

• Increased complexity in traversal

• No disadvantage

How is a doubly linked list different from a singly linked list in terms of memory usage?

• Doubly linked list uses less memory

• Doubly linked list uses more memory

• Both use the same amount of memory

• Memory usage depends on the implementation

Which operation is used to find the position of an element in a linked list?

• Insertion

• Deletion

• Searching

• Traversal

Which type of linked list allows traversal in both directions?

• Singly Linked List

• Doubly Linked List

• Circular Linked List

• Static Linked List

Which operation is used to remove a specific element from a linked list?

• Insertion

• Deletion

• Searching

• Traversal