Which of the following does not interrupt a running process?

The number of processes completed per unit time is known as _____

Process synchronization can be done at the __________ level.

The page table registers should be built with ______ logic.

A scheduling algorithm can use either static priority or dynamic priority.

In UNIX, each process is identified by its Process Identifier.

The bounded buffer problem is also known as the _____

Which of the following is correct regarding the functions of an operating system?

What is a breach of availability?

Three processes arrive at time zero with CPU bursts of 16, 20 and 10 milliseconds. If the scheduler has prior knowledge about the length of the CPU bursts, the minimum achievable average waiting time for these three processes in a non-preemptive scheduler (rounded to nearest integer) is _____________ milliseconds.