In a system employing a memory management strategy that doesn't require an entire process to be in main memory at one time; the portion of a process that is actually in main memory at any given time is defined to be the resident set of the process.
True | |
False |
The modify (M) bit is a control bit in a page table entry that indicates whether the contents of the corresponding page have been altered since the page was last loaded into memory.
True | |
False |
The task of subdividing and allocating memory between the O/S and processes is performed automatically by the O/S and is called:
Protection |
|
Relocation |
|
Memory Management |
|
None of these are the correct term |
The problem of internal fragmentation can be lessened in systems employing a fixed-partition memory management scheme by using:
Random size partitions |
|
Equal size partitions |
|
Unequal size partitions |
|
None of these will lessen internal fragmentation in fixed-partitioning |
The situation where the processor spends most of its time swapping process pieces rather than executing instructions is called:
Paging |
|
The Principle of Locality |
|
Thrashing |
|
None of these are the described situation |
In a system employing a memory management strategy that doesn't require an entire process to be in main memory at one time; the portion of a process that is actually in main memory at any given time is defined to be the resident set of the process.
Ans) True
The modify (M) bit is a control bit in a page table entry that indicates whether the contents of the corresponding page have been altered since the page was last loaded into memory.
Ans) True
The task of subdividing and allocating memory between the O/S and processes is performed automatically by the O/S and is called:
c) Memory Management
The problem of internal fragmentation can be lessened in systems employing a fixed-partition memory management scheme by using
c) Unequal size partitions
The situation where the processor spends most of its time swapping process pieces rather than executing instructions is called:
C) Thrashing
In a system employing a memory management strategy that doesn't require an entire process to be...
I need help with this problem.I am currenlty struggelling
with it.
Consider a computer system using paging, where the address space
of every process has a size of C = 2c bytes and the page size is S
= 2s bytes. Each entry in the page table uses E bytes.
Calculate the number of pages of a process, and the size of a
page table (in bytes).
Assume that the space wasted by a process in main memory is
defined...