MCQ Bank
Software solution to critical section problem can run only in environment ______________.
- A) Multithreading
- B) Multiprocessor
- C) Uniprocessor
- D) Separate address spacing
The condition in which a set {P0, P1… Pn} of waiting processes must exist such that P0 is waiting for a resource that is held by P1, P1 is waiting for a resource that is held by P2, and so on, Pn-1 is waiting for a resource held by Pn, and Pn is waiting for a resource held by P0. This condition is known as _____________.
- A) Hold and wait
- B) Circular wait
- C) No preemption
- D) Mutual exclusion
Assume a logical address space of 16 pages 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 p (page number)?
- A) 16 bits
- B) 4 bits
- C) 8 bits
- D) 32 bits
Variable names are ----------- addresses
- A) Symbolic
- B) Physical
- C) Relative
- D) Relocatable
We can perform the solution to critical section problem by allowing only one process to enter at a time but another solution hold some instruction use.one of them is TSL, how it is written in program?
- A) TSL ()
- B) Testandset (Boolean &target)
- C) TSL (Boolean, &target)
- D) TestAndSet(Boolean &target)
_____________ algorithm is used for solving n-process critical section problem.
- A) Bankers
- B) Adams
- C) Bakery
- D) Babbles
The _____________________requires that once a writer is ready, that writer performs its write as soon as possible. In other words, if a writer is waiting to access the object, no new readers may start reading.
- A) second readers-writers problem
- B) first readers-writers problem
- C) third readers-writers problem
- D) fourth readers-writers problem
In critical section problem __________requirement illustrates that, “There exists a bound on the number of times that other processes are allowed to enter their critical sections after a process has made a request to enter its critical section and before that request is granted.”
- A) bounded waiting
- B) mutual exclusion
- C) fast execution
- D) progress
The run-time mapping from virtual to physical addresses is done by a piece of hardware in the CPU, called the ------------------
- A) CPU Scheduler
- B) Registers
- C) None of the given options
- D) Memory management unit (MMU)
Main Memory is _______________ memory.
- A) Permanent
- B) Non-volatile
- C) Virtual
- D) Volatile
In instruction TestAndSet mutual exclusion implementation is done by declaring a Boolean variable lock ______________.
- A) Initialized as true
- B) Initialized as false
- C) Initialized as zero
- D) Initialized as 1
TSL based solution can implement mutual exclusion, it abbreviates ___________.
- A) TestAndSet Instruction
- B) Test Set Instrument
- C) Trap Set Solution
- D) Test Swap Instruction
Binary semaphore whose integer value cannot be can be ____________simpler to implement.
- A) <1
- B) <=1
- C) >1
- D) >=1
If the system can allocate resources to each process in some order and still avoid a deadlock then it is said to be in ___________ state.
- A) Un-Safe
- B) Safe
- C) Starvation
- D) Mutual
If there exists a logical address space of 16 pages of 1024 words, each mapped into a physical memory of ______ frames.
- A) 64
- B) 16
- C) 32
- D) 48
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