A server crash and recovery will __________ be visible to a client.

The size of a process is limited to the size of the _____ memory.

A collection of instructions that performs a single logical function is called a ____________

The model in which one kernel thread is mapped to many user-level threads is called ___________

Which of the following CPU scheduling algorithms is non-preemptive?

RAID stands for ____________

Which of the following is true about Direct Memory Access (DMA)?

Instruction execution in a processor is divided into 5 stages. Instruction Fetch(IF), Instruction Decode (ID), Operand Fetch(OF), Execute(EX), and Write Back(WB), These stages take 5,4,20, 10 and 3 nanoseconds (ns) respectively. A pipelined implementation of the processor requires buffering between each pair of consecutive stages with a delay of 2 ns. Two pipelined implementations of the processor are contemplated:

(i) a naïve pipeline implementation (NP) with 5 stages and

(ii) an efficient pipeline (EP) where the OF stage id divided into stages OF1 and OF2 with execution times of 12 ns and 8 ns respectively.

The speedup (correct to two decimals places) achieved by EP over NP in executing 20 independent instructions with no hazards is

Consider the following processes with their respective arrival and burst times.

Process                                             Burst Time                               Arrival Time

P1                                                       7                                                 3

P2                                                       3                                                 6

P3                                                       9                                                 2

P4                                                       4                                                 0

P5                                                       5                                                 5

What is the average waiting time if Non - Preemtive Shortest Job First Scheduling is used?

In a system, there are three types of resources: E, F and G. Four processes P0, P1, P2 and P3 execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example, Max[P2, F] is the maximum number of instances of F that P2 would require. The number of instances of the resources allocated to the various processes at any given state is given by a matrix named Allocation. Consider a state of the system with the Allocation matrix as shown below, and in which 3 instances of E and 3 instances of F are the only resources available.

From the perspective of deadlock avoidance, which one of the following is true?