Exam 8: Virtual Memory
Exam 1: Computer Systems Overview45 Questions
Exam 2: Operating System Overview45 Questions
Exam 3: Process Description and Control45 Questions
Exam 4: Threads45 Questions
Exam 5: Concurrency: Mutual Exclusion and Synchronization45 Questions
Exam 6: Concurrency: Deadlock and Starvation45 Questions
Exam 7: Memory Management45 Questions
Exam 8: Virtual Memory45 Questions
Exam 9: Uniprocessor Scheduling45 Questions
Exam 10: Multiprocessor and Real-Time Scheduling45 Questions
Exam 11: Io Management and Disk Scheduling45 Questions
Exam 12: File Management45 Questions
Exam 13: Embedded Operating Systems45 Questions
Exam 14: Computer Security Threats45 Questions
Exam 15: Computer Security Techniques45 Questions
Exam 16: Distributed Processing, Clientserver, and Clusters45 Questions
Exam 17: Network Protocols45 Questions
Exam 18: Distributed Process Management45 Questions
Select questions type
The page currently stored in a frame may still be replaced even when the page is locked.
(True/False)
4.9/5
(38)
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 __________ .
(Short Answer)
4.9/5
(47)
The size of virtual storage is limited by the addressing scheme of the computer system and by the amount of __________ available.
(Short Answer)
4.8/5
(39)
_________ 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.
(Multiple Choice)
4.8/5
(24)
The addresses a program may use to reference memory are distinguished from the addresses the memory system uses to identify physical storage sites.
(True/False)
4.7/5
(38)
The PFF policy evaluates the working set of a process at sampling instances based on elapsed virtual time.
(True/False)
4.8/5
(37)
__________ is the range of memory addresses available to a process.
(Multiple Choice)
4.7/5
(23)
A __________ policy allows the number of page frames allocated to a process to be varied over the lifetime of the process.
(Short Answer)
4.9/5
(41)
When the system spends most of its time swapping pieces rather than executing instructions it leads to a condition known as _________ .
(Short Answer)
4.8/5
(43)
One way to counter the potential performance problems of a variable-allocation global scope policy is to use page buffering.
(True/False)
4.9/5
(42)
The size of virtual storage is limited by the actual number of main storage locations.
(True/False)
4.8/5
(34)
The smaller the page size, the greater the amount of internal fragmentation.
(True/False)
4.7/5
(37)
Virtual memory allows for very effective multiprogramming and relieves the user of the unnecessarily tight constraints of main memory.
(True/False)
4.9/5
(47)
A _________ chooses only among the resident pages of the process that generated the page fault in selecting a page to replace.
(Multiple Choice)
4.8/5
(36)
With _________ pages other than the one demanded by a page fault are brought in.
(Multiple Choice)
4.8/5
(33)
The placement policy determines where in real memory a process piece is to reside.
(True/False)
4.8/5
(47)
The __________ provides a virtual memory capability that allocates page frames in main memory to processes and also allocates page frames to disk block buffers.
(Short Answer)
4.9/5
(33)
UNIX is intended to be machine independent; therefore its memory management scheme will vary from one system to the next.
(True/False)
4.8/5
(47)
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 __________ .
(Short Answer)
4.7/5
(41)
Showing 21 - 40 of 45
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)