Question: If the memory allocation was as below when additional requests for Processes A (2K), B (6K), C (20K), D (25K), E (12K) and F (10K)

 If the memory allocation was as below when additional requests forProcesses A (2K), B (6K), C (20K), D (25K), E (12K) and

If the memory allocation was as below when additional requests for Processes A (2K), B (6K), C (20K), D (25K), E (12K) and F (10K) [in the mentioned sequence] were received, assuming the memory locations start from the first used chunk side before the 5K slot, what is the biggest slot that remains after the Worst fit allocation of these processes? Hole Hole Hole Hole Hole Hole Used Used Used Used Used Used 5K 50K 30K 7K 15K 2K 10K 7K 12K 15K 14K 9K If the memory allocation was as below when additional requests for Processes A (2K), B (6K), C (20K), D (25K), E (12K) and F (10K) [in the mentioned sequence] were received, assuming the memory locations start from the first used chunk side before the 5K slot, what is the smallest slot that remains after the Worst fit allocation of these processes? Hole Hole Hole Hole Hole Hole Used Used Used Used Used Used 5K 50K 30K 7K 15K 2K 7K 4K 2K 5K 1K

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!