COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Efficient Memory Utilization
|
|
|
Not cache friendly
|
|
|
Dynamic Data Structure
|
|
|
Insertion and Deletion Operations are Easier
|
Detailed explanation-1: -Memory Usage: The memory used by LinkedList is more because we also need to store the address of the next data. Accessing an element: We can not access any element of the LinkedList directly. We don’t have direct access to every element of LinkedList.
Detailed explanation-2: -linked list and similar structures are NOT CPU cache friendly because each node can be randomly arranged in memory resulting in many cache misses.
Detailed explanation-3: -Arrays allow random access and require less memory per element (do not need space for pointers) while lacking efficiency for insertion/deletion operations and memory allocation. On the contrary, linked lists are dynamic and have faster insertion/deletion time complexities.