Sheet-4 (OS)

A visually engaging illustration of a computer with multiple interconnected processes, showcasing concepts like threads, semaphores, and process management in an abstract way.

Mastering Operating Systems: Process Management Quiz

Test your knowledge on key concepts of operating systems, specifically focusing on process management. This quiz is designed to help you understand critical terms and principles that govern how processes operate within a uniprocessor system.

Whether you're a student or a professional, challenge yourself with questions covering:

Concurrency
Critical Sections
Synchronization Mechanisms
Processes and Threads

30 Questions8 MinutesCreated by StudyingTiger47

The management of multiple processes within a uniprocessor system is ___________.

Multiprogramming

Structured applications

Distributed processing

Multiprocessing

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

Mutual exclusion

Deadlock

Starvation

Livelock

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 ____________.

Critical section

Livelock

Mutual exclusion

Atomic operation

A means for two processes to exchange information is with the use of ____________.

Spinlocks

Event flags

Condition variables

Messages

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

Weak

General

Strong

Binary

A ____________ 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.

Atomic operation

Race condition

Livelock

Deadlock

__________ 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.

Critical section

[BMutual exclusion

Atomic operation

Starvation

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.

Spin waiting

General semaphore

Critical resource

Message passing

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

Deadlock

General semaphore

Condition variable

Mutex

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 __________ semaphore.

General

Strong

Weak

Counting

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

Atomic operation

Coroutine

Critical section

Monitor

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

Blocking send, blocking receive

Nonblocking send, blocking receive

Nonblocking send, nonblocking receive

Blocking send, nonblocking receive

A ___________ relationship allows multiple server processes to provide concurrent service to multiple clients.

Many-to-many

Oner-to-many

Many-to-one

One-to-one

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

True

False

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

True

False

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.

True

False

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.

True

False

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

True

False

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

True

False

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.

True

False

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.

True

False

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

True

False

Sheet-4 (OS)

Mastering Operating Systems: Process Management Quiz

More Quizzes