Name an advantage of array over linked list?
- 24 Answers
- 57717 Views
- GML, IBM, Software Solutions, I also Faced
- E-Mail Answers
Answer Posted / sumeet choudhury
Arrays have random access and less overheads compared to
Linked list have sequential access only with too much
overheads and no cache memory support.
On the other hand, arrays allow random access, while linked
lists allow only sequential access to elements. Singly-
linked lists, in fact, can only be traversed in one
direction. This makes linked lists unsuitable for
applications where it's useful to look up an element by its
index quickly, such as heapsort. Sequential access on
arrays is also faster than on linked lists on many machines
due to locality of reference and data caches. Linked lists
receive almost no benefit from the cache.
Another disadvantage of linked lists is the extra storage
needed for references, which often makes them impractical
for lists of small data items such as characters or boolean
values. It can also be slow, and with a naïve allocator,
wasteful, to allocate memory separately for each new
element, a problem generally solved using memory pools.
| Is This Answer Correct ? | 64 Yes | 10 No |
Post New Answer View All Answers
Give two or more real cenario of virtual function and vertual object
What is the diamond problem in inheritance?
Why oops is important?
What is the real time example of encapsulation?
Why do we use class in oops?
What is coupling in oops?
How to improve object oriented design skills?
Why is it so that we can have virtual constructors but we cannot have virtual destructors?
What is abstraction example?
What are the two different types of polymorphism?
how to get the oracle certification? send me the answer
What is multilevel inheritance explain with example?
What is variable example?
What is overloading in oop?
What is encapsulation with example?
