file of your submission.2. Consider the following arrivals of processes in an interactive system.(a) Draw three timelines that illustrate the execution of these processes usingi. Shortest job first, SJFii. Nonpreemptive priority NPP - a smaller number has higher priorityiii. Round-robin, RR, with time slice 2with the following data:ProcessP1P2P3P4P5P6Arrival time003488CPU time334231Priority212312If there is a tie (same CPU time for SJF or same priority for NPP), use first-in-first-out(FIFO) to break the tie. For RR scheduling, if P1 is removed from the CPU and put inthe waiting queue just when P3 arrives, P3 will be ahead of P1 in the queue.(b) What is the average waiting time for RR?3. Consider Figure 1-31 in Tanenbaum and Bos, Ed. 5, p81 called The principal metricprefixes and answer these questions:(a) How many bytes in one terabyte (TB) of memory? Please write out all digitsof the number and also express it with an exponent.(b) How many nanoseconds in in a second? Please write out all digits of thenumber and also write it with an exponent.(c) How many bits per second is a 1Gbps running at? Please write out all digits ofthe number.(d) Kilo as a metric prefix means 1000 or 10^3 but as a metric prefix for measuringmemory it means something different - 2^10. Draw three rectangular sketches ofmemory, shaped differently and label addresses at the left starting at all zeroes:1) In the first picture the rectangle is tall and narrow. The data in ASCII is characters'elephantelephant', but you need to write it in ASCII codes shown as hex. The amountstored at each address is just one byte. Use hex for the addresses also. Label theaddresses in hex 0, 1, 2,...E,F going up the page and write the data in each memorylocation using hex and one byte on a line for 16 lines.2) Draw the same picture using binary for addresses and data.3) In this picture the rectangle is wider. Put four bytes of the same datawritten as ASCII coded hex on each of 4 lines of memory. Label hex addresses as 00, 04,08, 0C, 10.4) In the fourth picture, the rectangle is even wider but also very tall, so useany reasonable shape. Put the same sixteen bytes of data on a line like hexdump -C does. Indicate that the same data is repeated on all lines by writing it on thefirst and the top lines and indicating that the same data is in between by using "..." or anarrow. Label the addresses in 16 byte increments from 0000, 0010 to FFFF (top line) onthe left side. How big is this memory?

This question comes from operating system which is a topic computer science. In this question we are…

2. Consider the following arrivals of processes in an interactive system. (a) Draw three timelines that illustrate the execution of these processes using i. Shortest job first, SJF ii. Nonpreemptive priority NPP - a smaller number has higher priority iii. Round-robin, RR, with time slice 2 with the following data:

2. Consider the following arrivals of processes in an interactive system. (a) Draw three timelines that illustrate the execution of these processes using i. Shortest job first, SJF ii. Nonpreemptive priority NPP - a smaller number has higher priority iii. Round-robin, RR, with time slice 2 with the following data:

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

Consider a system with three processes (P1, P2, and P3) and four resources (R1 has one instance, R2 has two instances, R3 has one instance, and R4 has three instances). The Snapshot at time Tx has the following situation: P1 holds one instance from Resource R2 and Request Resource R1 P2 holds Resource R1, one instance from Resource R2 and Request Resource R3 P3 holds Resource R3 and Request one instance from Resource R2 Draw the Resource Allocation Graph, then check if the system in safe state or not? If yes? What is the safe sequence?
Suppose there are five processes, their arrival time and running time are listed as follows. Adopt FCFS and SJF, respectively, give the schedule order and average waiting time. Give the schedule order of SJF. Compute the average waiting time of SJF. Process Arrival time Running time P1 P2 P3 P4 0 3 4 5 3 10 6 1
A system has three processes (P1,P2, P3) and three resources (R1,R2, R3). There is one instance of R1 and R2. There are three instances of R3. P1 holds an R1 and is requesting an R3. P2 holds an R3 and is requesting an R1. P3 holds two instances of R3 and an R2. Does a deadlock exist? Justify your answer.
Let the processes P1, P2, P3, P4, and P5 be given. They arrive in the system at the same time in this order. The processes have the attached file as service times (in time units) and priorities. For each of the scheduling methods (First Come, first served (FIFO), Shortest Job First, Round Robin, and Priority Scheduling), specify the execution order of the processes and the average execution time (average turnaround time) for all processes. First, determine and state the execution times of the individual processes and then calculate the average value. Note: • For Shortest Job First, If the required service time (CPU time) is the same for two or more processes, use First Come, first served to resolve the conflict. • For Round Robin, the time quantum q = one time unit. • For Priority Scheduling, low integer priority values signify high priorities, with O being the highest possible priority. If multiple processes have the same priority, use First Come, first served to resolve the conflict.…
Consider a system with five processes, PO →P4, three resource types, A, B, C. Type A has 9 instances, B has 6 instances, C has 6 instances. At time To the following snapshot of the system is taken. Available В С 1 Max Need Allocated A A PO 2 2 P1 7 C 1 2 1 4. 3 P2 4 2 P3 4 3 2 1 P4 3 2 (You may write down the steps and all answers in a paper and upload) a) Is the system in a safe state? b)Write the Sequence c)Calculate Need matrix d)Write the steps, that leads to your conclusion.
Suppose at time T0, following is the snapshot of a system with 6 process (P0, P1, P2, P3, P4, P5) and 3 resources (A, B, C) having 8, 10 and 12 instances respectively.Allocation Max A B C A B CP0 2 3 1 4 4 4P1 1 0 3 3 3 3P2 0 2 2 1 2 3P3 1 2 1 2 2 2P4 0 2 1 0 3 5P5 2 0 2 2 1 2Now, if process P4 make a new request (0, 1, 2) for resources then state that whether this request can be granted or not using Banker’s Algorithm.
Suppose a system has 5 processes, P = {P1, P2, P3, P4, P5}, and 4 resources, R = {R1, R2, R3, R4}, where there are 2 instances of R1, 1 instance of R2, 3 instances of R3, and 3 instances of R4. The current state of the system is defined by the following requests and assignments: P1 is requesting an instance of R3 and has been assigned an instance of R2; P2 is requesting an instance of R1 and has been assigned an instance of R3; P3 is requesting an instance of R4 and has been assigned an instance of R1 and an instance of R3; P4 is requesting an instance of R3; P5 is requesting an instance of R2 and has been assigned an instance of R4. Is there deadlock in this system? (Explicitly state yes, there’s deadlock or no, there isn’t.) If applicable, draw a wait-for graph or resource-allocation graph, and use the appropriate graph to justify your answer. If you conclude there is no deadlock, your justification should contain a sequence of execution for the processes which shows that…
Consider a system with five processes and three resource type. Resource type X has 7 instances, resource type Y has 10 instances and resource type Z has 5 instances. Suppose that at time 0, the following snapshot of the system has been taken. Is the process safe? If yes, what is the safe sequence? If not, which process is unsafe?
What is a cascadeless schedule? Why is cascadelessness of schedules desirable?Are there any circumstances under which it would be desirable to allownoncascadeless schedules? Explain your answer.
During the course of its execution, may a single process get stalled? Your replies should be supported by rationale.
Is it possible to have a deadlock involving only one single process? Explain your Consider a system consisting of four resources of the same type that are shared bythree processes, each of which needs at most two resources. Show that the system is deadlock- free.
Direction: Draw a Gantt chart showing the execution of CPU for the following processes implementing Round robin (RR) as indicated below. Also, compute the turnaround times (TAT) and waiting times (WT) of all processes using this scheduling algorithm. The quantum time (QT) is set to 6. Question 1 10 pts Write your answers on the spaces provided. Process Burst Time (BT) Arrival time (AT) RR TAT RR WT P1 15 P2 10 5 P3 P4 3 10 P5 5 20