Answer / santhosh k

Array size is fixed.But Linked is not fixed

Answer / santhosh k

Data acess is very faster in arrays

Answer / nidhi singh

memory requirement is less.
no pointers required..

Answer / chandan

Linked List have an extra Overhead in its each node to
store the pointer to the next node.

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.

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.

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 .

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.

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.

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.

What is namespace?

15 Answers  

What is abstraction example?

0 Answers  

What is the difference between declaration and definition?

20 Answers   IBS,

What is destructor oops?

0 Answers  

How to hide the base class functionality in Inheritance?

0 Answers   Viscus Infotech,

What is a friend function & its advantage?

1 Answers   MIT,

what does exactly the linker do?

1 Answers  

for example A,B,C,D are class all the 4 class contain one method who() but the method who() implementaion is differnet among each class. the relation among the 4 class are A is base class and is inherited by B and C.and from this two B and C where D is inherited. the question is i want to display the output who() method in all the classes(A,B,C,D)the output of who() method is diferrent amond all the class(A,B,C,D) ------A------ virtuval who(print a) override | | who(print b) B C override who(print c) | | -------D------ override who(print d)

2 Answers  

what is an qt4 interface?

1 Answers   IBM,

How does polymorphism work?

0 Answers  

Out of 4 concepts, which 3 C++ Follow?

1 Answers   TCS,

design class for linked list and include constructor,destructor,insert option. node of form struct node { int data; struct node &ptr; }

0 Answers