Bissoy.com
Doctors Medicines MCQs Q&A

The maximum number of processes that can be in Ready state for a computer system with n CPUs is

The maximum number of processes that can be in Ready state for a computer system with n CPUs is Correct Answer Independent of n

The maximum number of processes that can be in Ready state for a computer system with n CPUs is Independent of n.

Related Questions

Consider the following statements about process state transitions for a system using preemptive scheduling. I. A running process can move to ready state. II. A ready process can move to running state. III. A blocked process can move to running state. IV. A blocked process can move to ready state. Which of the above statements are TRUE?
The admission ticket for an Art Gallery bears a password which is changed after every clock hour based on set of words Chosen for each day. The following is an illustration of the code and steps of rearrangement for subsequent clock hours. The Time is 9 a.m. to 3 p.m. Day’s first password: First Batch – 9 a.m. to 10 a.m. is not ready cloth simple harmony burning Second Batch – 10 a.m. to 11 a.m. ready not is cloth burning harmony simple Third Batch – 11 a.m. to 12 noon cloth is not ready simple harmony burning Fourth Batch – 12 noon to 1 p.m. not is cloth ready burning harmony simple Fifth Batch – 1 p.m. to 2 p.m. ready cloth is not simple harmony burning and so on. If the password for 11 a.m. to 12 noon was –“soap shy miss pen yet the she”, what was the password for the First Batch?
The admission ticket for an exhibition bears a password which is changed after every clock hour based on set of words chosen for each day. The following is an illustration of the code and steps of rearrangement for subsequent clock hours. The time is 9 a.m. to 3 p.m. Day's first password : First Batch ----- 9 a.m. to 10 a.m. is not ready cloth simple harmony burning Second Batch ----- 10 a.m. to 11 a.m. ready not is cloth burning harmony simple Third Batch ----- 11 a.m. to 12 noon cloth is not ready simple harmony burning Fourth Batch ----- 12 noon to 1 p.m. not is cloth ready burning harmony simple Fifth Batch ----- 1 p.m. to 2 p.m. ready cloth is not simple harmony burning and so on. If the password for 11 a.m. to 12 noon was --- "soap shy miss pen yet the she", what was the password for the first batch ?
In a system, there are three types of resources and four processes that execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example, Max[ ] is the maximum number of instances of that would require. The number of instances of the resources allocated to the various processes at any given state is given by a matrix named Allocation. Consider a state of the system with the Allocation matrix as shown below, and in which 3 instances of E and 3 instances of F are the only resources available. Allocation   E F G P0 1 0 1 P1 1 1 2 P2 1 0 3 P3 2 0 0   Max   E F G P0 4 3 1 P1 2 1 4 P2 1 3 3 P3 5 4 1   From the perspective of deadlock avoidance, which one of the following is true?
In a company there are 252 engineers, in which the ratio of the number of electronics engineers and computer engineers is 2 ∶ 1. The ratio of the number of electronics engineers and computer engineers becomes 1 ∶ 1 after recruitment of some more computer engineers. The average age of all the engineers is now 22 years and the average age of the computer engineers is 2 years less than the average age of electronics engineers. (A) The average age (in years) of electronics engineers is 21 (B) The average age (in years) of computer engineers is 21 (C) The average age (in years) of electronics engineers is 23 (D) The average age (in years) of electronics engineers is 25 (E) The average age (in years) of computer engineers is 23 Choose the correct answer from the options given below: 
An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y, and Z to three processes P0, P1, and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution.   Allocation Max   X Y Z X Y Z P0 0 0 1 8 4 3 P1 3 2 0 6 2 0 P2 2 1 1 3 3 3   There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in a safe state. Consider the following independent requests for additional resources in the current state: REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z Which one of the following is TRUE?
A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each of the processes Y and Z reads x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the P operation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the semaphore S after storing x to memory. Semaphore S is initialized to two. What is the maximum possible value of x after all processes complete execution?
Consider four processes P, Q, R, and S scheduled on a CPU as per round-robin algorithm with a time quantum of 4 units. The processes arrive in the order P, Q, R, S, all at time t = 0. There is exactly one context switch from S to Q, exactly one context switch from R to Q, and exactly two context switches from Q to R. There is no context switch from S to P. Switching to a ready process after the termination of another process is also considered a context switch. Which one of the following is NOT possible as CPU burst time (in time units) of these processes?  
On a System with N CPU, what is maximum number of processes that can be in ready state?
Suppose a system contains n processes and system uses the round-robin algorithm for CPU scheduling then which data structure is best suited ready queue of the processes