NEW
Font size
S
M
L
XL
WorksheetsOS CH_7
Total questions: 65
Worksheet time: 29mins
Name
Class
Date
1.
Main memory divided into a number of static partitions at system generation time is ____________.
a)
fixed partitioning
b)
physical organization
c)
logical address
d)
physical address
2.
Main memory divided into a number of equal size frames is the _____________ technique.
a)
simple paging
b)
simple segmentation
c)
compaction
d)
relative address
3.
With ________ a process is loaded by loading all of its segments into dynamic partitions that need not be contiguous.
a)
simple segmentation
b)
simple paging
c)
compaction
d)
relative address
4.
One technique for overcoming external fragmentation is ___________.
a)
compaction
b)
simple paging
c)
compaction
d)
relative address
5.
A _______ is a particular example of logical address in which the address is expressed as a location relative to some known point, usually a value in a processor register.
a)
relative address
b)
logical address
c)
physical address
6.
The chunks of a process are known as ___________.
a)
pages
b)
frames
c)
internal fragmentation
d)
external fragmentation
7.
Available chunks of memory are known as __________.
a)
frames
b)
pages
c)
internal fragmentation
d)
external fragmentation
8.
The concept of Memory Management satisfies certain system requirements including: relocation, protection, and ___________.
a)
physical organization
b)
relative address
c)
logical address
d)
physical address
9.
In the Dynamic Partitioning technique of memory management, the placement algorithm that chooses the block that is closest in size to the request is called ____________.
a)
best fit
b)
next fit
10.
In the Dynamic Partitioning technique of memory management, the placement algorithm that scans memory from the location of the last placement and chooses the next available block that is large enough to satisfy the request is called __________.
a)
next fit
b)
best fit
11.
A problem with the largely obsolete Fixed Partitioning memory management technique is that of: inefficient use of memory, fixed number of processes, and ______________.
a)
internal fragmentation
b)
frames
c)
pages
d)
external fragmentation
12.
The page table for each process maintains _________.
a)
frame location for each page of the process
b)
pages
c)
internal fragmentation
d)
external fragmentation
13.
In a system employing a segmentation scheme for memory management wasted space is due to _______________.
a)
external fragmentation
b)
pages
c)
internal fragmentation
d)
frames
14.
In a system employing a paging scheme for memory management wasted space is due to ___________.
a)
internal fragmentation
b)
pages
c)
external fragmentation
d)
frames
15.
In a system employing a segmentation scheme for memory management a process is divided into ___________.
a)
segments which may not be of equal size
b)
segments which may not be have equal size
16.
The task of subdividing memory to accommodate multiple processes is carried out dynamically by the OS and is known as ___________.
a)
memory management
b)
frames
c)
pages
17.
A ___________ is a variable length block of data that resides in secondary memory.
a)
segment
b)
frames
c)
pages
18.
In a practice known as _________, the program and data are organized in such a way that various modules can be assigned the same region of memory with a main program responsible for switching the modules in and out as needed.
a)
overlaying
b)
internal fragmentation
c)
external fragmentation
19.
A _______ is an actual location in main memory
a)
physical address
b)
relative address
c)
logical address
20.
A fixed length block of data that resides in secondary memory is a _________.
a)
page
b)
segment
c)
frames
21.
When there is wasted space internal to a partition due to the fact that the block of data loaded is smaller than the partition is referred to as ___________.
a)
internal fragmentation
b)
external fragmentation
c)
segment
d)
frames
22.
______ in a computer system is organized as a linear, or one-dimensional address space, consisting of a sequence of bytes or words.
a)
main memory
b)
secondry memory
c)
vertual memory
23.
A ________ is a fixed length block of main memory.
a)
frame
b)
segment
c)
pages
24.
As time goes on, memory becomes more and more fragmented and memory utilization declines, creating a phenomenon referred to as __________.
a)
external fragmentation
b)
internal fragmentation
25.
A compromise to overcome the disadvantages of fixed partitioning and dynamic partitioning is the ___________.
a)
buddy system
b)
main memory
c)
secondry memory
d)
vertual memory
26.
A _________ is a reference to a memory location independent of the current assignment of data to memory.
a)
logical address
b)
physical address
c)
relative address
27.
The ________ shows the frame location for each page of the process.
a)
page table
b)
frame table
c)
segment table
28.
A ________ can occur as a result of a programming error when a process attempts to store data beyond the limits of a fixed size buffer and consequently overwrites adjacent memory locations.
a)
buffer overflow
b)
not buffer overflow
29.
Countermeasures to defend systems against attacks can be classified into two categories: compile-time defenses and ________.
a)
run-time defenses
b)
assemby defense
30.
The basic tools of memory management are paging and ___________.
a)
segmentation.
b)
frames
c)
pages
31.
In a uniprogramming system main memory is divided into two parts.
a)
true
b)
false
32.
The use of unequal size partitions provides a degree of flexibility to fixed partitioning.
a)
true
b)
false
33.
In a multiprogramming system the available main memory is not generally shared among a number of processes.
a)
true
b)
false
34.
Programs in other processes should not be able to reference memory locations in a process for reading or writing purposes without permission.
a)
true
b)
false
35.
The memory protection requirement must be satisfied by the OS rather than the processor.
a)
true
b)
false
36.
Any protection mechanism must have the flexibility to allow several processes to access the same portion of main memory.
a)
true
b)
false
37.
Secondary memory provides fast access at relatively high cost.
a)
true
b)
false
38.
A hardware mechanism is needed for translating relative addresses to physical main memory addresses at the time of execution of the instruction that contains the reference.
a)
true
b)
false
39.
In a mulitprogramming environment the programmer knows at the time of coding how much space will be available and where that space will be.
a)
true
b)
false
40.
Overlay programming wastes programmer time.
a)
true
b)
false
41.
The principal operation of memory management is to bring processes into main memory for execution by the processor.
a)
true
b)
false
42.
A physical address is the location of a word relative to the beginning of the program and the processor translates that into a logical address.
a)
true
b)
false
43.
A best-fit algorithm is usually the worst performer.
a)
true
b)
false
44.
All segments of all programs must be of the same length.
a)
true
b)
false
45.
Segmentation does not eliminate internal fragmentation.
a)
true
b)
false
46.
In a uniprogramming system main memory is divided into two parts.
a)
true
b)
false
47.
The use of unequal size partitions provides a degree of flexibility to fixed partitioning.
a)
true
b)
false
48.
In a multiprogramming system the available main memory is not generally shared among a number of processes.
a)
true
b)
false
49.
Programs in other processes should not be able to reference memory locations in a process for reading or writing purposes without permission.
a)
true
b)
false
50.
The memory protection requirement must be satisfied by the operating system rather than the processor.
a)
true
b)
false
51.
Any protection mechanism must have the flexibility to allow several processes to access the same portion of main memory.
a)
true
b)
false
52.
Secondary memory provides fast access at relatively high cost.
a)
true
b)
false
53.
A hardware mechanism is needed for translating relative addresses to physical main memory addresses at the time of execution of the instruction that contains the reference.
a)
true
b)
false
54.
In a multiprogramming environment the programmer knows at the time of coding how much space will be available and where that space will be.
a)
true
b)
false
55.
Overlay programming wastes programmer time.
a)
true
b)
false
56.
The principal operation of memory management is to bring processes into main memory for execution by the processor.
a)
true
b)
false
57.
A physical address is the location of a word relative to the beginning of the program and the processor translates that into a logical address.
a)
true
b)
false
58.
The best-fit algorithm is usually the worst performer.
a)
true
b)
false
59.
All segments of all programs must be of the same length.
a)
true
b)
false
60.
Segmentation does not eliminate internal fragmentation.
a)
true
b)
false
61.
Main memory divided into a number of static partitions at system generation time is _______ .
a)
fixed partitioning
b)
simple segmentation
c)
dynamic partitioning
d)
simple paging
62.
Main memory divided into a number of equal size frames is the __________ technique.
a)
simple paging
b)
dynamic partitioning
c)
fixed partitioning
d)
virtual memory segmentation
63.
With __________ a process is loaded by loading all of its segments into dynamic partitions that need not be contiguous.
a)
simple paging
b)
virtual memory segmentation
c)
virtual memory paging
d)
simple segmentations
64.
One technique for overcoming external fragmentation is
a)
loading
b)
relocation
c)
compaction
d)
partitioning
65.
A problem with the largely obsolete Fixed Partitioning memory management technique is that of:
a)
allowing only a fixed number of processes
b)
inefficient use of memory
c)
internal fragmentation
d)
all of the above
Reset
