Question : Which data structure stores elements in non-contiguous memory locations?
Solution :
Correct Answer : Linked List
Description -
Question : Which part of a singly linked list node stores the address of the next node?
Solution :
Correct Answer : Pointer
Description -
Question : Which pointer represents the first node of a linked list?
Solution :
Correct Answer : Head
Description -
Question : Time complexity of insertion at the beginning of a singly linked list is:
Solution :
Correct Answer : O(1)
Description -
Question : Which operation is easiest in a linked list compared to an array?
Solution :
Correct Answer : Insertion
Description -
Question : What does NULL indicate?
Solution :
Correct Answer : End of linked list
Description -
Question : Which traversal visits every node exactly once?
Solution :
Correct Answer : Sequential Traversal
Description -
Question : Searching an element in an unsorted linked list takes:
Solution :
Correct Answer : O(n)
Description -
Question : Insertion after a specified node requires:
Solution :
Correct Answer : Node address
Description -
Question : Which pointer is added in a doubly linked list?
Solution :
Correct Answer : Previous
Description -
Question : Time complexity of insertion at end without tail pointer is:
Solution :
Correct Answer : O(n)
Description -
Question : Deleting the first node requires updating:
Solution :
Correct Answer : Head
Description -
Question : In a doubly linked list, deleting a node requires updating:
Solution :
Correct Answer : Both previous and next pointers
Description -
Question : Which linked list supports backward traversal?
Solution :
Correct Answer : Doubly
Description -
Question : Last node of a circular linked list points to:
Solution :
Correct Answer : Head
Description -
Question : Which operation cannot be performed directly in a singly linked list?
Solution :
Correct Answer : Backward Traversal
Description -
Question : Space complexity per node in doubly linked list is:
Solution :
Correct Answer : Two pointers
Description -
Question : Insertion at end in circular linked list with tail pointer is:
Solution :
Correct Answer : O(1)
Description -
Question : Searching in doubly linked list takes:
Solution :
Correct Answer : O(n)
Description -
Question : Circular linked list is useful for:
Solution :
Correct Answer : CPU Scheduling
Description -
Question : In a circular doubly linked list, head's previous pointer points to:
Solution :
Correct Answer : Last Node
Description -
Question : After inserting at beginning of circular linked list, which pointers must change?
Solution :
Correct Answer : Head and last node
Description -
Question : Which linked list provides fastest deletion when node address is known?
Solution :
Correct Answer : Doubly
Description -
Question : If head becomes NULL after deletion, it means:
Solution :
Correct Answer : Empty list
Description -
Question : Which linked list is most suitable for browser forward/back navigation?
Solution :
Correct Answer : Doubly
Description -
Question : Time complexity of deleting last node in singly linked list without tail pointer is:
Solution :
Correct Answer : O(n)
Description -
Question : Circular linked list has:
Solution :
Correct Answer : No NULL pointer
Description -
Question : Which linked list requires maximum memory per node?
Solution :
Correct Answer : Doubly
Description -
Question : Which operation requires traversal before insertion?
Solution :
Correct Answer : Insertion after specified data
Description -
Question : Which statement is true?
Solution :
Correct Answer : Linked lists provide dynamic memory allocation
Description -