CIT211




Category: CIT211

0

CIT211

1 / 50

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

2 / 50

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

3 / 50

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

4 / 50

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

5 / 50

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

6 / 50

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

7 / 50

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

8 / 50

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

9 / 50

I. Paging is a form of ______ relocation

10 / 50

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

11 / 50

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

12 / 50

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

13 / 50

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

14 / 50

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

15 / 50

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

16 / 50

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

17 / 50

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

18 / 50

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

19 / 50

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

20 / 50

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

21 / 50

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

22 / 50

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

23 / 50

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

24 / 50

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

25 / 50

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

26 / 50

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

27 / 50

AA. The behaviour of the processes __________ unsafe states

28 / 50

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

29 / 50

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

30 / 50

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

31 / 50

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

32 / 50

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

33 / 50

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

34 / 50

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

35 / 50

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

36 / 50

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

37 / 50

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

38 / 50

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

39 / 50

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

40 / 50

AN. In Unbounded capacity buffer, the sender never ______

41 / 50

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

42 / 50

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

43 / 50

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

44 / 50

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

45 / 50

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

46 / 50

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

47 / 50

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

48 / 50

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

49 / 50

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

50 / 50

AX. Blocking message passing is known as _________

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