Difference between Array and Link List-tccicomputercoaching.com

Before understanding difference between Array and Link List we see the definition of both.

Definition:

An array is a pre-allocated block of memory holding an ordered bunch of items. A linked list is a data structure with no pre-allocated memory, but rather each item in the list contains the address of "adjacent" items (the next one and the previous one).
Differences:

1. Arrays are linear data structures .
2. Array is index-based data structure.
3. Array elements can be modified easily by identifying the index value
4. Array elements cannot be added, deleted once it is declared.
5. The size of the array is fixed.
6. Stored in contiguous Memory Locations.
7. Memory Should be allocated at Compile-Time.

Linked list:

1. Linked lists are linear and non-linear data structures.
2. Linked lists is reference-based data structure.
3. It is a complex process for modifying the node in a linked list.
4. The nodes in the linked list can be added and deleted from the list.
5. Dynamic size
6. Extra memory space for a pointer is required with each element of the list.
7. In Linked list memory is allocated at Run-Time.

Do you want to know more about the Basics Programming Technology please visit the http://tccicomputercoaching.com/computer-course/

You can choose any course as per your interest at TCCI in Ahmedabad .

Call us @ 98256 18292.

Visit us@ http://tccicomputercoaching.com/computer-it-engineering-course/