1.
When using the clock page replacement policy, a page with a reference bit of ____ is replaced.
A) -1
B) 0
C) 1
D) 5
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | B | |
2.
The segmented/demand paged memory allocation scheme offers the logical benefits of segmentation, as well as the physical benefits of paging.
A) True
B) False
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | True | |
3.
____ gives users the appearance that their programs are being completely loaded in main memory during their entire processing time.
A) Segmenting
B) Virtual memory
C) Shared memory
D) Multithreading
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | B | |
4.
Studies have shown that having any ____, even a small one, can substantially improve the performance of the computer system.
A) cache
B) memory block
C) page block
D) block
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | A | |
5.
Every time an instruction is executed, or a data value is used, the operating system (or the hardware) must translate the job space address, which is relative, into its physical address, which is absolute.
A) True
B) False
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | True | |
6.
One sector will hold one page of job instructions and fit into one page frame of memory.
A) True
B) False
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | True | |
7.
With demand paging, jobs are divided into equally sized ____ that initially reside in secondary storage.
A) pages
B) blocks
C) frames
D) sets
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | A | |
8.
To access a location in memory when using segmented memory management, the address is composed of two entries: ____.
A) the segment number and the line number
B) the segment number and the displacement
C) the line number and the displacement
D) the segment number, the line number, and the displacement
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | B | |
9.
If a particular demand paging configuration has 9 page interrupts out of 11 page requests, failure rate is ____.
A) 18%
B) 52%
C) 82%
D) 95%
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | C | |
10.
The first-in first-out (FIFO) page replacement policy will remove the pages that have been in memory the shortest.
A) True
B) False
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | False | |
11.
There are ____ entries per page in the PMT.
A) 0
B) 1
C) 2
D) 5
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | B | |
12.
The cache hit ratio is ____, if the total number of requests is 10 and 6 of those are found in cache memory.
A) 6%
B) 10%
C) 60%
D) 100%
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | C | |
Attempt 2
1.
Consider the following page fault handler algorithm. Replace the * in the algorithm with ____.
1 If there is no free page frame
Then
select page to be swapped out using page removal algorithm
update job’s Page Map Table
If content of page had been changed then
*
End if
End if
2 Use page number from step 3 from the Hardware Instruction Processing Algorithm to get disk address where the requested page is stored
3 Read page into memory
4 Update job’s Page Map Table
5 Update Memory Map Table
6 Restart interrupted instruction
A) save page to main memory
B) write page to disk
C) mark page as being changed in PMT
D) choose another page
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | B | |
2.
When using a FIFO scheme, more memory will always result in better performance.
A) True
B) False
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | False | |
3.
One sector will hold one page of job instructions and fit into one page frame of memory.
A) True
B) False
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | True | |
4.
The ____ policy is based on the theory that the best page to remove is the one that has been in memory the longest.
A) TRU
B) LRU
C) LIFO
D) FIFO
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | D | |
5.
Assume that the Page Map Table below is in effect. The number of lines per page is 400. The actual memory location for line 433 is ____.
Job Page Number Page Frame Number
0 8
1 10
2 5
3 11
A) 1
B) 33
C) 4000
D) 4033
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | D | |
6.
When there is an excessive amount of page swapping between main memory and secondary storage, the operation becomes inefficient, which is called ____.
A) excessive demand paging
B) hot swapping
C) thrashing
D) overswapping
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | C | |
7.
In general, when a job is allocated to the CPU its Page Map Table is loaded into main memory while the Segment Map Tables are loaded only as needed.
A) True
B) False
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | False | |
8.
A job’s working set is the set of pages residing in memory that can be accessed indirectly.
A) True
B) False
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | False | |
9.
A variation of the LRU page replacement algorithm is known as the clock page replacement policy because it is implemented with a circular queue and uses a pointer to step through the reference bits of the active pages, simulating a clockwise motion.
A) True
B) False
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | True | |
10.
Within the Memory Manager the Segment Link Table lists details about each segment (one for each job).
A) True
B) False
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | False | |
11.
Consider the following four cases. The LRU policy,____, will be least likely to swap.
Modified Referenced Meaning
Case 1 0 0 Not modified AND not referenced
Case 2 0 1 Not modified BUT was referenced
Case 3 1 0 Was modified BUT not referenced
Case 4 1 1 Was modified AND was referenced
A) Case 1
B) Case 2
C) Case 3
D) Case 4
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | D | |
12.
To access a location in memory when using segmented memory management, the address is composed of two entries: ____.
A) the segment number and the line number
B) the segment number and the displacement
C) the line number and the displacement
D) the segment number, the line number, and the displacement
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | B | |
Attempt 3
1.
There are ____ entries per page in the PMT.
A) 0
B) 1
C) 2
D) 5
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | B | |
2.
The key to the successful implementation of demand paging is the use of a direct access memory device that can work directly with the CPU.
A) True
B) False
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | False | |
3.
Every time an instruction is executed, or a data value is used, the operating system (or the hardware) must translate the job space address, which is relative, into its physical address, which is absolute.
A) True
B) False
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | True | |
4.
The ____ policy is based on the theory that the best page to remove is the one that has been in memory the longest.
A) TRU
B) LRU
C) LIFO
D) FIFO
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | D | |
5.
The term ____, means that during any phase of its execution, the program references only a small fraction of its pages.
A) dynamic paging
B) structured programming
C) locality of reference
D) working set
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | C | |
6.
When there is an excessive amount of page swapping between main memory and secondary storage, the operation becomes inefficient, which is called ____.
A) excessive demand paging
B) hot swapping
C) thrashing
D) overswapping
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | C | |
7.
In the PMT, the ____ bit for all pages in memory is 1.
A) status
B) referenced
C) modified
D) frame
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | A | |
8.
One of the most important innovations of demand paging was that it made ____ feasible.
A) memory demand
B) virtual demand
C) virtual paging
D) virtual memory
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | D | |
9.
____ can be thought of as being an intermediary between main memory and the special-purpose registers, which are the domain of the CPU.
A) Virtual memory
B) Cache memory
C) Paging
D) Segmenting
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | B | |
10.
One sector will hold one page of job instructions and fit into one page frame of memory.
A) True
B) False
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | True | |
11.
To move in a new page, a resident page must be swapped back into primary storage.
A) True
B) False
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | False | |
12.
Assume that the Page Map Table below is in effect. The number of lines per page is 400. The actual memory location for line 433 is ____.
Job Page Number Page Frame Number
0 8
1 10
2 5
3 11
A) 1
B) 33
C) 4000
D) 4033
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | D | |
Attempt 4
1.
Consider the following page fault handler algorithm. Replace the * in the algorithm with ____.
1 If there is no free page frame
Then
select page to be swapped out using page removal algorithm
update job’s Page Map Table
If content of page had been changed then
*
End if
End if
2 Use page number from step 3 from the Hardware Instruction Processing Algorithm to get disk address where the requested page is stored
3 Read page into memory
4 Update job’s Page Map Table
5 Update Memory Map Table
6 Restart interrupted instruction
A) save page to main memory
B) write page to disk
C) mark page as being changed in PMT
D) choose another page
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | B | |
2.
During the second generation, programmers started dividing their programs into sections that resembled working sets, really segments, originally called roll in/roll out and now called ____.
A) undermaps
B) overmaps
C) underlays
D) overlays
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | D | |
3.
In general, when a job is allocated to the CPU its Page Map Table is loaded into main memory while the Segment Map Tables are loaded only as needed.
A) True
B) False
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | False | |
4.
The use of virtual memory requires cooperation between the Memory Manager (which tracks each page or segment) and the processor hardware (which issues the interrupt and resolves the virtual address).
A) True
B) False
| Points Earned: | 0.0/1.0 | |
| Correct Answer(s): | True | |
5.
Demand paging was the first widely used scheme that removed the restriction of having the entire job in memory from the beginning to the end of its processing.
A) True
B) False
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | True | |
6.
The Job Table (JT) contains two entries for each active job: the size of the job and the memory location where its Page Map Table is stored.
A) True
B) False
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | True | |
7.
The address of the beginning of a page frame is found by multiplying the page frame number by the number of frames.
A) True
B) False
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | False | |
8.
Assume that the Page Map Table below is in effect. The number of lines per page is 400. The actual memory location for line 433 is ____.
Job Page Number Page Frame Number
0 8
1 10
2 5
3 11
A) 1
B) 33
C) 4000
D) 4033
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | D | |
9.
To find the exact position of an instruction in memory, after the page number and displacement has been calculated, the operating system refers to the job’s PMT to find out which page frame contains the page.
A) True
B) False
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | True | |
10.
____ can be thought of as being an intermediary between main memory and the special-purpose registers, which are the domain of the CPU.
A) Virtual memory
B) Cache memory
C) Paging
D) Segmenting
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | B | |
11.
Demand paging requires that the Page Map Table for each job keep track of each page as it is loaded or removed from main memory.
A) True
B) False
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | True | |
12.
Each page of a job is actually stored in a page frame that can be located anywhere in available main memory.
A) True
B) False
| Points Earned: | 1.0/1.0 | |
| Correct Answer(s): | True | |
