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

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 19PE

See similar textbooks

Similar questions

In a timesharing OS we have the following cpu timeline for two tasks X and Y. The timeslice is 1s.Both tasks are available in the system at the same time t=9:00:00.000 and order of arrival is the obviousX followed by Y. (The decimals reflect milliseconds if they showup in an indicated time reference.) There are no other processes (tasks) in the system other than X,Y. 1234567890 XYXYX--YXY The time line 1 indicates that at t=9:00:00s task X starts its execution and when t=9:00:01s is reached task Y takes over. The time line 1 indicates the 'first second' and time line 0 indicates the 'tenth second' above.Task Y completes its execution at t=9:00:10s, the completion of the tenth second since X started its execution. Task X has completed its execution earlier. (a) What is the total number of context switches starting from prior to t=9:00:00s (e.g. t=8:59:59.999) through thecompletion of $Y$? answer is 16s (b) What is the turnaround time for Y? answer is 10s (c) What is…
Question 02: The following table shows the execution times, in seconds, for five different benchmark programs on three machines. Processor Benchmark R M Z E 417 244 134 F 83 70 70 H 66 153 135 I K 39,449 35,527 66,000 772 368 369 a. Compute the speed metric for each processor for each benchmark, normalized to machine R. That is, the ratio values for R are all 1.0. Other ratios are calculated using Equation (A) with R treated as the reference system. Then compute the arithmetic mean value for each system. b. Repeat part (a) using M as the reference machine. c. Which machine is the slowest based on each of the preceding two calculations? d. Repeat the calculations of parts (a) and (b) using the geometric mean. Which machine is the slowest based on the two calculations? Related Information for Solving Question 2: The speed metric measures the ability of a computer to complete a single task. SPEC (Standard Performance Evaluation Corporation) defines a base runtime for each benchmark…
Let I represent an execution of init(s), W of wait(s), and S of signal(s). Then, for example, IWWS represents the sequence of calls init(s), wait(s), wait(s), and signal(s) by some processes in an operating system. For each of the following sequences of calls, state the value of s and the number of processes blocked after the last call in the sequence: *(a) IW (b) IS (c) ISSSW (d) IWWWS (e) ISWWWW
Suppose we have four machines that are using the Berkeley algorithm for clock synchronization. The time daemon is running on machine MO. The other machines are named M1, M2, and M3. The time readings on the four machines are as follows wenty-four hour clocks are usedt. MO 09:10 M1: 08:30 M2 10:10 M3: 07:14 In the third step of the algorithm, what are the values that the time daemon sends to each machine? Assume that the time values are expressed in minutes. Below, these values are presented in a vector value sent to MO, value sent to MI, value sent to M2. value sent to M3I none of these O84, 44, 96, 321 O(24, 16, -84, 92) O192. 84, 16. -24 O-32, 76, 40
Please use P and V operations to solve the following problem. There are two processes P0 and P1. P0 and P1 share a variable balance. Suppose that we enforce the order of the following events: P0 does some computation, and then updates the value of balance; P1 reads the value of balance, and does some computation. That is, P1 can only read the value of balance after P0 updates the value of balance.
Using a pseudo random number generation function (e.g., rand() in C or otherequivalent functions in other languages) that generates uniformly distributed randomnumbers, generate a workload for a system that is composed of 1000 processes. Youcan assume that processes arrive with an expected average arrival rate of 2 processesper second that follows a Poisson Distribution and the service time (i.e., requestedduration on the CPU) for each process follows an Exponential Distribution with anexpected average service time of 1 second. Your outcome would be printing out a listof tuples in the format of <process ID, arrival time, requested service time>.You can assume that process IDs are assigned incrementally when processes arriveand that they start at 1.Based on your actual experiment outcome, also answer the following question: whatare the actual average arrival rate and actual average service time that were generated?
Consider a computer running a program that requires 250 seconds, where 70 seconds is spent executing FP instructions, 55 seconds for INT operations, 85 seconds for load/save operations, and 40 seconds for branch instructions. By how much is the time for INT operations reduced if the total time is reduced by 20%?
Computer A has an overall CPI of 1.3 and can be run at a clock rate of 600MHz. Computer B has a CPI of 2.5 and can be run at a clock rate of 750 MHz. We have a particular program we wish to run. When compiled for computer A, this program has exactly 100,000 instructions. How many instructions would the program need to have when compiled for Computer B, in order for the two computers to have exactly the same execution time for this program? Please explain how to solve
A dentist office is currently using paper files to manage all office activities. To make their work easier, the office decided to build a software system to manage those activities instead of using their old paper-way methods. The office patients can take their appointments either by phone or by walking in person to the office lobby. In either way, the receptionist schedules an appointment for the patient with the desired date and time. The system shall not allow scheduling appointments with the same doctor for a duration of less than 30 minutes. Of course, the system shall accept appointments for a specific doctor if the doctor is working on that time. This means that the system shall keep track of each doctor working schedule. The office receptionist enters doctors working schedule in the form of working days for each week. For example, a doctor work schedule can be on Monday, Wednesday, and Thursday from 9:00 am until 4:00 pm for all weeks until June 01, 2021. Now, the office…
Create a program of priority scheduling algorithm on c++ with gantt chart the output should look like on the photo .. But its missing a gantt chart. I need answers asap please my dealine is 5 hrs from now
5-Consider a computer running a program that requires 400 s, with 80 s spent executing FP instructions, 40 s executed L/S instructions, and 40 s spent execut- ing branch instructions. • By how much is the total time reduced if the time for FP operations is reduced by 5%? • By how much is the time for INT operations reduced if the total time is reduced by 5%? • Can the total time can be reduced by 10% by reducing only the time for branch instructions?
Q3: Suppose there is a processing unit composed by CPU and I/O component. For a specific task, CPU takes 5 second to finish the execution and I/O takes 2 second to process. The communication time between CPU and I/O can be elimiate under this circumstance. Execution Time 7 second 5second 2 second CPU time I/O time If CPU time decreases by 25% per year for 3 years and I/O time decreases by 20% per year 1) How many times faster is this program after 3 years? 2) What percentage of new time is I/O? and what percentage of new time is CPU?