COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which of the following is/are not the dis-advantage of Linked list?
|
|
Linked list does not support random access
|
|
|
Memory is required to store next field
|
|
|
Searching takes time compared to arrays
|
|
|
None of the above
|
Explanation:
Detailed explanation-1: -Disadvantages of a Linked List over Array. 1) Memory Usage: The memory required by a linked list is more than the memory required by an array, as there is also a pointer field along with the data field in the linked list. The pointer field too requires memory to store the address of the next node.
Detailed explanation-2: -Memory usage: More memory is required in the linked list as compared to an array. Because in a linked list, a pointer is also required to store the address of the next element and it requires extra memory for itself.
Detailed explanation-3: -Slower Search Time: Linked list have slower search times than arrays as random access is not allowed.
There is 1 question to complete.