________________ is an integer variable accessible through wait and signal which are atomic operations.

• A) Signal
• B) Semaphore
• C) Busy waiting
• D) Mutex

The set of all physical addresses corresponding to the logical addresses is a ----------------- of the process

• A) None of the given options
• B) Process address space
• C) Logical address space
• D) Physical address space

__________ consists of a large array of words or bytes, each with its own address.

• A) Data
• B) Hard disk
• C) Memory
• D) Stream

Following is not the classical problem of synchronization.

• A) Bounded buffer problem
• B) Counting Semaphore problem
• C) Dining philosophers problem
• D) Reader writer problem

Deadlock _______ provides a set of methods for ensuring that at least one of the necessary conditions cannot hold.

• A) Recovery
• B) Handling
• C) Prevention
• D) Avoidance

Which of the following is correct definition for wait operation?

• A) wait(S) { S++; }
• B) wait(S) { while(S>=0) ;// no op S--; }
• C) wait(S) { S--; }
• D) wait(S) { while(S<=0) ;// no op S--; }

Which of the following is correct definition for signal operation?

• A) signal(S) { S--; }
• B) signal(S) { while(S>=0) ;// no op S--; }
• C) signal(S) { S++; }
• D) signal(S) { while(S<=0) ;// no op S--; }

P1, P2, P3, P4, P5 are five processes with ticket numbers P1=1, P2=2, P3=4, P4=2, P5=4 then considering Lamport’s bakery algorithm, __________ process enters critical section after P1.

• A) P3
• B) P2
• C) P5
• D) P4

Object files and libraries are combined by a ------------- program to produce the executable binary

• A) Text editor
• B) Loader
• C) Compiler
• D) Linker

------------ register contains the size of the process

• A) Index register
• B) Limit register
• C) Stack pointers register
• D) Base register

In Overlay technique, we can overload any part of the program with the part of the program required needed recently.

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

In hardware multiprocessor environment two instructions are executed ___________ which are swap and TestAndSet.

• A) Automatically
• B) Atomically
• C) Manually
• D) By force

The condition where a set of blocked processes each holding a resource and waiting to acquire a resource held by another process in the set, is termed as ________.

• A) Starvation
• B) Deadlock
• C)
• D)

___________ is constrained by factors like quantum for RR scheduler and pending I/O for swapped out process.

• A) Rollout
• B) Kernel
• C) Swapping
• D) Rollin

----------holds the smallest legal physical memory address for a process

• A) Stack pointers register
• B) Limit register
• C) Base register
• D) Index register

Consider a scenario in which one process P1 enters in its critical section, no other process is allowed to execute in its critical section. This is called ---------------

• A) Progress
• B) Mutual exclusion
• C) Context switching
• D) Multithreading

The integer value of ______________ semaphores can range over an unrestricted integer domain.

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

___________ algorithm is used in Deadlock avoidance.

• A) Mutual exclusion
• B) Safe Sequence
• C) Bakery
• D) Banker’s

_____________ is caused due to un-used space in physical memory.

• A) Internal fragmentation
• B) Paging
• C) External fragmentation
• D) MVT

For undivided and uninterrupted testing and setting of semaphore, uni-processor systems tend to _________.

• A) Disable interrupts
• B) Use bakery algorithm
• C) Use signal
• D) Use spinlock