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 compu

1.	The maximum number of processes that can be in Ready state for a computer system with n CPUs is
A.	n
B.	n2
C.	2n
D.	Independent of n
Answer» E.

Discussion

No Comment Found

Related MCQs

Consider the following C program. The output of the program is __________. # include <stdio.h> int f1(void); int f2(void); int f3(void); int x = 10; int main() { int x = 1; x += f1() + f2() + f3() + f2(); pirntf("%d", x); return 0; } int f1() { int x = 25; x++; return x; } int f2( ) { static int x = 50; x++; return x; } int f3( ) { x *= 10; return x;
Language L1 is polynomial time reducible to language L2. Language L3 is polynomial time reducible to L2, which in turn is polynomial time reducible to language L4. Which of the following is/are True? I. If L4 ∈ P, L2 ∈ P II. If L1 ∈ P or L3 ∈ P, then L2 ∈ P III. L1 ∈ P, if and only if L3 ∈ P IV. If L4 ∈ P, then L1 ∈ P and L3 ∈ P
Consider the following policies for preventing deadlock in a system with mutually exclusive resources. I. Processes should acquire all their resources at the beginning of execution. If any resource is not available, all resources acquired so far are released. II. The resources are numbered uniquely, and processes are allowed to request for resources only in increasing resource numbers. III. The resources are numbered uniquely, and processes are allowed to request for resources only in decreasing resource numbers. IV. The resources are numbered uniquely. A process is allowed to request only for a resource with resource number larger than its currently held resources. Which of the above policies can be used for preventing deadlock?
Consider the following reservation table for a pipeline having three stages S1, S2 and S3. Time --> ----------------------------- 1 2 3 4 5 ----------------------------- S1 | X | | | | X | S2 | | X | | X | | S3 | | | X | | | The minimum average latency (MAL) is _________
Let G be connected undirected graph of 100 vertices and 300 edges. The weight of a minimum spanning tree of G is 500. When the weight of each edge of G is increased by five, the weight of a minimum spanning tree becomes ________.
Consider the following recursive C function. If get(6) function is being called in main() then how many times will the get() function be invoked before returning to the main()? void get (int n) { if (n < 1) return; get(n-1); get(n-3); printf("%d", n);
In the network 200.10.11.144/27, the fourth octet (in decimal) of the last IP address of the network which can be assigned to a host is ________
Suppose Xi for i = 1, 2, 3 are independent and identically distributed random variables whose probability mass functions are Pr[Xi = 0] = Pr[Xi = 1] = 1/2 for i = 1, 2, 3. Define another random variable Y = X1 X2 ⊕ X3, where ⊕ denotes XOR. Then Pr[Y = 0 ⎪ X3 = 0] = ____________.
Since it is a network that uses switch, every packet goes through two links, one from source to switch and other from switch to destination. Since there are 10000 bits and packet size is 5000, two packets are sent. Transmission time for each packet is 5000 / 1077 bits per second links. Each link has a propagation delay of 20 microseconds. The switch begins forwarding a packet 35 microseconds after it receives the same. If 10000 bits of data are to be transmitted between the two hosts using a packet size of 5000 bits, the time elapsed between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is _________.
Consider the equation (43)x = (y3)8 where x and y are unknown. The number of possible solutions is ________.

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

Discussion

No Comment Found

Related MCQs

Reply to Comment