In Linux,up to a total of 256MB of usable memory can be configured into equal-sized page frames,which can be grouped to give more contiguous space to a job.These groups can also be split to accommodate smaller jobs.The process of grouping and splitting usable memory is known as the ____.
A) process algorithm
B) grouping algorithm
C) buddy algorithm
D) group/split algorithm

Question

Quizplus · Accepted Answer

The process described is known as the buddy algorithm, where usable memory is divided into pages and grouped together to form larger contiguous spaces, which can then be split to accommodate smaller jobs. The other options given do not accurately describe this process.

In Linux,up to a Total of 256MB of Usable Memory