Q. The total transfer time is ________ to the amount of memory swapped

View solution

Q. Whenever the CPU scheduler decides to execute a process, it calls the

View solution

Q. The run-time mapping from virtual to physical addresses is done by a hardware device called

View solution

Q. ________ is solved by Dijkstra's banking algorithm

View solution

Q. In deadlock,only one process at a time can use the resource,this condition is called

View solution

Q. Which one is an example of race condition

View solution

Q. Which one operation signifies that the transaction has terminated its execution

View solution

Q. A collection of instructions (or operations) that performs a single logical function is called a

View solution

Q. Binary semaphores are also known as

View solution

Q. The value of a binary semaphore can range between

View solution

Q. A _______ is a technique for passing information from one program process to another

View solution

Q. Two general approaches are used to handle critical sections in operating systems which are preemptive and nonpreemptive ________

View solution

Q. Push migration and pull migration are two types of ________ approach

View solution

Q. Which one scheduling algorithm is designed especially for time sharing systems

View solution

Q. A solution to the problem of starvation of low-priority processes is

View solution

Q. Which one is a major problem with priority scheduling algorithm

View solution

Q. The target thread periodically checks whether it should terminate, allowing it an opportunity to terminate itself in an orderly fashion is ___________ cancellation

View solution

Q. The approach in which one thread immediately terminates the target thread is known as ___________ cancellation

View solution

Q. The many-to-one model maps many user-level threads to one

View solution

Q. When a process terminates then all its children must also be terminated. This phenomenon is called

View solution