Name an advantage of linked list over array?
- 11 Answers
- 22611 Views
- IBM, Infosys, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / manoj kumar jha
1. Array size is fix and cannot change at run time,But in
link list we can create memory accoring to requirement.
2. In array we define but at the run time it is not used so
in that case memory is waste.
| Is This Answer Correct ? | 44 Yes | 3 No |
Answer / ritesh parkhi
array always contain static memory location even linklist
contain dynamic memory location.In once declaration of an
array we can store smae type of data but in linkedlist
hetrogeneous link list is possible which can be contain
diffrent diffrent types of data type in linkedlist.in link
list we are using void pointer.
| Is This Answer Correct ? | 33 Yes | 4 No |
Answer / satish kondapalli
computer memory is divided into blocks.each work use these
blocks in non-contigious manner.but array elements are
stored in continous memory allocation.this will adversely
affect unuse of the memory blocks.array searches for bigger
blocks it needed,so that many small nlocks of memory is
unused.the main advantage of linkedlist is it can use
non-continuous memory blocks,because of it has the relation
between the nodes,and this is main merit over array.
| Is This Answer Correct ? | 16 Yes | 1 No |
Answer / azhar iqbal
Array is of fix size & contain always same type of data.
Whereas linklist is dynamic in size.And a type of linklist
have capability to store different type of data at its
nodes, and for doing that we use void pointer( a pointer
that can point any type of data )
| Is This Answer Correct ? | 14 Yes | 2 No |
Answer / kabir
Insertion & deletion are relatively easy in linked list.
| Is This Answer Correct ? | 7 Yes | 0 No |
Answer / amandeep singh bhatia
In array we can directly access any element by index number
but in Linked list it is not possible,in linked list if we
want to access any element then we go from starting node.
| Is This Answer Correct ? | 12 Yes | 8 No |
Answer / dinesh kumar thakur jalandhar
------> in case of linklist no continuous memeory is
required .but in case of array there is of need continuous
memory block , mean to say if we have enough free memory but
is not in continuous block than we can not use it in case of
array .
but same memery can be used in case of linklist.
| Is This Answer Correct ? | 6 Yes | 3 No |
Answer / amarpreet
getting an element from array is easybut from linked list
it is difficult because you have to search from start node
and traverse through each and every node
| Is This Answer Correct ? | 10 Yes | 8 No |
Answer / ranveer singh
array contains static memory even linklist contains dynamic
mrmory location
| Is This Answer Correct ? | 0 Yes | 1 No |
What is the different between Applet and Application?
what is a class
How Do you Code Composition and Aggregation in C++ ?
How is data security provided in Object Oriented languages? ?
can you give real time example for polymarphism
How many human genes are polymorphic?
The type of variable a pointer points to must be the part of pointer's definition so that:
What is the difference between C++ and java?
Given two strings like x=?hello? and y=?open?, remove any character from string x which is also used in string y, thus making the result x=?hll?.
What type of loop is a for loop?
In OverLoading concept,Why they are not consider return value and why they are consider only parameters in method? For ex: public int Add(int a,int b){...} public String Add(int a,int b){...}
swapping program does not use third variable
STL 
