Questions from Operating Systems

Q: Consider a single queue with a constant service time of four seconds

Consider a single queue with a constant service time of four seconds and a Poisson input with mean rate of 0.20 items per second. a. Find the mean and standard deviation of queue size. b. Find the mea...

Q: Consider a frame relay node that is handling a Poisson stream of

Consider a frame relay node that is handling a Poisson stream of incoming frames to be transmitted on a particular 1- Mbps outgoing link. The stream consists of two types of frames. Both types of fram...

Q: The Multilink Protocol (MLP) is part of X.25

The Multilink Protocol (MLP) is part of X.25; a similar facility is used in IBM’s System Network Architecture (SNA). With MLP, a set of data links exists between two nodes and is used as a pooled reso...

Q: Five batch jobs, A through E, arrive at a computer

Five batch jobs, A through E, arrive at a computer center at essentially the same time. They have an estimated running time of 15, 9, 3, 6, and 12 minutes, respectively. Their (externally defined) pri...

Q: Assume a task is divided into four equal-sized segments,

Assume a task is divided into four equal-sized segments, and the system builds an eight-entry page descriptor table for each segment. Thus, the system has a combination of segmentation and paging. Ass...

Q: Consider a paged logical address space (composed of 32 pages of

Consider a paged logical address space (composed of 32 pages of 2 kB each) mapped into a 1-MB physical memory space. a. What is the format of the processor’s logical address? b. What is the length and...

Q: The UNIX kernel will dynamically grow a process’s stack in virtual memory

The UNIX kernel will dynamically grow a process’s stack in virtual memory as needed, but it will never try to shrink it. Consider the case in which a program calls a C subroutine that allocates a loca...

Q: In 1978, Dijkstra put forward the conjecture that there was no

In 1978, Dijkstra put forward the conjecture that there was no solution to the mutual exclusion problem avoiding starvation, applicable to an unknown but finite number of processes, using a finite num...

Q: The following problem was once used on an exam: Jurassic Park

The following problem was once used on an exam: Jurassic Park consists of a dinosaur museum and a park for safari riding. There are m passengers and n single-passenger cars. Passengers wander around t...

Q: In the commentary on Figure 5.12 and Table 5.

In the commentary on Figure 5.12 and Table 5.4, it was stated that “it would not do simply to move the conditional statement inside the critical section (controlled by s) of the cons...