1) Whenever a thread references a part of the virtual address space that is not currently loaded in the primary memory, the OS suspends execution and loads the missing information from another portion of primary memory
2) Contiguous block allocation does not accommodate dynamic file sizes well, and suffers from external fragmentation.
3) Significant performance increases can be obtained in an OS by overlapping I/O operations into file buffers, with CPU activity
4) Microsoft Windows XP is a multi-threaded, preemptive kernel
5) Unlike the round robin scheduling algorithm, rate-monotonic algorithms assign a static priority using no preemption; the priority is based inversely on the period of the task.
6) A thread should always be able to distinguish between being temporarily blocked and deadlocked.
7) Device drivers implement the device independent aspects of device management.
8) If an individual thread is unable to take advantage of the overlap of CPU and I/O operations, the OS can overlap the CPU execution of one thread with the I/O operation of other threads.
9) Randomly accessed storage devices allow a driver to access blocks in an arbitrary order, without incurring an order-dependent performance penalty.
10) SSTF is a superior strategy because it successfully avoids starvation.