Which of the following statements regarding the internal queue for semaphores is (are) correct? Select all that apply. (a) Without the FIFO queue attached to each binary semaphore, process starvation can happen if no other mechanism to manage the processes waiting (blocked) at a semaphore. (b) Without the FIFO queue attached to each binary semaphore, race conditions can not be prevented. (c) Since each counting semaphore allows multiple processes to proceed beyond wait for a counting semaphore, the FIFO queue is not necessary for each counting semaphore. (d) Inserting a blocked process to (for wait) and removing a leaving process from (for signal) the FIFO queue of a semaphore must be a part of the atomic operation of wait and signal operations. (e) If the FIFO queue attached to each semaphore is in a finite size, the size of the FIFO queue limits the number of processes that can use a semaphore.

Explain the concept of "first-committer wins" in optimistic concurrency control.

For deadlock to occur, A There must be mutual exclusion in resource allocation to processes There must be hold and wait of resources by processes C There must be circular waiting D All of the above.

in round robin when three processes have to enter the ready queue at the instant , if one process has just finished I/O the other has preempted from CPU due to expiration of its quantum and third (C) has just started. which one will be inserted last (ie lowest priority ) ?  a) the process that has just finished I/O  b) One of the three will be random be selected  c) The process that has been pre-empted from CPU  due to expiration of its quantum time. d) The process that has just started

Question 5     Full explain this question very fast

Please attach a picture，I need downloadable images as an answer. The RL can be implemented without dynamically managed linked lists by creating a new field, next, in each PCB, which points to the next PCB on the same list. Each entry of the RL then points to the first PCB on the list. Assume that RL contains 3 processes at level 5 and 1 process at level 0. Draw a diagram showing the RL and the modified PCBs.

b. Upon creation, 3 processes (A, B and C) are admitted into the ready queue in quick i.e., one immediately after another. You notice the processes always successfully terminate in the order A, B, C-and the average turnaround time is always the same - irrespective of the order in which the processes are first admitted into the ready queue. The processes make no 10 requests and have different service times. succession 1. What scheduling policy could the OS be employing? Explain why you think this. Name 3 scheduling policies that are not employed by the OS. Explain why you II. think this for each policy you mention.

Pascal allows gotos with nonlocal targets. How could such statements be handled if static chains were used for nonlocal variable access? Hint: Consider the way the correct activation record instance of the static parent of a newly enacted procedure is found