NEW
Font size
S
M
L
XL
WorksheetsOS CH8_1
Total questions: 45
Worksheet time: 23mins
Name
Class
Date
1.
The size of virtual storage is limited by the actual number of main storage locations.
a)
true
b)
false
2.
The addresses a program may use to reference memory are distinguished from the addresses the memory system uses to identify physical storage sites.
a)
true
b)
false
3.
Most of the memory management issues confronting the operating system designer are in the are of paging when segmentation is combined with paging.
a)
true
b)
false
4.
Segmentation is not visible to the programmer.
a)
true
b)
false
5.
The placement policy determines where in real memory a process piece is to reside.
a)
true
b)
false
6.
Virtual memory allows for very effective multiprogramming and relieves the user of the unnecessarily tight constraints of main memory.
a)
true
b)
false
7.
The principle of locality states that program and data references within a process do not tend to cluster.
a)
true
b)
false
8.
The smaller the page size, the greater the amount of internal fragmentation.
a)
true
b)
false
9.
The design issue of page size is related to the size of physical main memory and program size.
a)
true
b)
false
10.
Segments may be of unequal, indeed dynamic, size.
a)
true
b)
false
11.
The page currently stored in a frame may still be replaced even when the page is locked.
a)
true
b)
false
12.
One way to counter the potential performance problems of a variable-allocation global scope policy is to use page buffering.
a)
true
b)
false
13.
The PFF policy evaluates the working set of a process at sampling instances based on elapsed virtual time.
a)
true
b)
false
14.
A precleaning policy writes modified pages before their page frames are needed so that pages can be written out in batches.
a)
true
b)
false
15.
UNIX is intended to be machine independent; therefore its memory management scheme will vary from one system to the next.
a)
true
b)
false
16.
The address of a storage location in main memory is the _________.
a)
real address
b)
virtual address space
c)
address space
17.
__________ is the virtual storage assigned to a process.
a)
virtual address space
b)
real address
c)
address space
18.
_________ is the range of memory addresses available to a process.
a)
address space
b)
virtual address space
c)
real address
19.
The _______ structure indexes page table entries by frame number rather than by virtual page number.
a)
inverted page table
b)
page table
c)
frame table
20.
The _______ states the process that owns the page.
a)
process identifier
b)
process state
21.
A __________ is issued if a desired page is not in main memory.
a)
page fault
b)
page error
22.
___________ allows the programmer to view memory as consisting of multiple address spaces.
a)
segmentation
b)
paging
23.
_________ is transparent to the programmer and eliminates external fragmentation providing efficient use of main memory.
a)
paging
b)
segmentation
24.
The _________ determines when a page should be brought into main memory.
a)
fetch policy
b)
Replacement Policy
c)
Placement Policy
25.
With ________ pages other than the one demanded by a page fault are brought in.
a)
prepaging
b)
Demand Paging
c)
Placement Policy
26.
The _______ policy results in the fewest number of page faults.
a)
optimal
b)
LRU
c)
FIFO
27.
A ________ chooses only among the resident pages of the process that generated the page fault in selecting a page to replace.
a)
local replacement policy
b)
fetch policy
c)
Placement Policy
28.
The ________ algorithm requires a use bit to be associated with each page in memory.
a)
page fault frequency
b)
page Size
c)
page error
29.
________ is where modified process pages can be written out at the time of replacement, or a precleaning policy can be used, which clusters the output activity by writing out a number of pages at once.
a)
Cleaning policy
b)
fetch policy
c)
Replacement Policy
d)
Placement Policy
30.
_________ is the concept associated with determining the number of processes that will be resident in main memory.
a)
Load control
b)
Replacement Scope
31.
The address assigned to a location in virtual memory to allow that location to be accessed as though it were part of main memory is the ___________.
a)
virtual address
b)
Virtual memory
c)
Virtual address space
32.
_________ is the storage allocation scheme in which secondary memory can be addressed as though it were part of main memory.
a)
virtual memory
b)
virtual address
c)
Virtual memory
d)
Virtual address space
33.
The size of virtual storage is limited by the addressing scheme of the computer system and by the amount of ___________ available
a)
secondary memory
b)
main memory
34.
The ______ policy treats the page frames allocated to a process as a circular buffer and pages are removed in a round robin style.
a)
FIFO
b)
optimal
c)
LRU
35.
The portion of a process that is actually in main memory at any time is defined to be the ____________ of the process.
a)
resident set
b)
fetch policy
c)
Replacement Policy
d)
Placement Policy
36.
A __________ policy allows the number of page frames allocated to a process to be varied over the lifetime of the process.
a)
variable allocation
b)
Fixed-allocation
37.
Because a process executes only in main memory, that memory is referred to as ______________.
a)
real memory
b)
Virtual memory
38.
When the system spends most of its time swapping pieces rather than executing instructions it leads to a condition known as ____________.
a)
thrashing
b)
resident set
c)
fetch policy
39.
To overcome the problem of doubling the memory access time, most virtual memory schemes make use of a special high-speed cache for page table entries called a ____________.
a)
translation lookaside buffer
b)
Memory Management Formats
40.
The technique where the processor is equipped with hardware that allows it to interrogate simultaneously a number of TLB entries to determine if there is a match on page number is referred to as ______________.
a)
associative mapping
b)
Thrashing
41.
With _________, a page is brought into main memory only when a reference is made to a location on that page.
a)
demand paging
b)
prepaging
c)
Placement Policy
42.
The ___________ policy replaces the page in memory that has not been referenced for the longest time.
a)
least recently used
b)
most recently used
43.
The __________ provides a virtual memory capability that allocates page frames in main memory to processes and also allocates page frames to disk block buffers.
a)
paging system
b)
segmentation
44.
Linux makes use of a three-level page table structure consisting of the following types of tables: page directory, page table, and ___________.
a)
page middle directory
b)
page end directory
c)
page begin directory
45.
In SVR4 and Solaris systems, the memory management scheme that manages memory allocation for the kernel is called the ____________.
a)
kernel memory allocator
b)
user memory allocator
Reset
