Final Exam Quiz Review

Question 1

_____ assigns a processor to the first process in the ready queue

Answer 1

Dispatching

Question 2

An operating system must be designed such that…

Answer 2

Context switches are transparent to processes

Question 3

What operation is particularly useful for detecting security threats and debugging software?

Answer 3

Suspend

Question 4

What does a process control block do?

Answer 4

Store the address of the next instruction to be processed by a different process.

Question 5

For a single processor system, there will never be more than ____ running process(es)

Answer 5

One

Question 6

When a process is created by a unix fork() call, what is not inherited by the child process?

Answer 6

The process ID

Question 7

What kind of state transition is not possible?

Answer 7

Blocked to running

Question 8

A process switch might occur when the system encounters an interrupt condition, such as that generated by…

Answer 8

Supervisor call, memory fault, and trap

Question 9

When a process is in the ____ state it is in secondary memory but is available for execution as soon as it is loaded into main memory

Answer 9

Ready/Suspend

Question 10

The concept of process in an operating system embodies two primary characteristics, one of which is:

Answer 10

Resource ownership

Question 11

LWP is placed between…

Answer 11

User and kernel threads

Question 12

The basic thread operation related to the change in thread state that occurs when thread needs to wait for an event is referred to as:

Answer 12

Block operation

Question 13

In a linux system, if the process has been terminated but, for some reason, still must have its task structure in the process table is in the ____ state.

Answer 13

Zombie

Question 14

To overcome the disadvantages of ULT, a technique is used to convert a blocking system call into a non-blocking system call:

Answer 14

Jacketing

Question 15

In a solaris system, a user-level thread that enters the active state is assigned to a:

Answer 15

Light-weight process (LWP)

Question 16

What is the relationship between processes and threads in terms of time?

Answer 16

It takes far less time to create a new thread in an existing process than it does to create a new process.

Question 17

Pure user-level thread implementations are usually ____ thread mappings

Answer 17

many-to-one

Question 18

The threading model supported by the linux operating system is:

Answer 18

one-to-one

Question 19

Which type of process interaction might result in the problem “data coherence”?

Answer 19

Cooperation by sharing

Question 20

The initial value of the semaphore that allows only one of the many processes to enter their critical sections is..

Answer 20

1

Question 21

A ____ is a data type that is used to block a process or thread until a particular condition is true.

Answer 21

Condition variable

Question 22

An instruction that executes atomically executes as a ____ unit.

Answer 22

Single/uninterruptible

Question 23

A _____ refers to where a process is accessing/updating shared data

Answer 23

Critical section

Question 24

In message passing, when does the condition “rendezvous” arise?

Answer 24

Blocking send, blocking receive

Question 25

Probably the most useful combination, _____ allows a process to send one or more messages to a variety of destinations as quickly as possible.

Answer 25

Nonblocking send, blocking receive.

Question 26

The _____ is a programming language that construct that provides equivalent functionality to that of semaphores and is easier to control.

Answer 26

Monitor

Question 27

____ is when the sequence of instruction is guaranteed to execute as a group or not execute at all. No other process can see an intermediate step or interrupt the operation.

Answer 27

Atomic operation

Question 28

(T/F) Deadlock can be defined as the periodic blocking of a set of processes that either compete for system resources or communicate with each other.

Answer 28

False

Question 29

(T/F) Both banker's algorithm and process initiation denial belong to deadlock avoidance

Answer 29

True

Question 30

(T/F) Although deadlock can potentially exist without it, the condition known as Circular Wait is required for deadlock to actually take place

Answer 30

True

Question 31

(T/F) In the Resource Allocation Denial approach to Deadlock Avoidance, a safe state is defined as one in which all potential process sequences do not result in deadlock.

Answer 31

False

Question 32

(T/F) A reusable resource is one that can safely be used by only one process at a time and is not depleted by that use

Answer 32

True

Question 33

One necessary condition for deadlock is ____, which states that at least one resource must be held in a non-sharable mode.

Answer 33

Mutual exclusion

Question 34

The approach of adopting a policy that eliminates one of the four conditions leading to a deadlock state is defined as ...

Answer 34

Deadlock prevention

Question 35

The dining philosopher's problem is a standard test case for evaluating approaches of implementing...

Answer 35

Synchronization

Question 36

What is a weakness of banker's algorithm?

Answer 36

Requiring that processes state their maximum needs in advance

Question 37

When is a system in an unsafe state?

Answer 37

The OS cannot guarantee that all processes can complete their work in a finite time

Question 38

____ is the number of processes per time unit that are completed.

Answer 38

Throughput

Question 39

In RR scheduling, the time quantum should be ____ the context-switch time.

Answer 39

Large with respect to

Question 40

An IO bound process spends ____ its time seeping IO operations than it does doing computational work.

Answer 40

More of

Question 41

In the case of the ____ policy, the scheduler always chooses the process that has the shortest expected remaining processing time.

Answer 41

SRT/Shortest remaining time

Question 42

A risk with ____ is the possibility of starvation for longer processes as long as there is a steady supply of shorter processes

Answer 42

SPN/Shortest process next?

Question 43

One difficulty with the shortest process next scheduling technique is:

Answer 43

Starvation of long processes, lack of preemption, and knowing/estimating remaining processing times

Question 44

Long term scheduling is performed...

Answer 44

Typically on submitted jobs

Question 45

(T/F) FCFS is a simple scheduling technique that tends to favor IO bound processes over processor bound processes

Answer 45

False

Question 46

(T/F) In HRRN scheduling, long jobs are favored because they yield a larger ratio from a smaller denominator in the equation

Answer 46

False

Question 47

(T/F) One problem with a pure priority scheduling scheme is is that lower priority processes may suffer deadlock

Answer 47

False

Question 48

The category of parallelism in multiprocessors in which there is no explicit synchronization among processes is...

Answer 48

Independent parallelism

Question 49

Scheduling on a multiprocessor involves which of the following design issues:

Answer 49

Dispatching, assignment, and multiprogramming

Question 50

A disadvantage of the Load Sharing multiprocessor scheduling and assignment approach is:

Answer 50

The central queue can be a bottleneck due to mutual exclusion

Question 51

A task that, unless it meets its deadline may cause undesirable damage or a fatal error to the system, is called a:

Answer 51

Hard real-time task

Question 52

____ is concerned with how long an operating system delays before acknowledging an interrupt

Answer 52

Determinism

Question 53

The ____ approach is a set of related threads scheduled to run on a set of processors at the same time, on a one-to-one basis.

Answer 53

Gang scheduling

Question 54

With the ____ approach the number of threads in a process can be altered during the course of execution.

Answer 54

Dynamic scheduling

Question 55

In a SMP system, each processor maintains a local cache and must alert all other processors that a change to cache update has taken place. This is referred to as the:

Answer 55

Cache coherency problem