Interested to Buy Any Domain ? << Click Here >> for more details...
Name an advantage of array over linked list?
- 24 Answers
- 60701 Views
- GML, IBM, Software Solutions, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / santhosh k
Array size is fixed.But Linked is not fixed
| Is This Answer Correct ? | 148 Yes | 31 No |
Answer / nidhi singh
memory requirement is less.
no pointers required..
| Is This Answer Correct ? | 91 Yes | 18 No |
Answer / chandan
Linked List have an extra Overhead in its each node to
store the pointer to the next node.
| Is This Answer Correct ? | 67 Yes | 5 No |
Answer / 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 |
Answer / anu
I think linked list is better when compared to arrays
because size of array is restricted to
declaration.Insertion/Deletion of values in middle of array
is not possible.
| Is This Answer Correct ? | 68 Yes | 16 No |
Answer / neha sharma
as arrays are static in nature, therefore all operations
like memory allocation occur at the time of compilation
only. So processor has to put less effort at its runtime .
| Is This Answer Correct ? | 43 Yes | 4 No |
Answer / amandeep singh bhatia
IN array we can directly access any element by index number
but in linked list if we want to access any element then we
have to go from starting and linearly we access that
element.
| Is This Answer Correct ? | 43 Yes | 11 No |
Answer / kiran
The Main advantage of array data structure is which is used
to hold like kind of data. in other words arrays hold
(save) similar kind of data items and array items stored in
contigues locations in memory. on the other hand link list
may hold unlike kind of data (group of data) and items
stored is not contigues in linked list.
| Is This Answer Correct ? | 23 Yes | 3 No |
Answer / eren tsanglao
Array can be access randomly and it can even access the
middle element by just the array name with the
subscript,eg, a[5].The elemente are allocated a contagious
memory.Whereas in linked list more space is required for
the pointer and the information.Accessing elements in
linked list is sequential.
| Is This Answer Correct ? | 26 Yes | 7 No |
Why do we use polymorphism?
What is the real time example of inheritance?
what is the difference between a package and a software?
WHAT IS THE ACTUAL DEFINATION OF OBJECT AND THE CLASS IN ONE SINGLE LINE WHICH THE INTERVIEWER WANT TO LISTEN.
What is a class?
32 Answers Infosys, TCS, Thylak,
Can main method override?
What is super in oop?
What is destructor example?
Can destructor be overloaded?
What is coupling in oops?
What is sub classing in c++?
what is function overloading..?
STL 
