0 Bewertungen0% fanden dieses Dokument nützlich (0 Abstimmungen)
30 Ansichten2 Seiten
This document contains 25 true/false questions about operating systems concepts like semaphores, deadlocks, starvation, virtual memory, and scheduling. It provides the question, a short statement to verify, and whether the statement is true or false. Key concepts covered include properties of binary semaphores, conditions for deadlock and starvation, memory management techniques like paging and buddy systems, and process states.
This document contains 25 true/false questions about operating systems concepts like semaphores, deadlocks, starvation, virtual memory, and scheduling. It provides the question, a short statement to verify, and whether the statement is true or false. Key concepts covered include properties of binary semaphores, conditions for deadlock and starvation, memory management techniques like paging and buddy systems, and process states.
This document contains 25 true/false questions about operating systems concepts like semaphores, deadlocks, starvation, virtual memory, and scheduling. It provides the question, a short statement to verify, and whether the statement is true or false. Key concepts covered include properties of binary semaphores, conditions for deadlock and starvation, memory management techniques like paging and buddy systems, and process states.
1 A binary semaphore takes on numerical values 0 and 1 only. True
2 An atomic operation is a machine instruction or a sequence of True instructions that must be executed to completion without interruption. 3 Deadlock is a situation in which two or more processes (or False threads) are waiting for an event that will occur in the future. 4 Starvation is a situation in which a process is denied access to a True resource because of the competitive activity of other, possibly unrelated, processes. 5 While a process is blocked on a semaphore's queue, it is engaged False in busy waiting. 6 Circular waiting is a necessary condition for deadlock, but not a True sufficient condition. 7 Mutual exclusion can be enforced with a general semaphore False whose initial value is greater than 1. 8 External fragmentation can occur in a paged virtual memory False system. 9 External fragmentation can be prevented (almost completely) by True frequent use of compaction, but the cost would be too high for most systems. 10 A page frame is a portion of main memory. True 11 Once a virtual memory page is locked into main memory, it False cannot be written to the disk. 12 Pages that are shared between two or more processes can never False be swapped out to the disk. 13 The allocated portions of memory using a buddy system are all False the same size. 14 Demand paging requires the programmer to take specific action to False force the operating system to load a particular virtual memory page. 15 Pre-paging is one possibility for the fetch policy in a virtual True memory system. 16 The resident set of a process can be changed in response to True actions by other processes. 17 The working set of a process can be changed in response to False actions by other processes. 48 18 The translation look aside buffer is a software data structure that False supports the virtual memory address translation operation. 19 In a symmetric multiprocessor, threads can always be run on any False processor. 20 Thrashing will never be a problem if the system has 1 GB of real False memory. 21 In paging systems, external fragmentation cannot occur. True 22 Race conditions cannot occur on a uni-processor. False 23 SJF can be implemented as a priority algorithm, where the False priority is determined by the arrival time of the job. 24 A process in the Ready state can only transition to Running or True Exit states. 25 The two-phase locking protocol guarantees that concurrent False transactions are deadlock-free.