4. This diagram shows an example of memory configuration under dynamic partitioning after many placement and swapping-out operations have been carried out. Addresses go from left to right; gray areas indicate blocks occupied by processes; white blocks indicate free memory blocks. The last process placed is 2-Mbyte and is marked with an X. Only one process was swapped out after that. 4M 「u txsu SM 2M 4M 3M a. If you are to add a new 10MB process in the memory, where could it possibly be added and why? b. What was the maximum size of the swapped-out process? c. What was the size of the free block just before it was partitioned by X? 21 Page
4. This diagram shows an example of memory configuration under dynamic partitioning after many placement and swapping-out operations have been carried out. Addresses go from left to right; gray areas indicate blocks occupied by processes; white blocks indicate free memory blocks. The last process placed is 2-Mbyte and is marked with an X. Only one process was swapped out after that. 4M 「u txsu SM 2M 4M 3M a. If you are to add a new 10MB process in the memory, where could it possibly be added and why? b. What was the maximum size of the swapped-out process? c. What was the size of the free block just before it was partitioned by X? 21 Page
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter12: Points, Classes, Virtual Functions And Abstract Classes
Section: Chapter Questions
Problem 19SA
Related questions
Question
Hepp

Transcribed Image Text:4. This diagram shows an example of memory configuration under dynamic partitioning after many
placement and swapping-out operations have been carried out. Addresses go from left to right; gray
areas indicate blocks occupied by processes; white blocks indicate free memory blocks. The last
process placed is 2-Mbyte and is marked with an X. Only one process was swapped out after that.
4M
「u txsu
SM
2M
4M
3M
a. If you are to add a new 10MB process in the memory, where could it possibly be added and
why?
b. What was the maximum size of the swapped-out process?
c. What was the size of the free block just before it was partitioned by X?
21 Page
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning

Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,

C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr

C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning

Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,

C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr

Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning

Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage