Difference between sequential allocation and linked allocation
Sequential allocation |
Linked allocation |
Static in nature. | Dynamic in nature. |
Required to estimate the capacity of the structure. | Not required. |
All memory locations are consecutive in nature. Therefore computed addressing is possible. | Need not be. It works based on pointer addressing. |
Two logically adjacent elements are also physically adjacent. | Not necessarily. Therefore each data element should hold the address of its next logically adjacent element. This can be a bottleneck problem. |
Support direct accessing or addressing of data. | Sequential addressing or accessing of data. |
In a strict sense, deletion, and insertion operations are prohibited. | Insertion and deletion operation is possible and is straight forward. |
Splitting and merging operation is also prohibited. However, these can be realized by data movement with extra memory allocation. This can be sometimes a bottleneck problem. | Possible and straight forward. |
No such problem. | Loss of address results with loss of the structure (tail end). |