An array is simply a collection of variables of similar 
datatype while a linklist is a collection of nodes where 
each node is a combination of a data value and pointer to 
another record.

an array allocates continous memory allocation whereas a 
linked list does not allocates continous memory,

in array we are having limted memory size(by intializing the
array size).but in the linked list we dont want to intialize
the size because it is the list of elements.there will many
tyes of linked list,by our requirements we can use any one
of the linkedlist.

array is static ,where we need to intialize the size in 
starting , but linkelist is dynamic , we can dynamically 
add the any variable in to the list

In an array elments accessing is easy. Accessing time of 
1st element and 1000th element is same,but not in linked lists.

I accept the answer 2 ,then we can delete the specified 
node in the linked list,but the same thing we can't do in 
arrays..

Array is statically allocated group.  Linked list is 
dynamically allocated group.

We can allocate memory DYNAMICALLY in linked list where as 
in array static allocation of memory is there. In array 
contiguous memory allocation procedure is there where as in 
linked list we can allocatememory where we want.

An array is simply a collection of variables of similar 
datatype while a linklist is a collection of nodes where 
each node is a combination of a data value and pointer to 
another record.

A linked list consists of data nodes, each pointing to the 
next in the list. An array consists of contiguous chunks 
memory of predetermined size

In linkedlist,The operations(delete,insert&etc)are eazily
perform.Where as in arrays that is not possible.