How many processes will be in the ready queue at time 5ms (on timeline) if the FCFS is applied to the following processes? Process Arrival time Burst time P1 P2 3. P3 4 P4 O No processes O One process O Two processes O Three processes One of the following implies that a system can perform more than one task simultaneously: O Data coherency O Concurrency O Parallelism O Task splitting limits the number of times that other processes allowed to enter their critical sections after a process has made a request to enter its critical section and before that request is granted: O Busy waiting O Mutual exclusion O Bounded waiting O Spinlock 4 23 2

How many processes will be in the ready queue at time 5ms (on timeline) if the FCFS is applied to the following processes? Process Arrival time Burst time P1 P2 3. P3 4 P4 O No processes O One process O Two processes O Three processes One of the following implies that a system can perform more than one task simultaneously: O Data coherency O Concurrency O Parallelism O Task splitting limits the number of times that other processes allowed to enter their critical sections after a process has made a request to enter its critical section and before that request is granted: O Busy waiting O Mutual exclusion O Bounded waiting O Spinlock 4 23 2

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

Assume that the Ready Queue contains several Processes with varying burst times. If the scheduling algorithm is Round Robin with a time quantum longer than the burst times of all processes, which processes will be completed first? Your response: o Initial Procedure O Final Procedure The quickest method • Longest Process?? O Process with a burst time equal to time quantum (q)
Databases course Here is a schedule with one action missing: R1(C); W2(D); R2(B); ???; W1(A); R3(D); W2(C); W3(B)Figure out which READ actions could replace the ??? and make the schedule not conflict-serializable. Find all possible solutions.
Suppose there are three processes, P1, P2, and P3, and three files, FileA, FileB, and FileC. P1 has FileA and wants FileC. P2 has FileB and wants FileA. P3 has FileC and wants FileB. a) Draw a resource allocation graph for this situation. b) Does the graph represent a deadlock? Why or why not? Explain.
The ready queue is divided into numerous queues by the Multilevel scheduling algorithm, each with its own scheduling policy or procedure. Decide on one of the following: Is this a fact or a myth? Processes should be scheduled in such a way as to minimise the time they spend waiting. Pick one: A True or False
Processes P1, P2, and P2 are queued to run. The arrival time of P1 is t = 0, the arrival time of P2 is t = 1, and the arrival time of P3 is t = 2. According to the first come first serve (FCFS) algorithm, processes are run by the operating system. P1 operates 7 time units, P2 4 time units, P3 operates 1 time unit. So what is the average waiting time (in time units) for this system? 0 5 3 7
in round robin when three processes have to enter the ready queue at the instant , if one process has just finished I/O the other has preempted from CPU due to expiration of its quantum and third (C) has just started. which one will be inserted last (ie lowest priority ) ? a) the process that has just finished I/O b) One of the three will be random be selected c) The process that has been pre-empted from CPU due to expiration of its quantum time. d) The process that has just started
If you are working with scheduling policies, you are requested to investigate the variation of round robin in which a process that has used its full time quantum is returned to the end of the READY queue, while one that has used half of its time quantum is returned to the middle of the queue and one that has used one-fourth of its time quantum goes to a place one-fourth of the distance away from the beginning of the queue. 5.1 Explain the advantages and disadvantages of this scheduling policy. 5.2 Identify the user group that would find this most advantageous. 5.3 Describe the unique threats to a data centre posed by disgruntled employees. Describe how you would identify such people, if possible, and how you would protect your system from these threats. 5.4 What are the parameters that affect the efficiency of the round robin?
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.
A deadlock occurs when a group of processes is stalled because one process is holding a resource and waiting for another process to obtain it. Consider the situation when two trains are approaching each other on the same track and there is only one track: once they are in front of each other, neither train can proceed. In operating systems, a similar scenario happens when two or more processes possess certain resources while waiting on resources owned by other processes (s). In the picture below, Process 1 is holding Resource 1 and waiting for Process 2 to acquire Resource 2, while Process 2 is waiting for Resource 1. Give an example of a realistic deadlock avoidance approach and describe the basic strategy behind it.
There are 3 resources R1, R2 and R3 with one instance each and three processes P1, P2 and P3 in an operating system. A snapshot of the system resource allocation graph shows the following: R1 is allocated to P2; R2 is allocated to P1; R3 is allocated to P3; P1 requests R1; P2 requests R3; P3 requests R2. Which of the following is true about this system? answer ) a)Undetermined b)There is deadlock in the system c)Deadlock will never happen d)There is no deadlock in the system
101. A deadlock can be broken by : a. abort one or more processes to break the circular wait b. abort all the process in the system c. preempt all resources from all processes d. none of the mentioned
7. 'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum all the their maximum needs is always less than m + n. In this set up a. deadlock can never occur b. deadlock may occur c. deadlock has to occur d. none of these