Which of the following process states ensures that the process is said to be running if it currently has the CPU at a particular instant?

Which of the following keys in Windows 2000 allows users to slow down the rate at which keys are repeated via the keyboards keyrepeat feature?

Which of the following attributes in process control block stores related information about process like identifier of current process and identifier of the process which created this process, etc.?

Which of the following replacement algorithms is the one in which the page which least likely to be referenced is selected?

Which of the following memory management techniques is the one which allows a limited number of blocks with the same index and different tags in the cache and can therefore be considered as a compromise between a fully associative cache and a direct mapped cache?

Which of the following terms refers to the scope in which threads compete for the use of physical CPUs?

Which of the following process states in UNIX operating system is the one in which kernel preempts current process and switch to schedule another process?

Which of the following scheduling algorithms selects the fastest little job that needs to be done by the CPU?

Which of the following terms refers to a strategy where whenever a resource is requested, it is only granted if it cannot result in deadlock?

Which of the following types of interrupts in context switching allows process to switch from running state to ready state and another process must be dispatched for execution?

Which of the following fetch policies is the simplest among all others and does not require any additional hardware or tags in the cache recording the references?

Which of the following techniques in memory management deals with 'when a modified page should be written out to secondary memory'?

Which of the following methods of mutual exclusion is the one in which context switching from one process to another process can only occur on interrupts?

Which of the following conditions for the deadlock to occur, states that once a process holds a resource, it cannot be taken by another process or the kernel?

Which of the following is a mechanism that prevents two or more processes from accessing a shared resource simultaneously?