- 1. Which of the following operations can be performed on singly linked list?
A) Deletion
B) Insertion
C) All of the above
D) Traversal
- 2. In a singly linked list, each node contains
A) Data and two pointers
B) Data and pointer to the next node
C) Only data
D) Only pointer
- 3. In a doubly linked list, each node has
A) Two pointers
B) Three pointers
C) No pointer
D) One pointer
- 4. A circular linked list is different because
A) Each node has two pointers
B) The first node points back to the last node
C) The last node points back to the first node
D) It has no nodes
- 5. Which type of linked list allows traversal in both directions?
A) Singly Linked List
B) Linked List
C) None of the above
D) Doubly Linked List
- 6. Which application commonly used linked lists?
A) Both B and C
B) Polynomial representation
C) Image processing
D) Dynamic memory management
- 7. What is the time complexity of inserting a node at the beginning of a singly linked list?
A) 0(n²)
B) 0(log n)
C) 0(1)
D) 0(n)
- 8. Which linked list is best for implementing a stack?
A) Singly
B) All of the above
C) Circular
D) Doubly
- 9. In a doubly linked list, deleting a node requires
A) Updating three pointers
B) No update
C) Updating one pointer
D) Updating two pointers
- 10. Which linked is more memory-efficient if you only need forward traversal?
A) Singly Linked List
B) Circular Linked List
C) All of the above
D) Doubly Linked List
- 11. A singly linked list can only be traversed in one direction
A) True
B) False
- 12. In a doubly linked list, each node points to both the previous and the next node
A) False
B) True
- 13. The last node of a singly linked list always points yo NULL
A) True
B) False
- 14. Circular list are useful for representing queues
A) True
B) False
- 15. Dynamic memory allocation can be efficiently managed using linked list
A) False
B) True
- 16. Polynomial representation cannot be done using linked list
A) True
B) False
- 17. In a circular linked list, traversal can continue indefinitely
A) False
B) True
- 18. Doubly linked require more memory per node compared to singly linked list
A) False
B) True
- 19. Insertion at the end of a singly linked list requires traversal of the entire list
A) False
B) True
- 20. Linked list are stored in contiguous memory locations
A) True
B) False
- 21. Circular list are useful for representing queues
A) True
B) False
|