CIT211




Category: CIT211

0

CIT211

1 / 50

A. __________ synchronization refers to the idea of keeping multiple copies of a data-set in coherence with one another.

2 / 50

B. The selection of the first-fit versus best-fit strategies can affect the amount of _________

3 / 50

C. The concept of logical address space that is bound to a separate physical-address space is __________ to proper memory management

4 / 50

D. In which of the following address-binding scheme is the logical- and physical-address spaces differ?

5 / 50

E. Cancellation of a target thread may occur in ______ different scenarios

6 / 50

F. _________ is a technique of gradually increasing the priority of processes that wait in the system for a long time

7 / 50

G. Which of the following does the Banker's algorithm need to know to work?

8 / 50

H. The advantage of dynamic loading is that an _________ routine is never loaded

9 / 50

I. In which of the following ways can a signal be delivered?

10 / 50

J. Deadlock _______ requires that the operating system be given in advance additional information concerning which resources a process will request and use during its lifetime

11 / 50

K. The criteria for comparing CPU-scheduling algorithms include the following except: ________

12 / 50

L. The decision to place the operating system in either low memory or high memory is affected by the location of the ________ vector

13 / 50

M. Every logical address is bounded by the paging hardware to some ________ address

14 / 50

N. Under ________, all processes that use a language library execute only one copy of the library code

15 / 50

O. Under dynamic ___________ , all processes that use a language library execute only one copy of the library code

16 / 50

P. _______ is the most general scheduling scheme, and also the most complex

17 / 50

Q. In a system that selects victims for rollback primarily on the basis of cost factors, _________ may occur

18 / 50

R. The _________ is the module that gives control of the CPU to the process selected by the short-term scheduler

19 / 50

S. In __________ capacity buffer, the sender must block until the recipient receives the message

20 / 50

T. Paging is a form of ______ relocation

21 / 50

U. The first problem in selecting a scheduling algorithm is defining the _________ to be used

22 / 50

V. When a process creates a new process, _____ possibilities exist in terms of execution

23 / 50

W. An I/O-bound program would typically have many very short ___________ bursts

24 / 50

X. In Unbounded capacity buffer, the sender never ______

25 / 50

Y. With dynamic loading, a routine is not loaded until it is ________

26 / 50

Z. Which of the following scheduling algorithms is a type of priority scheduling algorithm?

27 / 50

AA. A process goes from the ‘Ready’ state to ________ state

28 / 50

AB. Which of the following schemes requires help from the operating system?

29 / 50

AC. Canceling a thread _________ may not free a necessary system-wide resource.

30 / 50

AD. _________ signals are delivered to the same process that performed the operation causing the signal

31 / 50

AE. A solution to indefinite blocking of low-priority processes is __________

32 / 50

AF. Which of the following does the Banker's algorithm need to know to work?

33 / 50

AG. The behaviour of the processes __________ unsafe states

34 / 50

AH. ________ Time is the interval from the time of submission of a process to the time of completion

35 / 50

AI. The class of OS that has very little user-interface capability, and no end-user utilities is __________ OS

36 / 50

AJ. A nano-kernel is a very _________ operating system kernel

37 / 50

AK. ________ deadlocks are deadlocks that are detected in a distributed system but don't actually exist .

38 / 50

AL. Which of the following memory management algorithm suffers from external fragmentation?

39 / 50

AM. Analytical methods of CPU scheduling algorithm evaluation use ____________ analysis to determine the performance of an algorithm

40 / 50

AN. The benefits of multi-threading include the following except: ________

41 / 50

AO. For the Banker's algorithm to work, it needs to know ________ things

42 / 50

AP. Blocking message passing is known as _________

43 / 50

AQ. ______ different types of implementation models relate fibers and kernel level threads

44 / 50

AR. Turnaround Time does not include which of the following?

45 / 50

AS. The ________ mapping from virtual to physical addresses is done by the memory-management unit

46 / 50

AT. With dynamic linking, a ______ is included in the image for each library-routine reference

47 / 50

AU. The goal of ___________ is to shuffle the memory contents to place all free memory together in one large block

48 / 50

AV. ________ deadlocks can occur in distributed systems when distributed transactions or concurrency control is being used.

49 / 50

AW. The task of terminating a thread before it has completed is called thread __________

50 / 50

AX. Under which of the following circumstances can CPU scheduling decisions take place?

Rate this quiz




Hello NOUNITES! Join other NOUNITES on Whatsapp and Telegram below, EXCLUSIVE UPDATES awaits you from various study centres and happenings in NOUN. Stay updated
 
Don't miss out, JOIN OVER 22,000 other students already following our platforms

FOLLOW WHATSAPP CHANNEL  FOLLOW TELEGRAM CHANNEL 
    
JOIN WHATSAPP GROUP   JOIN TELEGRAM GROUP
close-link