Category: CIT211 0 CIT211 1 / 50 Turnaround Time does not include which of the following? time executing on the CPU and doing I/O time waiting in the ready queue none of the above the sum of the periods spent waiting to get into memory 2 / 50 Which of the following scheduling algorithms is a type of priority scheduling algorithm? shortest-jobfirst round-robin none of the above first-comefirst-served 3 / 50 Under dynamic ___________ , all processes that use a language library execute only one copy of the library code Check 4 / 50 Which of the following memory management algorithm suffers from external fragmentation? best-fit first-fit worst fit all of the above 5 / 50 _________ signals are delivered to the same process that performed the operation causing the signal Check 6 / 50 The selection of the first-fit versus best-fit strategies can affect the amount of _________ Check 7 / 50 The behaviour of the processes __________ unsafe states Check 8 / 50 An I/O-bound program would typically have many very short ___________ bursts Check 9 / 50 ________ deadlocks are deadlocks that are detected in a distributed system but don't actually exist . Check 10 / 50 The concept of logical address space that is bound to a separate physical-address space is __________ to proper memory management Check 11 / 50 The first problem in selecting a scheduling algorithm is defining the _________ to be used Check 12 / 50 When a process creates a new process, _____ possibilities exist in terms of execution one two four none of the above 13 / 50 Canceling a thread _________ may not free a necessary system-wide resource. isochronously asynchronously synchronously all of the above 14 / 50 The task of terminating a thread before it has completed is called thread __________ Check 15 / 50 In which of the following ways can a signal be delivered? Deliver the signal to every thread in the process Deliver the signal to certain threads in the process Any of the above Deliver the signal to the thread to which the signal applies 16 / 50 The advantage of dynamic loading is that an _________ routine is never loaded Check 17 / 50 ________ Time is the interval from the time of submission of a process to the time of completion Check 18 / 50 Which of the following schemes requires help from the operating system? dynamic loading overlays dynamic linking none of the above 19 / 50 Which of the following does the Banker's algorithm need to know to work? How much of each resource the system has available all of the above How much of each resource each process could possibly request How much of each resource each process is currently holding 20 / 50 In __________ capacity buffer, the sender must block until the recipient receives the message Check 21 / 50 In Unbounded capacity buffer, the sender never ______ Check 22 / 50 Under which of the following circumstances can CPU scheduling decisions take place? When a process switches from the waiting state to the ready state When a process switches from the running state to the waiting state When a process switches from the running state to the ready state all of the above 23 / 50 For the Banker's algorithm to work, it needs to know ________ things Check 24 / 50 ______ different types of implementation models relate fibers and kernel level threads Two Four Three None of the above 25 / 50 Paging is a form of ______ relocation Check 26 / 50 In a system that selects victims for rollback primarily on the basis of cost factors, _________ may occur Check 27 / 50 __________ synchronization refers to the idea of keeping multiple copies of a data-set in coherence with one another. Check 28 / 50 The class of OS that has very little user-interface capability, and no end-user utilities is __________ OS network real-time batch processing time-sharing 29 / 50 The goal of ___________ is to shuffle the memory contents to place all free memory together in one large block Check 30 / 50 Deadlock _______ requires that the operating system be given in advance additional information concerning which resources a process will request and use during its lifetime Check 31 / 50 A solution to indefinite blocking of low-priority processes is __________ Check 32 / 50 The decision to place the operating system in either low memory or high memory is affected by the location of the ________ vector Check 33 / 50 A nano-kernel is a very _________ operating system kernel Check 34 / 50 With dynamic linking, a ______ is included in the image for each library-routine reference Check 35 / 50 Every logical address is bounded by the paging hardware to some ________ address Check 36 / 50 The benefits of multi-threading include the following except: ________ economy resource sharing within the process increased responsiveness to the user none of the above 37 / 50 Which of the following does the Banker's algorithm need to know to work? How much of each resource each process could possibly request How much of each resource each process is currently holding How much of each resource the system has available all of the above 38 / 50 _________ is a technique of gradually increasing the priority of processes that wait in the system for a long time Check 39 / 50 Under ________, all processes that use a language library execute only one copy of the library code dynamic linking all of the above overlays dynamic loading 40 / 50 _______ is the most general scheduling scheme, and also the most complex First-come-first-serve Multilevel feedback queue Shortest-jobfirst Multilevel queue 41 / 50 In which of the following address-binding scheme is the logical- and physical-address spaces differ? Compile time Execution time Load time All of the options 42 / 50 The ________ mapping from virtual to physical addresses is done by the memory-management unit all of the above Load time Run-time Compile time 43 / 50 Blocking message passing is known as _________ Check 44 / 50 The _________ is the module that gives control of the CPU to the process selected by the short-term scheduler Check 45 / 50 The criteria for comparing CPU-scheduling algorithms include the following except: ________ Throughput CPU Utilization None of the above Turnaround Time 46 / 50 ________ deadlocks can occur in distributed systems when distributed transactions or concurrency control is being used. Check 47 / 50 Analytical methods of CPU scheduling algorithm evaluation use ____________ analysis to determine the performance of an algorithm Check 48 / 50 A process goes from the ‘Ready’ state to ________ state finished waiting running ready 49 / 50 With dynamic loading, a routine is not loaded until it is ________ Check 50 / 50 Cancellation of a target thread may occur in ______ different scenarios four two three none of the above Restart quiz Rate this quiz Send feedback
