{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

sample-final - Name ID Sample Final 1 Name ID PART A Mark...

Info icon This preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Name _____________________________________ ID# ___________________ Sample Final 1
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Name _____________________________________ ID# ___________________ PART A Mark the following (T-F) questions using T for true, and F for false. Write your answers in the table provided below (page 4) . 1. There are solutions to synchronization problems that can be implemented using monitors, but cannot be implemented using semaphores. 2. Reentrant code is code that cannot be used by several users simultaneously, since it contains code that users can alter during execution. 3. Shared code in a segmentation scheme must have the same segment number for each user. 4. Throughput is the difference of time between submission of a job to its execution. 5. Global replacement states that the victim of replacement can be selected from any of the pages in the current process. 6. Thrashing is a phenomenon that occurs when the system spends excessive amount of time on DMA, compared to the execution of processes. 7. Privileged instructions cannot be executed in monitor mode.. 8. To handle memory swaps while performing I/O, we can lock the pages waiting for I/O into memory using a lock bit. 9. Banker's Algorithm can be used for deadlock avoidance when there are multiple instances of each resource type. 10. When using a single directory, users have no privacy and they must be careful in choosing file names. 11. An interrupt vector contains the saved program counter values of interrupted user programs. 12. In a system with only one instance of each resource type, the presence of a cycle in the wait for graph is sufficient to detect a deadlock. 2
Image of page 2