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