1 / 50
A. Analytical methods of CPU scheduling algorithm evaluation use ____________ analysis to determine the performance of an algorithm
2 / 50
B. The _________ is the module that gives control of the CPU to the process selected by the short-term scheduler
3 / 50
C. In which of the following ways can a signal be delivered?
4 / 50
D. For the Banker's algorithm to work, it needs to know ________ things
5 / 50
E. _______ is the most general scheduling scheme, and also the most complex
6 / 50
F. A process goes from the ‘Ready’ state to ________ state
7 / 50
G. In which of the following address-binding scheme is the logical- and physical-address spaces differ?
8 / 50
H. Canceling a thread _________ may not free a necessary system-wide resource.
9 / 50
I. The benefits of multi-threading include the following except: ________
10 / 50
J. The decision to place the operating system in either low memory or high memory is affected by the location of the ________ vector
11 / 50
K. Turnaround Time does not include which of the following?
12 / 50
L. The class of OS that has very little user-interface capability, and no end-user utilities is __________ OS
13 / 50
M. __________ synchronization refers to the idea of keeping multiple copies of a data-set in coherence with one another.
14 / 50
N. Deadlock _______ requires that the operating system be given in advance additional information concerning which resources a process will request and use during its lifetime
15 / 50
O. The advantage of dynamic loading is that an _________ routine is never loaded
16 / 50
P. Blocking message passing is known as _________
17 / 50
Q. The behaviour of the processes __________ unsafe states
18 / 50
R. The goal of ___________ is to shuffle the memory contents to place all free memory together in one large block
19 / 50
S. The selection of the first-fit versus best-fit strategies can affect the amount of _________
20 / 50
T. Cancellation of a target thread may occur in ______ different scenarios
21 / 50
U. Under dynamic ___________ , all processes that use a language library execute only one copy of the library code
22 / 50
V. Which of the following schemes requires help from the operating system?
23 / 50
W. The task of terminating a thread before it has completed is called thread __________
24 / 50
X. The ________ mapping from virtual to physical addresses is done by the memory-management unit
25 / 50
Y. A nano-kernel is a very _________ operating system kernel
26 / 50
Z. With dynamic linking, a ______ is included in the image for each library-routine reference
27 / 50
AA. The concept of logical address space that is bound to a separate physical-address space is __________ to proper memory management
28 / 50
AB. ________ deadlocks can occur in distributed systems when distributed transactions or concurrency control is being used.
29 / 50
AC. The criteria for comparing CPU-scheduling algorithms include the following except: ________
30 / 50
AD. In a system that selects victims for rollback primarily on the basis of cost factors, _________ may occur
31 / 50
AE. Which of the following does the Banker's algorithm need to know to work?
32 / 50
AF. _________ is a technique of gradually increasing the priority of processes that wait in the system for a long time
33 / 50
AG. A solution to indefinite blocking of low-priority processes is __________
34 / 50
AH. In __________ capacity buffer, the sender must block until the recipient receives the message
35 / 50
AI. ________ Time is the interval from the time of submission of a process to the time of completion
36 / 50
AJ. Every logical address is bounded by the paging hardware to some ________ address
37 / 50
AK. ________ deadlocks are deadlocks that are detected in a distributed system but don't actually exist .
38 / 50
AL. The first problem in selecting a scheduling algorithm is defining the _________ to be used
39 / 50
AM. An I/O-bound program would typically have many very short ___________ bursts
40 / 50
AN. Paging is a form of ______ relocation
41 / 50
AO. Which of the following memory management algorithm suffers from external fragmentation?
42 / 50
AP. Under which of the following circumstances can CPU scheduling decisions take place?
43 / 50
AQ. With dynamic loading, a routine is not loaded until it is ________
44 / 50
AR. Under ________, all processes that use a language library execute only one copy of the library code
45 / 50
AS. Which of the following does the Banker's algorithm need to know to work?
46 / 50
AT. When a process creates a new process, _____ possibilities exist in terms of execution
47 / 50
AU. In Unbounded capacity buffer, the sender never ______
48 / 50
AV. Which of the following scheduling algorithms is a type of priority scheduling algorithm?
49 / 50
AW. _________ signals are delivered to the same process that performed the operation causing the signal
50 / 50
AX. ______ different types of implementation models relate fibers and kernel level threads
Rate this quiz