COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Arrays have better cache locality that can make them better in terms of performance
|
|
|
It is easy to insert and delete elements in Linked List
|
|
|
Random access is not allowed in a typical implementation of Linked Lists
|
|
|
Access of elements in linked list takes less time than compared to arrays
|
Detailed explanation-1: -6. Which of the following points is/are not true about Linked List data structure when it is compared with an array? Explanation: To access an element in a linked list, we need to traverse every element until we reach the desired element.
Detailed explanation-2: -Which of the following points is/are true about Linked List data structure when it is compared with array? Arrays have better cache locality that can make them better in terms of performance.
Detailed explanation-3: -Disadvantages of Linked Lists Memory consumption is more in Linked Lists when compared to arrays. Because each node contains a pointer in linked list and it requires extra memory. Elements cannot be accessed at random in linked lists. Traversing from reverse is not possible in singly linked lists.