Scribd
Upload
6 views1 page

Operating System

The document discusses memory allocation using three algorithms: first fit, best fit, and worst fit for processes of varying sizes. First fit allocates memory in the first available partition, best fit uses the smallest suitable partition, and worst fit uses the largest available partition. The best fit algorithm is determined to be the most efficient in utilizing memory.

Uploaded by

okandapaul12
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views1 page

Operating System

The document discusses memory allocation using three algorithms: first fit, best fit, and worst fit for processes of varying sizes. First fit allocates memory in the first available partition, best fit uses the smallest suitable partition, and worst fit uses the largest available partition. The best fit algorithm is determined to be the most efficient in utilizing memory.

Uploaded by

okandapaul12
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

6.

Given five memory partitions of 100kb, 500kb, 200kb,300kb 600kb(in order)


how would first fit , best fit and worst fit algorithm place processes of 212kb
417kb, 112kb and 426kb (in order) which algorithm makes the most effective
use of the memory

1 First fit
Allocate the process in the first free large enough portion . 426 is not locate a portion

100kb
212 500kb
112 200kb
300kb
417 600kb

[Link] fit
Allocate the process in the smallest possible portion

100kb
417 500kb
112 200kb
212 300kb
426 600kb

[Link] fit
Allocate the largest memory to store process

100kb
417 500kb
200kb
112 300kb
212 600kb
The best fit has most efficient of the memory

You might also like