Wrong use of wait and signal operations (in context with semaphores) can cause _________ problem(s).

• A) Deadlock
• B) All of the given options are correct
• C) Mutual Exclusion
• D) Bounded Waiting

Secondary Storage memory devices have _____________ memory.

• A) Temporary
• B) None of the options is correct
• C) Volatile
• D) Permanent and non volatile

Cache is non-volatile memory.

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

Address Binding will be at _______ in Multiprogramming with Fixed Tasks (MFT)

• A) Dynamic time
• B) Load time
• C) None of the given options
• D) Run time

Using hardware solution to synchronization for complex problems, introduce a new synchronization tool know as _______________.

• A) Trap
• B) TestAndSet
• C) Swap
• D) Semaphore

__________ is used in the detection and recovery mechanism to handle deadlocks.

• A) Claim Edge Graph
• B) Wait-for Graph
• C) Resource allocation Graph
• D) Circular Graph

Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called -----------

• A) Holes, segments
• B) Frames, holes
• C) Frames, pages
• D) Pages, Frames

In ------------- technique, memory is divided into several fixed-size partitions.

• A) Multiprogramming with Fixed Tasks (MFT)
• B) Swapping
• C) Multiprogramming with Variable Tasks (MVT)
• D) Overlays

In Swapping technique of Memory Management, the total amount transfer time is directly proportional to the _________________.

• A) amount of space on backing store
• B) amount of memory swapped
• C) all the given options are correct
• D) space on main memory

Consider a system of N processes (Po, P1 …… Pn-1). Each process in its critical section and the process may be changing common variables, updating a table, writing a file etc. No other process is allowed to execute in its critical section. This problem is called -------------.

• A) Deadlock Algorithm
• B) N-Process Critical Section
• C) Bakery Algorithm
• D) N-Mutual Exclusion

Access of variable Semaphore is possible only through two atomic operation ______________ and _____________.

• A) Lock, key
• B) Boolean, integer
• C) Wait, signal
• D) TestAndSet, Swap

The system maintains a ____________ of all processes whose memory images are on the backing store or in memory and are ready to run.

• A) Environment
• B) Queue
• C) Ready Queue
• D) List

When the address used in a program gets converted to an actual physical RAM address, it is called ------------

• A) Address Binding
• B) Compiling
• C) Loading
• D) Execution

The problem of Deadlocks can be solved by __________ method(s).

• A) All of the given
• B) Deadlock avoidance
• C) Deadlock prevention
• D) Allowing deadlock to occur, then detect and recover

The size of pages and frames are same in logical memory and physical memory respectively.

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

The solution type where in critical section we use “entry section and “exit section” is called kind of _______________.

• A) Operating System Solution
• B) Software Solution
• C) Hardware Solution
• D) Assumption

Typically monitor, a high level synchronization tool is characterized by ___________ and ______________.

• A) Global variable,local variable
• B) Signal, wait
• C) Local variables, semaphores
• D) Local data, programmer defined operators

Keep in mind scheduling algorithm, when you go to any famous fast food franchise .On entering the store, each customer receives a number. The customer with the lowest number is served next. This algorithm is called-------------.

• A) Bakery algorithm
• B) Dijkastra algorithm
• C) Simple algorithm
• D) Deadlock algorithm

What do we name to an address that is generated by the CPU?

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

Addresses generated relative to part of program, not to start of physical memory are

• A) Symbolic
• B) Physical
• C) Relocatable
• D) Virtual