Bissoy.com
Doctors Medicines MCQs Q&A

On a System with N CPU, what is maximum number of processes that can be in ready state?

On a System with N CPU, what is maximum number of processes that can be in ready state? Correct Answer <p>Can’t say</p>

A process is ready state means it is already loaded in main memory and is waiting for CPU so number of process is in ready state is decide by the other factors like size of main memory type of OS and size of processes.

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 ?
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?  
You install and run a third-party 32-bit application named Application on your Windows 2000 Server computer. After several days, the application stops responding. You open Task Manager and find that the CPU usage is at 100 percent. The normal range of CPU usage on the server is from 20 percent to 30 percent You end the application. However, you see that the CPU on the server is still at 100 percent. Task Manager shows no other applications running. You then examine the Processes page in Task Manager and confirm that the Application.exe process is no longer running. You want to return the CPU usage to its normal range. What should you do?
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?
Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?
Consider an arbitrary set of CPU – bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?
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  
Consider the following statements. I. Daisy chaining is used to assign priorities in attending interrupts. II. When a device raises a vectored interrupt, the CPU does polling to identify the source of interrupt. III. In polling, the CPU periodically checks the status bits to know if any device needs its attention. IV. During DMA, both the CPU and DMA controller can be bus masters at the same time. Which of the above statements is/are TRUE?