Chapter 5 - OS2T

Question 1

The central themes of operating system design are all concerned with the management of processes and threads.

Answer

true

Question 2

It is possible in a single-processor system to not only interleave the execution of multiple processes but also overlap them

Answer

true

Question 3

As an extension of the principles of modular design and structured programming, some
applications can be effectively programmed as a set of concurrent processes.

Answer

true

Question 4

Race condition is a situation in which two or more processes continuously change their states in response to changes in the other process(es) without doing any useful work.

Answer

true

Question 5

The sharing of main memory among processes is useful to permit efficient and close interaction among processes because such sharing does not leads to many problems.

Answer

true

Question 6

When processes cooperate by communication, the various processes participate in a common effort that links all of the processes.

Answer

true

Question 7

Atomicity guarantees isolation from concurrent processes.

Answer

true

Question 8

Concurrent processes do not come into conflict with each other when they are competing for the use of the same resource.

Answer

true

Question 9

Two or more processes can cooperate by means of simple signals, such that a process can be forced to stop at a specified place until it has received a specific signal.

Answer

true

Question 10

The functioning of a process, and the output it produces, must be independent of the speed at which its execution is carried out relative to the speed of other concurrent processes.

Answer

true

Question 11

A process that is waiting for access to a critical section does not consume processor time.

Answer

true

Question 12

The case of cooperation by sharing covers processes that interact with other processes without being explicitly aware of them.

Answer

true

Question 13

It is possible for one process to lock the mutex and for another process to unlock it.

Answer

true

Question 14

On of the most common problems faced in concurrent processing is the producer/consumer problem.

Answer

true

Question 15

Processes need to be synchronized to enforce mutual exclusion.

Answer

true

Question 16

The management of multiple processes within a uniprocessor system is [blank_start]___________[blank_end].

Accepted Answer

multiprogramming

Question 17

A situation in which a runnable process is overlooked indefinitely by the scheduler, although it is able to proceed, is [blank_start]____________[blank_end].

Accepted Answer

starvation

Question 18

The requirement that when one process is in a critical section that access shared resources, no other process may be in a critical section that accesses any of those shared resources is [blank_start]____________[blank_end].

Accepted Answer

mutual exclusion

Question 19

A means for two processes to exchange information is with the use of [blank_start]____________[blank_end].

Accepted Answer

messages

Question 20

A semaphore that does not specify the order in which processes are removed from the queue is a [blank_start]_________[blank_end] semaphore.

Accepted Answer

weak

Question 21

A [blank_start]____________[blank_end] occurs when multiple processes or threads read and write data items so that the final result depends on the order of execution of instructions in the multiple processes.

Accepted Answer

race condition

Question 22

A [blank_start]___________[blank_end] is an integer value used for signaling among processes.

Accepted Answer

semaphore

Question 23

[blank_start]__________[blank_end] is when the sequence of instruction is guaranteed to execute as a group, or not execute at all, having no visible effect on system state.

Accepted Answer

atomic operation

Question 24

[blank_start]___________[blank_end] are memory words used as a synchronization mechanism.

Accepted Answer

event flags

Question 25

The term _________ refers to a technique in which a process can do nothing until it gets permission to enter its critical section but continues to execute an instruction or set of instructions that tests the appropriate variable to gain entrance.

Accepted Answer

spin waiting

Answer

message passing

Answer

critical resources

Answer

general semaphore

Question 26

A [blank_start]_______[blank_end] is a data type that is used to block a process or thread until a particular condition is true.

Accepted Answer

condition variable

Question 27

A semaphore whose definition includes the policy that the process that has been blocked the longest is released from the queue first is called a [blank_start]__________[blank_end] semaphore.

Accepted Answer

strong

Question 28

The [blank_start]__________[blank_end] is a programming language construct that provides equivalent functionality to that of semaphores and is easier to control.

Accepted Answer

monitor

Question 29

Probably the most useful combination, [blank_start]________[blank_end] allows a process to send one or more messages to a variety of destinations as quickly as possible.

Accepted Answer

nonblocking send, blocking receive

Question 30

A [blank_start]___________[blank_end] relationship allows multiple server processes to provide concurrent service to multiple clients.

Accepted Answer

many-to-many

Question 31

[blank_start]____________[blank_end] arises in three different contexts: multiple applications, structured application, and operating system structure.

Accepted Answer

concurrency

Question 32

[blank_start]_________[blank_end] was invented to allow processing time to be dynamically shared among a number of active applications.

Accepted Answer

multiprogramming

Question 33

A situation in which two or more processes are unable to proceed because each is waiting for one of the others to do something is a [blank_start]____________[blank_end].

Accepted Answer

deadlock

Question 34

In the case of competing processes three control problems must be faced: mutual exclusion, deadlock, and [blank_start]_________[blank_end].

Accepted Answer

starvation

Question 35

A [blank_start]______________[blank_end] is a semaphore that takes only the values of 0 and 1.

Accepted Answer

binary semaphore

Question 36

A situation in which multiple threads or processes read and write a shared data item and the final result depends on the relative timing of their execution is a [blank_start]________[blank_end].

Accepted Answer

race condition

Question 37

[blank_start]__________[blank_end] is a function or action implemented as a sequence of one or more instructions that appears to be indivisible; no other process can see an intermediate state or interrupt the operations.

Accepted Answer

atomic operation

Question 38

A [blank_start]___________[blank_end] is a programming language construct that encapsulates variables, access procedures, and initialization code within an abstract data type.

Accepted Answer

monitor

Question 39

[blank_start]__________[blank_end] is a section of code within a process that requires access to shared resources and that must not be executed while another process is in a corresponding section of code.

Accepted Answer

Critical section

Question 40

In the case of [blank_start]_________[blank_end], processes are sharing resources without being aware of the other processes.

Accepted Answer

competition

Question 41

A [blank_start]__________[blank_end] is a mutual exclusion mechanism in which a process executes in an infinite loop waiting for the value of a lock variable to indicate availability

Accepted Answer

spinlock

Question 42

Only three operations may be performed on a semaphore: initialize, increment, and [blank_start]__________[blank_end].

Accepted Answer

decrement

Question 43

A monitor supports synchronization by the use of [blank_start]_________[blank_end] that are contained within the monitor and accessible only within the monitor.

Accepted Answer

condition variables

Question 44

In the case of [blank_start]_______[blank_end], messages are not sent directly from sender to receiver but rather are sent to a shared data structure consisting of queues that can temporarily hold messages.

Accepted Answer

indirect addressing

Question 45

The classic concurrency problem that involves multiple readers that can read from a shared data area when no single writer is exclusively writing to it is the [blank_start]___________[blank_end]

Accepted Answer

problem

Chapter 5 - OS2T

Fragen in diesem Quiz (45)

Informationen

Feedback

Wie gefällt dir das neue Design?