OS UNIT 2

Select the other parameter from the following on Scheduling Problem, which have k jobs (P1, P2, P3...P_k) ready to run and CPUs to run the jobs as

• n > 1 CPUs

• n ≥ 1 CPUs

• n < 1 CPUs

• n < 1 CPUs

Produce / Give the Throughput value, where the processor run jobs in order that they arrive as “First-come first-served” (FCFS).

• 10 jobs/sec

• 0.01 jobs/sec

• 0.1 jobs/sec

• 1 jobs/sec

    A counting semaphore was initialized to 10. Then 6 P (wait) operations and 4 V (signal) operations were completed on this semaphore. The resulting value of the semaphore

• 0

• 8

• 10

• 12

  The following two functions P1 and P2 that share a variable B with an initial value of 2 execute concurrently.

P1( )

{

C=B-1;

B=2*C;

}

P2( )

{

D=2*B;

B=D-1;

}

The number of distinct values that B can possibly take after the execution is___________

• 1

• 2

• 3

• 4

A solution to the Dining Philosophers Problem which avoids deadlock is

• ensure that all philosophers pick up the left fork before the right fork

• ensure that all philosophers pick up the right fork before the left fork

• ensure that one particular philosopher picks up the left fork before the right fork, and that all other philosophers pick up the right fork before the left fork

• None of the above