Operating-systems Questions Set 41:
How many levels of threads are there in a process?
Solution:
Which of the following is not a valid thread state?
Solution:
In the Network File System (NFS), a machine can be a:
Solution:
The data structures available in the Banker's algorithm are ____
Solution:
The address of the next instruction to be executed by the current process is provided by the program counter.
Solution:
A single thread of control in a process allows it to perform __________
Solution:
When should an effective operating system check for deadlock?
Solution:
Which of the following scenarios is best suited for the interrupt mode of data transfer?
Solution:
What is the process of invoking the wait operation?
Solution:
Each process Pi, i = 0, 1, 2, 3, ..., 9 is coded as follows:
repeat
P(mutex)
{Critical Section}
V(mutex)
forever
The code for P10 is identical except that it uses V(mutex) instead of P(mutex). What is the largest number of processes that can be inside the critical section at any moment (assuming the mutex is initialized to 1)?
Solution:
Related Question Sets:
Related Topics:
Scroll to Top
