PRETEST 04
When a page fault occurs before an executing instruction is complete if ____________
=> the instruction must be restarted
CPU use ______________ when there is thrashing. => Decreases
If a process is thrashing ____________ => it is spending more time paging than
executing
.SSTF algorithm, like SJF __________ of some requests. => may cause starvation
Compared to page replacement algorithms, segment replacement techniques are
more difficult because ____________ => Segments have variable sizes
When a program tries to access a page that is loaded in physical memory but not
mapped in address space, then ____________ => page fault occurs
Users _______ that their processes are running on a paged system. => are unaware
Consider the following page reference string: 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6
For Optimal page replacement algorithms with 3 frames, the number of page faults
is? =>
Whenever the page fault rate is minimal ____________ => the effective access time
decreases
.____________________ is possible thanks to virtual memory. = > execution of a
process that may not be completely in memory
In virtual memory. the coder__________ of overlays. => does not have to take care
A program is generally composed of several different localities, which _____ overlap
=> may
Optimal page – replacement algorithm is difficult to implement, because
____________ => it requires future knowledge of the reference string
When a page is selected for replacement, and its modify bit is set ____________ =>
the page has been modified since it was read in from the disk & page is dirty
.What is the Optimal page – replacement algorithm? => Replace the page that will
not be used for a long time
The maximum number of frames per process is defined by ____________ => the
amount of available physical memory
. ____________ has a direct correlation with effective access time. => page-fault rate
.A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D,
E. If the page replacement algorithm is FIFO, the number of page transfers with an
empty internal store of 3 frames is? => 9
.Locality of reference denotes that a process ____________ is referencing a page. =>
will always be to the page used in the previous page reference
LRU page – replacement algorithm associates with each page the ______ => the
time of that page’s last use
With either equal or proportional algorithm, a high priority process is treated
___________ a low priority process. => same as
._____________ usually implements virtual memory => demand paging
There is swap space in ____________ => secondary memory
In the ______ algorithm, the disk arm goes as far as the final request in each
direction, then reverses direction immediately without going to the end of the disk.
=> LOOK
.If no frames are free, _____ page transfer(s) is/are required. => two
Virtual memory makes it possible for ____________ to share memory. => for
processess
.A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D,
E. If the page replacement algorithm is FIFO, the number of page frames is
increased to 4, then the number of page transfers ____________ => increases
______replacement allows a process to select a replacement frame from the set of
all frames, even if the frame is currently allocated to some other process. => Global
.If the overall size of the working set exceeds the total number of frames available
____________ => the operating system selects a process to suspend
When does a page fault occur? => a page cannot be accessed due to its absence from
memory
The instruction being carried out must be in ____________ => physical memory
When a page needs to be replaced in the FIFO page replacement process,
____________ => oldest page is chosen
The choice of _____________________ affects the working set's precision. => working
set size
.In this situation, what does the valid - invalid bit mean? => the page is not in
memory
If the working set window is inadequate____________ => it will not encompass entire
locality
Whenever a process needs I/O to or from a disk it issues a ______________ => system
call to the operating system
When a page needs to be replaced, which algorithm selects the one that hasn't
been accessed for the longest amount of time? => least recently used algorithm
Whenever the working set window is too big ____________ =>it may overlap several
localities
._________ replacement allows each process to only select from its own set of
allocated frames. => local
._____ is a concept where a process is copied from the secondary memory into the
main memory as needed. => demand paging
.A memory page containing a heavily used variable that was initialized very early
and is in constant use is removed, then the page replacement algorithm used is
____________ => FIFO
A subroutine's call signals ____________ => it defines a new locality
The pager is focused on the ____________ => individual page of a process
Magnetic tape drives can write data at a speed ________ disk drives. => much lesser
than
A pager is interested in specific process _________, whereas a swapper manipulates
________________. -> pages, the entire process
The minimum number of frames to be allocated to a process is decided by the
____________ => instruction set architecture
The algorithm in which we split m frames among n processes, to give everyone an
equal share, m/n frames is known as ____________ => equal allocation algorithm
One problem with the global replacement algorithm is that ____________ => a
process cannot control its own page – fault rate
Consider a machine in which all memory reference instructions have only one memory
address, for them we need at least _____ frame(s). => two
The advantages of being able to run a program that is only partially in memory
include ____________ => All of the mentioned
________ replacement generally results in greater system throughput. => Global
Error handler codes, to deal with uncommon issues are ___________ => almost never
executed
A FIFO replacement algorithm associates with each page the _______ => time it was
brought into the memory
Locality is ____________________ => a set of pages that are actively used together
.Random access in magnetic tapes is _________ compared to magnetic disks. => is
very slow
.The working set at time t1 (….7 5 1) is _____________ if DELTA = 10 in the working
set model, for: 2 6 1 5 7 7 7 7 5 1 6 2 3 4 1 2 3 4 4 4 3 4 3 4 4 4 1 3 2 3 => {1, 6, 5,
7, 2}
Employing a pager ____________ => decreases the swap time & amount of
physical memory needed
When a page fault happens, the interrupted process's state is____________ => saved
On media that use constant linear velocity (CLV), the _____________ is uniform. -> the
density of bits per track
If a process needs I/O to or from a disk, and if the drive or controller is busy then
____________ => the request will be placed in the queue of pending requests for that
drive
.Consider the following page reference string: 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6
For LRU page replacement algorithm with 4 frames, the number of page faults is?
=> 10
.Consider the following page reference string: 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6
For LRU page replacement algorithm with 5 frames, the number of page faults is?
=>8
For 3 page frames, the following is the reference string: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2
0 1 7 0 1 How many page faults does the LRU page replacement algorithm produce?
=> 12
Consider the following page reference string: 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6
For FIFO page replacement algorithms with 4 frames, the number of page faults is?
=> 14
Consider the following page reference string: 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6
For FIFO page replacement algorithms with 3 frames, the number of page faults is?
=> 16
The working set at time t1 (….7 5 1) is _____________ if DELTA = 10 in the working
set model, for: 2 6 1 5 7 7 7 7 5 1 6 2 3 4 1 2 3 4 4 4 3 4 3 4 4 4 1 3 2 3 => {1, 6, 5,
7, 2}
The page replacement working set concept is based on the _______________
assumption. => locality
.In the ______ algorithm, the disk arm starts at one end of the disk and moves
toward the other end, servicing requests till the other end of the disk. At the
other end, the direction is reversed and servicing continues.
Select one:
C-LOOK
SCAN
C-SCAN
LOOK
.Consider a disk queue with requests for I/O to blocks on cylinders: 98 183 37
122 14 124 65 67 Considering SSTF (shortest seek time first) scheduling, the
total number of head movements is, if the disk head is initially at 53 is?
Select one:
245
236
240
224
.Whenever a process starts up but has no pages in memory?
Select one:
process execution becomes impossible
a page fault occurs for every page brought into memory
process causes system crash
none of the mentioned
.What are the two methods of the LRU page replacement policy that can be
implemented in hardware?
Select one:
Stack & Counters
Registers
RAM & Registers
Counters
.Consider a disk queue with requests for I/O to blocks on cylinders: 98 183 37
122 14 124 65 67 Considering FCFS (first cum first served) scheduling, the
total number of head movements is, if the disk head is initially at 53 is?
Select one:
620
640
600
630
.The aim of creating page replacement algorithms is to ____________
Select one:
increase the page fault rate
decrease the page fault rate
replace pages faster
to allocate multiple pages to processes
