Exam 19: Virtual Memory, Segmentation, and Disk Management
Exam 1: Operating System24 Questions
Exam 2: Operating System and Software25 Questions
Exam 3: Operating System and Computer Basics: Formatting, Clipboard, Radio Buttons, Bankers Algorithm, and More24 Questions
Exam 4: Computer Software and Operating System25 Questions
Exam 5: Processor and Memory Fundamentals24 Questions
Exam 6: Computer Architecture and Memory23 Questions
Exam 7: Computer Science and Information Technology on Raid, Middleware, and CPU Scheduling24 Questions
Exam 8: Understanding Process Scheduling in Operating Systems24 Questions
Exam 9: Operating System and Process Management25 Questions
Exam 10: Process Scheduling and Synchronization in Multi-Programming Environment25 Questions
Exam 11: Process Management and Interprocess Communication in Unix25 Questions
Exam 12: Semaphores, Spinlocks, and Monitors: Understanding Synchronization in Operating Systems25 Questions
Exam 13: Concurrency Control and Deadlock Prevention in Operating Systems25 Questions
Exam 14: Deadlock and Resource Allocation in Computer Systems25 Questions
Exam 15: Memory Management and Swapping Techniques24 Questions
Exam 16: Memory Management in Operating Systems25 Questions
Exam 17: Understanding Paging and Memory Management in Operating Systems24 Questions
Exam 18: Understanding Virtual Memory and Page Replacement Algorithms24 Questions
Exam 19: Virtual Memory, Segmentation, and Disk Management25 Questions
Exam 20: Disk Management and I/O Subsystem25 Questions
Exam 21: Linux Kernel and System Structures24 Questions
Exam 22: Thread Management and Synchronization in Operating Systems25 Questions
Exam 23: Operating System Concepts: System Calls, Threads, and Signals25 Questions
Exam 24: Operating System and Thread Pool24 Questions
Exam 25: Operating System and Memory Management25 Questions
Exam 26: Process Control and Memory Management25 Questions
Exam 27: Linux Kernel, File Systems, Bootloaders and Distributions9 Questions
Select questions type
If there are 32 segments, each of size 1Kb, then the logical address should have
Free
(Multiple Choice)
4.8/5
(33)
Correct Answer:
A
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by
Free
(Multiple Choice)
4.9/5
(38)
Correct Answer:
A
Consider a computer with 8 Mbytes of main memory and a 128K cache. The cache block size is 4 K. It uses a direct mapping scheme for cache management. How many different main memory blocks can map onto a given physical cache block?
Free
(Multiple Choice)
4.9/5
(38)
Correct Answer:
C
Magnetic tape drives can write data at a speed___________ disk drives.
(Multiple Choice)
4.9/5
(35)
The time taken for the desired sector to rotate to the disk head is called
(Multiple Choice)
4.8/5
(39)
Whenever a process needs I/O to or from a disk it issues a___________
(Multiple Choice)
4.9/5
(42)
A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because___________
(Multiple Choice)
4.8/5
(41)
___________ controller sends the command placed into it, via messages to the___________ controller.
(Multiple Choice)
4.8/5
(32)
The time taken to move the disk arm to the desired cylinder is called the___________
(Multiple Choice)
4.9/5
(38)
The heads of the magnetic disk are attached to a___________that moves all the heads as a unit.
(Multiple Choice)
4.7/5
(49)
When the entries in the segment tables of two different processes point to the same physical location___________
(Multiple Choice)
4.8/5
(34)
If a process needs I/O to or from a disk, and if the drive or controller is busy then
(Multiple Choice)
4.8/5
(34)
In___________information is recorded magnetically on platters.
(Multiple Choice)
4.9/5
(34)
What is the reason for using the LFU page replacement algorithm?
(Multiple Choice)
5.0/5
(43)
Showing 1 - 20 of 25
Filters
- Essay(0)
- Multiple Choice(25)
- Short Answer(0)
- True False(0)
- Matching(0)