While a process executes its critical section, other entering processes loop in a continual fashion in their entry sections, thus causing ___________.

• A) Busy waiting
• B) Bounded waiting
• C) Mutual exclusion
• D) Race condition

Use of semaphore create a problem of busy waiting, this wastes CPU cycles that some other process may be able to use productively. This type of semaphore is also called ______________

• A) Mutex
• B) Locking Semaphore
• C) Semaphore S
• D) Spinlock

Assume a logical address space of 16 pages, each of 1024 words, each mapped into a physical memory of 32 frames. Each word consists of 2 bytes. What will be the total number of bits required for f (frames)?

• A) 7
• B) 6
• C) 5
• D) 8

A state is ___________ if the system can allocate resources for each process in some order and still avoid a deadlock.

• A) Starvation
• B) None
• C) Safe
• D) Unsafe

In critical section problem __________requirement illustrates that, “If no process is executing in its critical section and some processes wish to enter their critical sections, then only those processes that are not executing in their remainder section can participate in the decision on which will enter its critical section next, and this selection cannot be postponed indefinitely.”

• A) progress
• B) slow execution
• C) bounded waiting
• D) mutual exclusion

The main memory is usually divided into partitions, one for __________ and other for __________ .

• A) Operating system, CPU
• B) Operating System, User processes
• C) Processes, Virtual Memory
• D) Base Register, Limit Register

Preventing the condition of _____________ to happen, deadlocks can be prevented to happen.

• A) Circular wait
• B) Monitors
• C) Critical section
• D) Critical region

Critical section problem is to __________the concurrent execution of cooperating process.

• A) stop
• B) serialize
• C) update
• D) start

The integer value of _________ semaphores can not be greater than 1.

• A) Binary
• B) Bounded buffer
• C) Counting
• D) Mutex

Deadlock detection and recovery technique is exactly similar to deadlock avoidance technique to handle deadlock in the system.

• A) True
• B) False
• C)
• D)

A program can not execute unless whole or necessary part of it resides in the main memory.

• A) False
• B) True
• C)
• D)

We can use semaphores to deal with the number of __________process critical section problem.

• A) 2n
• B) 1
• C) n
• D) n-1

Both in two atomic instructions TestAndSet and swap two critical section requirements are satisfied but not _____________.

• A) Progress
• B) Mutual Exclusion
• C) Bounded Waiting
• D) Assumptions

Semaphores are used to synchronize ________ processes.

• A) Tough
• B) Running
• C) Parallel
• D) Concurrent

------------- is a segment of code that accesses a shared resource like data structure or device that must not be concurrently accessed by more than one thread of execution.

• A) Pipelining
• B) Context switching
• C) Multithreading
• D) Critical section

The size of a page is defined by ________.

• A) Logical Memory
• B) Physical Memory
• C) Page Table
• D) CPU

Critical section problem can be solved by using how many ways?

• A) 4
• B) 3
• C) 1
• D) 2

The collection of processes that is waiting on the disk to be brought into the memory for execution forms the --------

• A) Both input and output queue
• B) Output queue
• C) Input queue
• D) None of the given options

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

• A) non – critical section
• B) critical section
• C) program
• D) synchronizing

Removing the possibility of deadlock in dining philosopher problem does not ensure the _____________ problem will not occur.

• A) Critical Section
• B) Mutual Exclusion
• C) Starvation
• D) Bounded Buffer