Question : What is a Linked List?
Solution :
Correct Answer : Linear data structure of nodes connected by links
Description -
Question : In a Singly Linked List, each node contains:
Solution :
Correct Answer : Data and next pointer
Description -
Question : The first node of a linked list is called:
Solution :
Correct Answer : Head
Description -
Question : The last node in a Singly Linked List contains:
Solution :
Correct Answer : NULL in next pointer
Description -
Question : Which memory allocation is used in Linked Lists?
Solution :
Correct Answer : Dynamic
Description -
Question : Which operation is faster in Linked List compared to Array?
Solution :
Correct Answer : Insertion at beginning
Description -
Question : Which pointer stores the address of the first node?
Solution :
Correct Answer : Head
Description -
Question : A node in a linked list consists of:
Solution :
Correct Answer : Data and pointer(s)
Description -
Question : Linked Lists are suitable when:
Solution :
Correct Answer : Frequent insertion/deletion occurs
Description -
Question : Which data structure uses LIFO principle?
Solution :
Correct Answer : Stack
Description -
Question : In a Doubly Linked List, each node contains:
Solution :
Correct Answer : Two pointers
Description -
Question : The previous pointer of the first node in a Doubly Linked List is:
Solution :
Correct Answer : NULL
Description -
Question : Which linked list allows traversal in both directions?
Solution :
Correct Answer : Doubly Linked List
Description -
Question : In a Circular Linked List, the last node points to:
Solution :
Correct Answer : Head node
Description -
Question : Time complexity of insertion at the beginning of a Singly Linked List:
Solution :
Correct Answer : O(1)
Description -
Question : Searching an element in a Linked List requires:
Solution :
Correct Answer : O(n)
Description -
Question : Which linked list has no NULL pointer?
Solution :
Correct Answer : Circular Linked List
Description -
Question : Which structure uses more memory?
Solution :
Correct Answer : Doubly Linked List
Description -
Question : The address of the next node is stored in:
Solution :
Correct Answer : Link field
Description -
Question : Which operation is difficult in Singly Linked List?
Solution :
Correct Answer : Backward traversal
Description -
Question : Time complexity to delete a node when its address is known in a Singly Linked List:
Solution :
Correct Answer : O(n)
Description -
Question : Which linked list is most suitable for implementing browser back and forward buttons?
Solution :
Correct Answer : Doubly Linked List
Description -
Question : Detecting a loop in a linked list is commonly done using:
Solution :
Correct Answer : Floyd's Cycle Detection Algorithm
Description -
Question : In Circular Doubly Linked List, the previous pointer of the head points to:
Solution :
Correct Answer : Last node
Description -
Question : The main disadvantage of Linked Lists compared to Arrays is:
Solution :
Correct Answer : Extra memory for pointers
Description -
Question : Which linked list is best for implementing a music playlist with repeat mode?
Solution :
Correct Answer : Circular Linked List
Description -
Question : What is the time complexity of accessing the nth node in a Singly Linked List?
Solution :
Correct Answer : O(n)
Description -
Question : Which of the following supports efficient deletion from both ends?
Solution :
Correct Answer : Circular Doubly Linked List
Description -
Question : Which linked list is commonly used in implementing Deque (Double Ended Queue)?
Solution :
Correct Answer : Doubly Linked List
Description -
Question : If a Circular Linked List contains only one node, then:
Solution :
Correct Answer : Next pointer points to itself
Description -