Module 4 - Process Synchronization

Question 1

Concurrent access to shared data may result in :

Accepted Answer

data inconsistency

Answer

data consistency

Answer

data insecurity

Answer

None of the Above

Question 2

A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called :

Accepted Answer

race condition

Answer

data consistency

Answer

aging

Answer

starvation

Question 3

The segment of code in which the process may change common variables, update tables, write into files is known as :

Accepted Answer

critical section

Answer

program

Answer

non – critical section

Answer

synchronizing

Question 4

The following three conditions must be satisfied to solve the critical section problem :

Accepted Answer

All of the Above

Answer

Mutual Exclusion

Answer

Progress

Answer

Bounded Waiting

Question 5

Mutual exclusion implies that :

Accepted Answer

if a process is executing in its critical section, then no other process must be executing in their critical sections

Answer

if a process is executing in its critical section, then other processes must be executing in their critical sections

Answer

if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution

Answer

None of the Above

Question 6

Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section :

Accepted Answer

after a process has made a request to enter its critical section and before the request is granted

Answer

when another process is in its critical section

Answer

before a process has made a request to enter its critical section

Answer

None of the Above

Question 7

A minimum of _____ variable(s) is/are required to be shared between processes to solve the critical section problem.

Accepted Answer

two

Answer

one

Answer

three

Answer

four

Question 8

In the bakery algorithm to solve the critical section problem :

Accepted Answer

each process receives a number (may or may not be unique) and the one with the lowest number is served next

Answer

each process is put into a queue and picked up in an ordered manner

Answer

each process gets a unique number and the one with the highest number is served next

Answer

each process gets a unique number and the one with the lowest number is served next

Question 9

An un-interruptible unit is known as :

Accepted Answer

atomic

Answer

single

Answer

static

Answer

None of the Above

Question 10

The TestAndSet instruction is executed :

Accepted Answer

atomically

Answer

after a particular process

Answer

periodically

Answer

None of the Above

Question 11

Semaphore is a/an _______ to solve the critical section problem.

Accepted Answer

integer variable

Answer

hardware for a system

Answer

special program for a system

Answer

None of the Above

Question 12

The two atomic operations permissible on semaphores are :

Accepted Answer

wait

Answer

stop

Answer

hold

Answer

None of the Above

Question 13

Spinlocks are :

Accepted Answer

All of the Above

Answer

CPU cycles wasting locks over critical sections of programs

Answer

Locks that avoid time wastage in context switches

Answer

Locks that work better on multiprocessor systems

Question 14

The main disadvantage of spinlocks is that :

Accepted Answer

they require busy waiting

Answer

they are not sufficient for many process

Answer

they are unreliable sometimes

Answer

they are too complex for programmers

Question 15

The wait operation of the semaphore basically works on the basic _______ system call.

Accepted Answer

block()

Answer

stop()

Answer

hold()

Answer

wait()

Module 4 - Process Synchronization

Crea una cuenta gratis para terminar este test

Información

Escríbenos

¿Qué te parece el nuevo diseño?