1. (TCO 3) The Banker\'s algorithm helps to _______ deadlocks. (Points : 4) avoi
ID: 3567509 • Letter: 1
Question
1. (TCO 3) The Banker's algorithm helps to _______ deadlocks. (Points : 4)
avoid
detect
ignore
prevent
2. (TCO 4) In _______ scheduling, a process may be moved to a higher priority queue to prevent starvation. (Point4) multilevel queue
multilevel feedback queue
multiple processor
3. (TCO 4) Consider a First Come First Served (FCFS) CPU scheduler with the following process profile:
Process Arrival Time CPU Burst
P1 t 5
P2 t+2 7
P3 t+4 3
P4 t+6 9
P5 t+8 1
P6 t+10 5
Assume that the CPU is idle and there are no other processes in the ready queue when process P1 arrives. Determine the schedule of process execution, and compute the wait times for each of the six processes. Which of the following is TRUE about the average wait time and the maximum wait time for the six processes? (Points : 4)
Average wait time is less than 9.0 time units; maximum wait time is more than 15.0 time units
Average wait time is more than 7.5 time units; maximum wait time is more than 16.0 time units
Average wait time is less than 8.5 time units; maximum wait time is less than 16.5 time units
Average wait time is less than 9.0 time units; maximum wait time is less than 16.0 time units
4. (TCO 4) Consider the arrival time and CPU burst time statistics for the following six processes:
Process Arrival Time CPU Burst
P1 t 6
P2 t+1 2
P3 t+6 3
P4 t+9 7
P5 t+10 1
P6 t+13 5
Determine the schedule of process execution using the First Come First Served (FCFS) CPU scheduling algorithm. Which of the following is a FALSE statement about the wait times and turnaround times for the six processes? (Points : 4)
P6 has a larger wait time than P3
P6 has the largest turnaround time
P4 has a smaller wait time than P2
P5 has a smaller turnaround time than P4
5. (TCO 3) Consider a system having two resource types RT1 and RT2. Let there be two resources of type RT1 and let there be a single resource of type RT2.
Let P1, P2, P3 and P4 be four processes competing for these resources. In the following sequences of request events, let (Pi, RTj) denote a request event indicating that process Pi requests a resource of type RTj. Consider each sequence of request events and determine whether it causes a deadlock in the system. Identify the sequence that does NOT cause a deadlock. (Points : 4)
(P4, RT2), (P3, RT1), (P2, RT1), (P4, RT1), (P2, RT2), (P3, RT2).
(P2, RT1), (P1, RT2), (P3, RT1), (P2, RT2), (P3, RT2), (P1, RT1).
(P4, RT1), (P3, RT2), (P1, RT1), (P1, RT2), (P4, RT2), (P3, RT1).
(P3, RT2), (P2, RT1), (P4, RT2), (P3, RT1), (P2, RT2), (P1, RT1).
Explanation / Answer
prevent
multilevel feedback queue
P3 t+4 3
P5 has a smaller turnaround time than P4
(P2, RT1), (P1, RT2), (P3, RT1), (P2, RT2), (P3, RT2), (P1, RT1).
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.