All sub parts please Q1. Consider a system with 4 processes Po through P3. 3 resource types A. B. and C. and thecurrent state at t as shown in Table 2. Hint: Safety algorithm and Resource-requestalgorithm in Appendix I.Table 2: Process allocationMaxProcessAvailableA B сB CB сPo00100 1P₁175100P:2 35135P:65063Total29915 2How many resources are there of type (A. B. C)?What is the contents of the Need matrix?iii)Is the system in a safe state? Why?iv)If a request from process P1 arrives for additional resources of (0. 5. 2). can theBanker's algorithm grant the request immediately?What would be the new system state after the allocation (Table 3)?Table 3: Process allocationMaxAllocationAvailableProcessBс A BCA B сPo01P17 5P₂3 5P:5Total1)012Allocation

Solution i) Type A has 3 resources because (2+1)=3 Type B has 14 resources because (9+5)=14 Type C…

i) How many resources are there of type (A. B. C)? What is the contents of the Need marix? iii) Is the system in a safe state? Why? iv) If a request from process P1 arrives for additional resources of (0. 5. 2). can the Banker's algorithm grant the request immediately? v) What would be the new system state after the allocation (Table 3)?

i) How many resources are there of type (A. B. C)? What is the contents of the Need marix? iii) Is the system in a safe state? Why? iv) If a request from process P1 arrives for additional resources of (0. 5. 2). can the Banker's algorithm grant the request immediately? v) What would be the new system state after the allocation (Table 3)?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1. Consider the following set of processes, with the length of the CPU burst given inmilliseconds: Process Burst Time PriorityP1 2 2P2 1 1P3 8 4P4 4 2P5 5 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.a. Draw four Gantt charts that illustrate the execution of these processes using thefollowing scheduling algorithms: FCFS, SJF, nonpreemptive priority (a larger prioritynumber implies a higher priority), and RR (quantum = 2).b. What is the turnaround time of each process for each of the scheduling algorithms inpart a?c. What is the waiting time of each process for each of these scheduling algorithms?d. Which of the algorithms results in the minimum average waiting time (over allprocesses)?
Consider the following set of processes, with the length of the CPU burst given in seconds: Process Burst time Arrival time P1 10 1 P2 04 2 P3 05 3 P4 03 4 Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF preemptive and Round Robin (quantum = 3). What is the turnaround time of each process for each of the scheduling algorithms in part a? What is the waiting time of each process for each of these scheduling algorithms? Which of the algorithms results in the minimum average waiting time (over all processes)? Which of the algorithms results in the minimum average turnaround time (over all processes)?
Question no 02: Consider the following set of processes, with the length of the CPU burst given in seconds: Process Burst Priority P1 32 4 P2 24 1 P3 4 2 P4 36 2 P5 12 3 NOTE: The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, non-preemptive priority (a larger priority number implies a higher priority), and Round Robin (quantum = 8). b. What is the turnaround time of each process for each of the scheduling algorithms in part a? c. What is the waiting time of each process for each of these scheduling algorithms? d. Which of the algorithms results in the minimum average waiting time (over all processes)? e. Which of the algorithms results in the minimum average turnaround time (over all processes)?
Question no 02: Consider the following set of processes, with the length of the CPU burst given in seconds: Process Burst Priority P1 32 4 P2 24 1 P3 4 2 P4 36 2 P5 12 3 NOTE: The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, non-preemptive priority (a larger priority number implies a higher priority), and Round Robin (quantum = 8). What is the turnaround time of each process for each of the scheduling algorithms in part a? What is the waiting time of each process for each of these scheduling algorithms? Which of the algorithms results in the minimum average waiting time (over all processes)? Which of the algorithms results in the minimum average turnaround time (over all processes)?
Assignment 11. Consider the following set of processes,with the length of the CPU burst and arrival timegiven in seconds: Process Arrival Time Burst TimeP2 0 12P3 3 8P4 5 4P1 10 10P5 12 6 a. Draw Gantt chart that illustrate the execution of these processes using the preemptive Shortest Job First.b. What is the turnaround time of each process?c. What is the waiting time of each process?d. What is the Average turnaround time of the execution?e. What is the Average waiting time of the execution?2. Consider the following set of processes, with the length of the CPU burst and arrival time given in seconds: Process Arrival Time Burst TimeP2 0 12P3 3 8P4 5 4P1 10 10P5 12 6 a. Draw Gantt chart that illustrates the execution of these processes using the FCFS.b. What is the Average turnaround time of the execution?c. What is the Average waiting time of the execution?
22. A system has two processes and three identical resources. Each process needs a maximum of two resources. Is deadlock possible? Explain your answer 23. Consider the previous problem again, but now with p processes each needing a maximum of m resources and a total of r resources available. What condition must hold to make the system deadlock free? please answer the second question...
b.Start from the resource allocation state in Q 13. If a request from a process P3 arrives for (1, 2, 3), can the request be immediately granted ? Why or why not ? c.Start from the resource allocation state in Q 13. Suppose that P4 asks for 2 instances of resource B. Can the system grant this if it wants to avoid deadlock ? Explain.
Q1: c) Consider the system with 5 processes <P0, P1, P2, P3, P4> and three resources types (4)A=13, B=13 and C=9. The following information has been attached. Is the system in safe state?? (If yes find the safe sequence using Banker’s Algorithm)
Consider the following set of processes, with the length of the CPU burst given in milliseconds Process Burst Time Priority P1 5 1 P2 2 3 P3 1 3 P4 1 2 P5 10 4 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, and RR (quantum = 3). What is the turnaround time of each process for each of the scheduling algorithms in part a? what is the waiting time of each process for each of the scheduling algorithms in part a? Which of the algorithms results in the minimum average waiting time (over all processes)?
Consider the following set of processes, with the length of the CPU burst given in seconds: Process Burst Priority P1 32 4 P2 24 1 P3 4 2 P4 36 2 P5 12 3 NOTE: The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, non-preemptive priority (a larger priority number implies a higher priority), and Round Robin (quantum = 8). What is the turnaround time of each process for each of the scheduling algorithms in part a? What is the waiting time of each process for each of these scheduling algorithms? Which of the algorithms results in the minimum average waiting time (over all processes)? Which of the algorithms results in the minimum average turnaround time (over all processes)? NOTE: Write the code of all parts
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority P1 2 2 P2 1 1 P3 8 4 P4 4 2 P5 5 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive priority (a larger priority number implies a higher priority), and RR (quantum = 2). What is the turnaround
Consider the following set of six processes, with the arrival times, CPU burst time (in milliseconds), and priority. process arrival time burst time priority P1 22 10 3 P2 8 4 2 P3 28 12 6 P4 10 8 1 P5 35 6 5 P6 8 20 4 (a) Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, preemptive priority (a smaller priority number implies a higher priority), and RR (quantum= 8).(b) Compute the average wait time in each of the scheduling algorithms in part (a)?