7.3 Which of the following scheduling policies will provide the least turnaround

Question

7.3 Which of the following scheduling policies will provide the least turnaround time for an I/Obound process? (Both I/O-bound and CPUbound requests are present in the system.) a. RR, b. LCN, c. multilevel adaptive scheduling, d. None of these.

h. When a lock variable is used, an indivisible instruction is not needed to implement a critical section. i. In a producers–consumers system consisting of many producer processes, many consumer processes, and many buffers in the bufferpool, it is possible for many producer processes to be producing and many consumer processes to be consuming at the same time. j. In a writers-preferred readers–writers system, some reader processes wishing to read the shared data may become blocked even while some other reader processes are reading the shared data. k. A deadlock cannot occur in the dining philosophers problem if one of the philosophers can eat with only one fork. l. A critical section implemented using semaphores would satisfy the bounded wait property only if the signal operation activates processes in FIFO order. m. A race condition can occur over forks if the outline of the dining philosophers problem in Figure 6.21 is modified to remove the action “lift the forks one at a time” from the while loop and put it following the while loop.

6.2 A semaphore is initialized to 1. Twelve wait operations and seven signal operations are performed on it. What is the number of processes waiting on this semaphore? a. 12, b. 7, c. 4, d. 5

Explanation / Answer

Answering the first four mandatory sub-parts as per chegg policy.

Related Questions

Navigate

• Browse (All)
• Browse 7
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.