Loading...




Category: CIT211

0

CIT211

1 / 50

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

2 / 50

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

3 / 50

Cancellation of a target thread may occur in ______ different scenarios

4 / 50

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

5 / 50

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

6 / 50

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

7 / 50

Blocking message passing is known as _________

8 / 50

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

9 / 50

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

10 / 50

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

11 / 50

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

12 / 50

Paging is a form of ______ relocation

13 / 50

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

14 / 50

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

15 / 50

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

16 / 50

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

17 / 50

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

18 / 50

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

19 / 50

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

20 / 50

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

21 / 50

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

22 / 50

In Unbounded capacity buffer, the sender never ______

23 / 50

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

24 / 50

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

25 / 50

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

26 / 50

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

27 / 50

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

28 / 50

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

29 / 50

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

30 / 50

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

31 / 50

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

32 / 50

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

33 / 50

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

34 / 50

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

35 / 50

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

36 / 50

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

37 / 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

38 / 50

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

39 / 50

A nano-kernel is a very _________ operating system kernel

40 / 50

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

41 / 50

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

42 / 50

Turnaround Time does not include which of the following?

43 / 50

The behaviour of the processes __________ unsafe states

44 / 50

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

45 / 50

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

46 / 50

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

47 / 50

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

48 / 50

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

49 / 50

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

50 / 50

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

Rate this quiz