Name an advantage of array over linked list?
- 24 Answers
- 57454 Views
- GML, IBM, Software Solutions, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / gurpreet kaur
In arrays memory requirement is less as a refrence is not
required whereas memory for the data as well as for the
pointer is required and hence the overhead.
Arrays allow random access, any element can be accessed
using the subscript whereas linked lists allow sequential
access, accessing of any element requires processing of the
list from the beginning upto the element.
| Is This Answer Correct ? | 17 Yes | 4 No |
Answer / shruthi
1. Arrays have continguous memory allocation which makes it
easy to access elements inbetween.
2. As memory is allocated during compilation makes the
program faster
3. Fixed in size so if we are aware of the exact size of
datas then there can be no memory wastage which is also an
advantage linked list has.
4. Insertion and deletion at the end of the array is easy
but not inbetween.
5. Accessing data is easy a[2] etc
| Is This Answer Correct ? | 13 Yes | 0 No |
Answer / s.a. babu
an array can be created easily and quickly just by
declaration.
| Is This Answer Correct ? | 9 Yes | 1 No |
Answer / dinesh jalandhar
we can use binary search in case of array , which is not
possible in case of linklist........because in linklist it
is not possible to access the middle element of linklist
directly
| Is This Answer Correct ? | 8 Yes | 1 No |
Answer / upasna
Function of bubble sort can not be performed in link list
which is quite easy to perform in arrays
| Is This Answer Correct ? | 15 Yes | 10 No |
Answer / atul kumar gupta
1-:array is working the concept of sequential.but linked
list is not provid the go directaly access the any alement.
2-:linked list are very complicated comparing the array
becouse the consist the two part which frst part is contain
the item and second is contain address of next node,so that
these are complicated compare then array.
| Is This Answer Correct ? | 7 Yes | 2 No |
Answer / aditi
Arrays are of types one ,2,multi dimensional but link list
have types singleand doubly which further has types
circular,header,circular header link list.
| Is This Answer Correct ? | 9 Yes | 5 No |
Answer / nisha
Addresing is possible in case of arrays where as in linked list sequential address is possible
| Is This Answer Correct ? | 4 Yes | 0 No |
Answer / p.madhupriya
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 .
linkedlist uses dynamic memory allocation
| Is This Answer Correct ? | 4 Yes | 0 No |
What is meant by oops concept?
difference between structure and union.
What is an example of genetic polymorphism?
Is oop better than procedural?
difine hierarchical inheritance.
Why is static class not inherited?
can main method be overloaded...??? How..????
What is abstraction encapsulation?
What is interface? When and where is it used?
What is the differances between a abstract calss and interface
why to use operator overloading
Write pseudo code for push in a stack?
STL 
