External Fragmentation takes place in ______________

• A) Multi-tasking
• B) Paging
• C) Multiprogramming with Variable Tasks (MVT)
• D) Multiprogramming with Fixed Tasks (MFT)

The -----------scheme is not applicable to a resource allocation system with multiple instances of each resource type.

• A) Resource allocation graph
• B) Both Resource-allocation and wait-for graph
• C) Wait for graph
• D) None of the given options

In order to remove the problem like busy waiting, some high level synchronization constructs are defined. What are they?

• A) Critical regions and Semaphores
• B) Critical regions and Monitors
• C)
• D)

If a system is not in a safe state, there can be NO deadlocks.

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

---------------keep in memory only those instructions and data that are needed at any given time.

• A) Overlays
• B) Fragmentation
• C) Paging
• D) Swapping

-----------is the process of mapping a name to an address.

• A) Addressing
• B) Memory
• C) Routing
• D) Binding

_____________ is caused due to un-used space in fixed size blocks/ pages.

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

Critical section is a place where certain shared structure is updated. Its solution required certain precaution; one of them is the access to critical section by one process at a time only. What this condition is termed as?

• A) Progress
• B) Entry section
• C) Bounded waiting
• D) Mutual exclusion

Banker’s algorithm is used for ________________

• A) Deadlock prevention
• B) Deadlock avoidance
• C) Deadlock detection
• D) Deadlock removal

Logical memory is divided into blocks of the same size, called_________ .

• A) Table
• B) Frame
• C) Page size
• D) Pages

In Resource Allocation Graph, a _________Pi --->Rj indicates that process Pi may request resource Rj at some time in the future.

• A) Assignment edge
• B) Claim edge
• C) Allocation edge
• D) Request edge

The situation in which no context switching is required in multiprocessor systems is referred to as _______ .

• A) Interrupt
• B) Busy Waiting
• C) Scheduler
• D) Spin lock

In the bakery algorithm to solve the critical section problem ____________

• A) Each process gets a unique number and the one with the highest number is served next
• B) Each process receives a number (may or may not be unique) and the one with the lowest number is served next
• C) Each process is put into a queue and picked up in an ordered manner
• D) Each process gets a unique number and the one with the lowest number is served next

In critical section problem, each process must first request permission to enter its critical section. The section of code implementing this request is called the_________.

• A) remainder section
• B) sub section
• C) entry section
• D) exit section

___________ is a solution to critical section problem.

• A) Lamport’s bakery algorithm
• B) Banker’s algorithm
• C) Safety algorithm
• D) Dijkstra’s algorithm

________________ 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