Data Structure Quiz-1 (Linked List)By sadmanhafij.com / February 16, 2024 Data Structure Quiz-1 (Linked List) 1 / 20 1. What is a linked list? A) An array with fixed size B) A collection of nodes connected by pointers C) A stack-based data structure D) A binary search tree 2 / 20 2. Which of the following is not a type of linked list? A) Singly linked list B) Doubly linked list C) Triply linked list D) Circular linked list 3 / 20 3. What is the time complexity for inserting a node at the beginning of a linked list? A) O(1) B) O(n) C) O(log n) D) O(n log n) 4 / 20 4. Which pointer in a node of a singly linked list points to the next node? A) previous B) next C) current D) forward 5 / 20 5. What is the purpose of the "head" pointer in a linked list? A) Points to the last node B) Points to the middle node C) Points to the first node D) Points to a random node 6 / 20 6. Which operation in a linked list requires traversal from the head to the end of the list? A) Insertion at the beginning B) Deletion at the end C) Searching for an element D) Insertion at the end E) None 7 / 20 7. What is a self-referential structure in the context of linked lists? A) A structure that references itself B) A structure that references another linked list C) A structure that references its parent node D) A structure that references the next node of the same type 8 / 20 8. Which of the following operations in a linked list has a time complexity of O(n)? A) Insertion at the beginning B) Deletion at the end C) Searching for an element D) Deletion at the beginning 9 / 20 9. What happens if a node in a singly linked list points to NULL? A) The list becomes empty B) It points to the head node C) It signifies the end of the list D) It points to a random node 10 / 20 10. Which of the following linked lists allows traversal in both forward and backward directions? A) Singly linked list B) Doubly linked list C) Circular linked list D) Triply linked list 11 / 20 11. What is the time complexity for deleting a node from the middle of a singly linked list? A) O(1) B) O(n) C) O(log n) D) O(n log n) 12 / 20 12.Which operation in a linked list requires updating the next pointer of the previous node? A) Insertion at the beginning B) Deletion at the end C) Deletion in the middle D) Searching for an element 13 / 20 13. What is the main advantage of using a circular linked list? A) Efficient insertion at the beginning B) Efficient deletion at the end C) Allows traversal from any node D) Requires less memory than other types of linked lists 14 / 20 14. Which of the following operations is not supported by a singly linked list? A) Insertion at the beginning B) Deletion at the end C) Deletion in the middle D) Searching for an element 15 / 20 15. What is the time complexity for inserting a node at the end of a singly linked list? A) O(1) B) O(n) C) O(log n) D) O(n log n) 16 / 20 16. Which of the following is an advantage of using a linked list over an array? A) Constant time access to elements B) Fixed size C) Dynamic memory allocation D) Efficient for searching operations 17 / 20 17. In a circular linked list, what does the last node point to? A) The head node B) NULL C) The middle node D) The first node 18 / 20 18. Which pointer in a node of a doubly linked list points to the previous node? A) previous B) next C) current D) forward 19 / 20 19. Which operation in a linked list requires updating the head pointer? A) Insertion at the beginning B) Deletion at the end C) Deletion in the middle D) Searching for an element 20 / 20 20. What is the main disadvantage of using a circular linked list? A) Inefficient memory usage B) Complexity in implementation C) Limited traversal options D) Difficulty in inserting at the beginning Your score isThe average score is 55% 0% Restart quiz