Linked List for Dynamic Partitioning
The better and the most popular approach to keep track the free or filled partitions is using Linked List.
In this approach, the Operating system maintains a linked list where each node represents each partition. Every node has three fields.
If a partition is freed at some point of time then that partition will be merged with its adjacent free partition without doing any extra effort.
There are some points which need to be focused while using this approach.