What do we name to an address that is loaded into the memory-address register of the memory?

• A) Binary addresses
• B) None of the given options
• C) Physical address
• D) Logical address

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

• A) stop()
• B) block()
• C) wait()
• D) hold()

Address Binding will be _______ in Multiprogramming with Variable Tasks (MVT)

• A) Variable
• B) Fixed
• C) Dynamic
• D) Static

A ________ is an integer variable that, apart from initialization is accessible only through standard atomic operations.

• A) Semaphore
• B) Mutual Exclusion
• C) Busy Waiting
• D) Mutex

In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph contains a _____________.

• A) Edge
• B) Graph
• C) Node
• D) Cycle

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