Lec32-Numerical on Variable Size Partitioning

[@engineeringwing7469]

Please note that internal fragmentation does not exist in variable partitioning because the left over space can be reused for another process.

[@sihisihi653]

First fit and worst fit both are making use of memory in similar way(p2,p3,p1,p4),why did you consider only the worst fit as the efficient algorithm ?

[@engineeringwing7469]

Make a correction pl..In this example both First Fit and Worst Fit are equally good and both are making efficient use of memory.

[@sihisihi653]

Ma'am In first fit,why didn't you allocate left over memory 50 kb for p2 after allocating memory for p1? Bcz It starts searching either at the beginning or where the previous search ended.

[@engineeringwing7469]

Bcoz the algorithm says to start searching from beginning if empty partitions are available otherwise it can start from wherever the previous search ends..In this case we found empty partitions available in the beginning of the memory.

[@tarunraj3342]

Mam In the best fit there will be internal fragmentation... Which is 25kb+25kb = 50kb . It is correct mam.?

[@engineeringwing7469]

In variable size Partitioning, process is allocated according to the required size of the process, hence Internal fragmentation is not applicable here. The left over space is resulting after a process moves out and another process moves in....initially the complete memory is available for processes.

[@tarunraj3342]

@@engineeringwing7469 Then there will be no internal fragmentation mam.

[@engineeringwing7469]

Yes, no internal Fragmentation but external Fragmentation can exist.