Consider the following process with burst times and arrival times.Process Burst timeArrival TimePO8P1P24P37Which of the following statements are correct?I.The average waiting time will be same using shortest job first and shortest remainingtime first.The waiting time of process PO and process P1 using Round Robin CPU schedulingpolicy with time quantum as 3 units is same.The average waiting time using first come first serve is less than the average waitingtime using short remaining time first.II.III.(A) Only I(B) Only II(C)I and II(D)I and III

Your question is about some statements on SRTF, RR ,FCFS etc. Let's see correct statements of the…

Consider the following process with burst times and arrival times. Process Burst time Arrival Time PO 8 P1 P2 4 P3 1 7 Which of the following statements are correct? I. The average waiting time will be same using shortest job first and shortest remaining time first. П. The waiting time of process PO and process P1 using Round Robin CPU scheduling policy with time quantum as 3 units is same. The average waiting time using first come first serve is less than the average waiting time using short remaining time first. III. (A)Only I (B) Only II (C)I and II (D)I and III

Consider the following process with burst times and arrival times. Process Burst time Arrival Time PO 8 P1 P2 4 P3 1 7 Which of the following statements are correct? I. The average waiting time will be same using shortest job first and shortest remaining time first. П. The waiting time of process PO and process P1 using Round Robin CPU scheduling policy with time quantum as 3 units is same. The average waiting time using first come first serve is less than the average waiting time using short remaining time first. III. (A)Only I (B) Only II (C)I and II (D)I and III

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

Related questions

Q: 3). Recently New Delhi was reported as the most polluted city by WHO. Indian Govt came up with…

A: Program: #include <stdio.h> int main() { int car_number; printf("Enter the Car plate…

Q: In Afghanistan N Taliban Soldiers are lined up for a memory test. They are numbered from 0 to N-1…

A: Required:

Q: om peg C to peg A. Move disk 2 from peg C to peg B. Move disk 1 from peg A to peg B. Move disk 4…

A: Disclaimer : As it was not mentioned I have solved the question in Python language Code: def…

Q: a. Following are the processes need to be scheduled, apply all algorithms i.e FCFS,…

A: Given: Following are the processes need to be scheduled, apply all algorithms i.e FCFS,…

Q: Select all of the following statements that are true 0 After the execution of the banker's…

A: If the subsequent state of the system does not result in deadlock, the request for any resource will…

Q: Consider the following process with burst times and arrival times. Process Burst time Arrival Time…

A: The answer as given below:

Q: Assume the following distribution of instructions for a given program: Arithmetic Store Load Branch…

A: Given: Goal:

Q: For microprocessors with adjustable voltage, reduction in voltage may result in reduction in…

A: This question comes from Microprocessor which is a paper of Computer Science. Let's discuss it in…

Q: Suppose that a process is executing “counter=counter+1" while another process is executing…

A: Given that the value of counter is five before execution.

Q: 1. Shortest Remaining Time (SRT) is used to schedule the arriving processes. Jobs and arrival…

A: Shortest remaining time also known as shortest remaining time first is a scheduling method that is a…

Q: Amdahl's Law is as applicable to software as it is to hardware. An oft-cited programming truism…

Q: Process Scheduling: Select all statements below that a The time quantum T for RR should be larger…

A: Answers: The statements which are true are: The time quantum T for RR should be larger than average…

Q: At a particular instance, the memory of a computer appears as shown below. Apply the Memory…

A: A) in first fit algorithm, choose the first block which is free and big enough to accommodate the…

Q: AI Rafa Supermarkets has implemented a new policy in cash counter: "Customers who are having less…

A: Given, Customers who are having less items are served first. In the Shortest Remaining Time First…

Q: Consider the following execution on our system:…

A: A ) The process A is more interactive because it is getting chance for execution each time with…

Q: Suppose you have 6 activities with corresponding start and end time, the objective is to compute an…

A: Activity Selection Problem It is an optimization problem which offers the selection of…

Q: Develop Python code for the given problem statement: In Afghanistan N Taliban Soldiers are lined up…

A: Algorithm: 1. Take the test case input provided by the user.2. Now find the top values of the…

Q: Develop a program in C to create three processes A, B and C. Job of these individual processes are…

A: Answer: I have done code and also I have attached code as well as code screenshot.

Q: Consider the last 5 alphabets of your name as processes. The size of the process is the ASCII code…

A: Last five alphabate of name are ufyan Process Burst time priority waiting time U 10 1 0 F 10…

Q: SeaMoney has a feature to transfer money between users. Let's imagine a simple scenario. N…

A: Using hashmap to store the username as key and balance as associated value with the key. Below is…

Q: CPU scheduler will decide which process should be given the CPU for its execution. For this it uses…

A: #include <stdio.h>int main() { int n; printf("Enter the number of processes: "); scanf("%d",…

Q: a certain program P requires 5 s. of CPU time, but must also do I/O of k bytes. I/O is of course…

A: To solve this problem, let's break down the time required for the program to execute given different…

Q: 6. Consider the following job arrival and CPU burst times given: CPU burst TTT Job Arrival time A 4.…

A: Step-1 Check the process arrival time at time 0 process A is entering in the ready queue. In the…

Q: In a school, there are four teachers X1,X2, X3,X4 and five batches Y1,Y2,Y3,Y4,Y5. Given that…

A: The Answer is in step-2.

Concept explainers

Properties of different architectures

Software architectures are the blueprint of a software system. They consist of all components involved in a system, relations between various components, the environment of operation, and the principle used in designing the software. In other words, software architecture shows the organization of different software structures and helps understand their behavior.

Question

Consider the following process with burst times and arrival times.
Process Burst time
Arrival Time
PO
8
P1
P2
4
P3
7
Which of the following statements are correct?
I.
The average waiting time will be same using shortest job first and shortest remaining
time first.
The waiting time of process PO and process P1 using Round Robin CPU scheduling
policy with time quantum as 3 units is same.
The average waiting time using first come first serve is less than the average waiting
time using short remaining time first.
II.
III.
(A) Only I
(B) Only II
(C)I and II
(D)I and III

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Can you please draw the time chart for the schedule? I need time chart. Thanks
For the employee file discussed in illustrative problem 18.1, making use ofTable P18.1, answer the questions given below:Records from the employee file are to be read and, by making use of the basicpay, allowances and deductions, the total salary is to be computed for eachemployee. Assume that it takes 200 µs of CPU time to perform the computation fora single record. The updated records are to be written onto the disk.a) What is the time taken to process a sector of records?b) Having processed a sector of records, what is the time taken to process allrecords in the very next sector?c) What is the time taken to process the records, in all sectors of a track,assuming that the sectors are continuously read?d) What is the time taken to process all records in a cylinder?
The following table shows the execution time for three computers A, B, C that run three programs. A is the reference machine, use Geometric mean to compare the performance of the three computers. Which computer has the best performance? A A* Program 1 30 60 15 1.0 Program 2 20 100 80 1.0 Program 3 10 5 25 1.0 B.
Suppose we have three processes P0, P1, and P2. Process P0 executes statement S0 and process P1 executes statement S1 and process P2 executes statement S2. Use wait and signal to ensure the following: S2 is always executed before S1 and S1 is always executed before S0S0.