1) The Readers-Writers First Reader Solution is:

where multiple readers are allowed access to the shared resource so long as no writer is currently writing to it.

designed to favor writers.

where the first Reader to arrive is promoted to a writer in order of arrival.

not subject to starvation.

2) The Readers-Writers Second Readers solution is

while a writer is writing a shared resource other writers can write as well, no new readers can read until all writes are finished.

designed to favor readers.

while a writer is waiting to access and write to a shared resource, it must wait until readers are completed reading starving writers.

while a writer is waiting to access and write to a shared resource, no new readers can begin reading that resource.

3) The CPU Scheduler is a short term scheduler that selects the next process to run from a ready queue. True or false.

4) Which definition best matches the term.

The interval from the arrival time of a process to the ready queue to the time the process completes execution and terminates.

The total amount of time a ready process spends waiting in the ready queue for each period it is in that queue.

The ratio of the time spent by a CPU executing process instructions to the executing time plus idle time of that CPU.

The number of processes that a CPU completes execution on over a given time period.

The amount of time a requester is waiting to get a response from a specific process.

1. CPU Utilization

2. CPU Throughput

3. CPU Turnaround

4. Waiting Time

5. Response Time

5) Which of the following is true of priority scheduling algorithms:

maintains a queue based on first come priority that schedules the processes in order of their arrival into the queue.

processes in the ready queue are evaluated when a event occurs and the highest priority process is the next process scheduled to execute.

is always non-preemptive.

they are subject to starvation which can be resolved by implementing a priority increase based on aging.

6) Which of the following applies to a Round Robin Scheduler

each process is allocated an interval, a time slice, of which to run before being placed back at the tail end of the ready queue until it eventually completes execution.

is designed especially for timesharing systems.

is a preemptive scheduler.

can require many more context switches when compared to other scheduling algorithms.

7) Shortest Remaining Time First scheduling can preempt currently executing processes with newly arrived process to the ready queue that have a shorter run time. True or false.