CIT211

Category: CIT211

CIT211

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?

1. Deliver the signal to every thread in the process

2. Deliver the signal to certain threads in the process

3. Any of the above

4. Deliver the signal to the thread to which the signal applies

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

1. First-come-first-serve

2. Shortest-jobfirst

3. Multilevel queue

4. Multilevel feedback queue

6 / 50

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

1. finished

2. ready

3. running

4. waiting

7 / 50

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

1. All of the options

2. Load time

3. Execution time

4. Compile time

8 / 50

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

1. all of the above

2. isochronously

3. asynchronously

4. synchronously

9 / 50

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

1. increased responsiveness to the user

2. none of the above

3. resource sharing within the process

4. economy

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?

1. none of the above

2. time executing on the CPU and doing I/O

3. time waiting in the ready queue

4. the sum of the periods spent waiting to get into memory

12 / 50

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

1. batch processing

2. time-sharing

3. network

4. real-time

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

1. four

2. none of the above

3. two

4. three

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?

1. none of the above

2. overlays

3. dynamic loading

4. dynamic linking

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

1. all of the above

2. Run-time

3. Load time

4. Compile time

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: ________

1. CPU Utilization

2. None of the above

3. Throughput

4. Turnaround Time

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?

1. all of the above

2. How much of each resource each process is currently holding

3. How much of each resource each process could possibly request

4. How much of each resource the system has available

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?

1. best-fit

2. first-fit

3. all of the above

4. worst fit

42 / 50

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

1. When a process switches from the running state to the waiting state

2. When a process switches from the waiting state to the ready state

3. all of the above

4. When a process switches from the running state to the ready state

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

1. dynamic linking

2. all of the above

3. overlays

4. dynamic loading

45 / 50

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

1. How much of each resource each process could possibly request

2. How much of each resource each process is currently holding

3. How much of each resource the system has available

4. all of the above

46 / 50

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

1. one

2. none of the above

3. two

4. four

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?

1. shortest-jobfirst

2. none of the above

3. round-robin

4. first-comefirst-served

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

1. None of the above

2. Two

3. Four

4. Three

Rate this quiz