Q1. Explain Multiple Partition Allocation Schema?
Ans. One of the simplest methods of allocating memory is to divide memory into several fixed sized partitions. Each partition may contain exactly one process. In this multiple partition method, when a partition is free, a process is selected from the input queue and is loaded into the free partition. When the process terminates, the partition becomes available for another process.
In the fixed partition scheme, the operating system keeps a table indicating which parts of memory are available and which are occupied. Initially, all memory is available for user processes and is considered one large block of available memory, a hole. When a process arrives and needs memory, we search for a whole large enough for this process. If we find one, we allocate only as much memory as is needed, keeping the rest available to satisfy future requests.