which of the given options are true with respect to linked lists, when compared to arrays 1.Linked lists are dynamic in size
Answer options
A
2.Random access is possible in linked list
B
3.Insertion and deletions are expensive in linked list
C
4.All the options
D
Linked lists are dynamic in size
Correct answer: Linked lists are dynamic in size
Explanation
Only 'Linked lists are dynamic in size' (statement 1, in the question stem) is true about linked lists compared to arrays. Random access is NOT possible in linked lists (must traverse sequentially), and insertions/deletions are efficient (O(1)), not expensive. None of the options (0–2) are true statements.