Q1. Linked list is a:

A) Linear data structure
B) Non-linear data structure
C) Hierarchical structure
D) Graph structure

Answer: A

Explanation: Linked list is a linear data structure where elements are connected sequentially using pointers.

Q2. Each node of a singly linked list contains:

A) Data only
B) Address only
C) Data and address of next node
D) Address of previous node only

Answer: C

Explanation: A singly linked list node stores data and a pointer to the next node.

Q3. The last node of a singly linked list points to:

A) First node
B) Previous node
C) NULL
D) Random node

Answer: C

Explanation: The last node points to NULL indicating the end of the list.

Q4. Which operation is easier in linked list compared to array?

A) Random access
B) Insertion and deletion
C) Sorting
D) Binary search

Answer: B

Explanation: Insertion and deletion are easier in linked list because shifting of elements is not required.

Q5. Which of the following is not required in linked list?

A) Dynamic memory
B) Pointers
C) Contiguous memory location
D) Nodes

Answer: C

Explanation: Linked list does not require contiguous memory allocation.

Q6. In doubly linked list, each node contains:

A) One pointer
B) Two pointers
C) Three pointers
D) No pointer

Answer: B

Explanation: Doubly linked list contains previous pointer and next pointer.

Q7. Circular linked list differs because:

A) Last node points to first node
B) First node points to NULL
C) It has no nodes
D) It uses arrays

Answer: A

Explanation: In circular linked list, the last node links back to the first node.

Q8. Header node in linked list is used to:

A) Store user data
B) Simplify list operations
C) Delete nodes
D) Reverse list

Answer: B

Explanation: Header node helps simplify insertion and deletion operations.

Q9. Searching in linked list requires:

A) Direct access
B) Sequential traversal
C) Binary search
D) Hashing

Answer: B

Explanation: Linked list must be traversed one node at a time.

Q10. Which linked list allows traversal in both directions?

A) Singly linked list
B) Circular linked list
C) Doubly linked list
D) Stack

Answer: C

Explanation: Doubly linked list supports both forward and backward traversal.

Q11. Linked representation of stack uses:

A) Graph
B) Tree
C) Linked list
D) Heap

Answer: C

Explanation: Stack can be efficiently implemented using linked list.

Q12. Deletion in linked list mainly requires:

A) Shifting elements
B) Updating pointers
C) Sorting nodes
D) Binary search

Answer: B

Explanation: Only pointer links need to be adjusted during deletion.

Q13. Which pointer stores previous node address in doubly linked list?

A) Next
B) Prev
C) Head
D) Top

Answer: B

Explanation: Prev pointer stores the address of the previous node.

Q14. The starting node of linked list is called:

A) Tail
B) Head
C) Header
D) Top

Answer: B

Explanation: Head pointer stores the address of the first node.

Q15. Which of the following is a disadvantage of linked list?

A) Dynamic size
B) Easy insertion
C) Extra memory for pointer
D) No memory wastage

Answer: C

Explanation: Extra memory is required to store pointer fields.

Q16. In singly linked list, traversal is possible in:

A) Forward only
B) Backward only
C) Both directions
D) Random direction

Answer: A

Explanation: Singly linked list supports only forward traversal.

Q17. Which linked list is best for implementing undo operation?

A) Singly linked list
B) Doubly linked list
C) Circular linked list
D) Header list

Answer: B

Explanation: Doubly linked list allows moving both forward and backward.

Q18. Circular linked list is useful in:

A) Round robin scheduling
B) Binary search
C) Sorting only
D) Tree traversal

Answer: A

Explanation: Circular linked list is commonly used in round robin CPU scheduling.

Q19. Insertion at beginning of linked list requires:

A) Updating head pointer
B) Updating tail only
C) Sorting nodes
D) Binary search

Answer: A

Explanation: Head pointer must be updated when inserting at beginning.

Q20. Deletion of first node requires:

A) Moving head pointer
B) Changing tail
C) Adding node
D) Sorting nodes

Answer: A

Explanation: Head pointer is moved to the next node after deletion.

Q21. Which linked list uses no NULL pointer at end?

A) Singly linked list
B) Doubly linked list
C) Circular linked list
D) Header linked list

Answer: C

Explanation: Circular linked list connects last node to first node.

Q22. Which memory allocation is used in linked list?

A) Static
B) Dynamic
C) Fixed
D) Permanent

Answer: B

Explanation: Nodes are created dynamically during runtime.

Q23. Which is faster for random access?

A) Linked list
B) Array
C) Stack
D) Queue

Answer: B

Explanation: Array supports direct indexing while linked list does not.

Q24. Which linked list has highest memory usage?

A) Singly linked list
B) Doubly linked list
C) Circular linked list
D) Header list

Answer: B

Explanation: Doubly linked list stores two pointers, so memory usage is higher.

Q25. Which pointer stores next node address?

A) Prev
B) Link
C) Head
D) Tail

Answer: B

Explanation: Link or next pointer stores the address of the next node.

Q26. Linked list is preferred when:

A) Frequent insertion/deletion
B) Fast random access
C) Fixed size required
D) No pointers allowed

Answer: A

Explanation: Linked list is better when frequent insertion and deletion are needed.

Q27. Which linked list can form a loop?

A) Circular linked list
B) Array
C) Stack
D) Queue

Answer: A

Explanation: Circular linked list naturally forms a loop structure.

Q28. Which linked list is most commonly used?

A) Singly linked list
B) Doubly linked list
C) Circular linked list
D) Header linked list

Answer: A

Explanation: Singly linked list is simple and commonly used.

Q29. The last node of doubly linked list has:

A) Next = NULL
B) Prev = NULL
C) Both NULL
D) No pointer

Answer: A

Explanation: The last node has no next node, so next becomes NULL.

Q30. Which operation is costly in linked list?

A) Insertion
B) Deletion
C) Random access
D) Adding node at beginning

Answer: C

Explanation: Random access is costly because nodes must be traversed sequentially.