Which of the following points is/are not true about Linked List data structure when it is compared with an array?

Correct Answer (Detailed Explanation is Below)

B. Access of elements in linked list takes less time than compared to arrays

Detailed Explanation

(a) Random access is not allowed in Linked List

✔ TRUE
Linked list does not support direct indexing like arr[i].
You must traverse from the head node.

(b) Access of elements in linked list takes less time than arrays

❌ FALSE

Access time:

• Array → O(1) (direct indexing)

• Linked List → O(n) (sequential traversal)

So linked list access is slower, not faster.

(c) Arrays have better cache locality

✔ TRUE