Given the following information: Process Arrival Time Burst Time Priority A 0 15 2 B 243 C 3 12 2 D 6 10 3 Calculate the start time, finish time, and waiting time for each process, and the average waiting time using Priority Scheduling with Round Robin scheduling algorithm. Use time quantum of 5. In this problem, we assume that high numbers represent high priority. Process Start Time Finish Time Waiting Time A B C D Average waiting time =

Given the following information: Process Arrival Time Burst Time Priority A 0 15 2 B 243 C 3 12 2 D 6 10 3 Calculate the start time, finish time, and waiting time for each process, and the average waiting time using Priority Scheduling with Round Robin scheduling algorithm. Use time quantum of 5. In this problem, we assume that high numbers represent high priority. Process Start Time Finish Time Waiting Time A B C D Average waiting time =

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

Job scheduling Consider the problem of scheduling n jobs of known durations t1,t2,. . .,tn for execution by a single processor. The jobs can be executed in any order, one job at a time. You want to find a schedule that minimizes the total time spent by all the jobs in the system. (The time spent by one job in the system is the sum of the time spent by this job in waiting plus the time spent on its execution.) Design a greedy algorithm for this problem. Does the greedy algorithm always yield an optimal solution?
Al Rafa Supermarkets has implemented a new policy in cash counter: "Customers who are having less items are serviced first". Four customers are waiting in the Billing counter to pay. Consider the scenario in terms of the Process Scheduling Algorithm. Customer Billing time Ci C2 C3 Total items 8 minutes 4 minutes 6 minutes 3 minutes 4 C4 3 You may consider drawing a Gantt chart for the above scenario after identifying the Process Scheduling Algorithm to answer the following questions: a) Find the Average Waiting Time is minutes b) Average Turnaround Time is minutes
Job scheduling: Consider the problem of scheduling n jobs of known durations t1, t2, . . . , tn for execution by a single processor. The jobs can be executed in any order, one job at a time. You want to find a schedule that minimizes the total time spent by all the jobs in the system. (The time spent by one job in the system is the sum of the time spent by this job in waiting plus the time spent on its execution.) Design a greedy algorithm for this problem. Does the greedy algorithm always yield an optimal solution? (Hint: You may get a clue from Prim’s Algorithm)
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
Customers are arriving at a queue at the rate of 6 customers per hour. Of these. 20% require a fixed service of 2 minutes duration. The rest require an exponential service time with the mean of 5 minutes. Find the following quantities and calculate the mean system delay (W) of this system. Write your answers below with two decimal places of accuracy and use minutes as the unit of time. Enter your answer here: ES] (min) Ejs*| (min?) The mean system delay W (min)
A well-known masseuse is considering which appointment requests to accept after receiving many back-to-back ones. She cannot take any neighbouring requests as she requires a 15-minute break in between sessions. Find the best (highest total booked minutes) set of appointment requests the masseuse can honour from a series of consecutive requests (all multiples of 15 minutes, no overlap, and none may be changed). Give me the time in minutes. EXAMPLEInput: {30, 15, 60, 75, 45, 15, 15, 45}Output180 minutes ({30, 60, 45, 45}).
As a teaching administrator of the department, your responsibility is to schedule the classes for a particular classroom. Suppose there are n classes, each class i is represented by its start time and finishing time [Si, fi], and we say that two classes i and j are non-conflicting if they do not overlap in time (i.e., sizfj or szfi). You want to schedule as many classes for the classroom as possible, but the scheduled classes should be non-conflicting. Develop an algorithm so that you can select the maximum number of classes for the classroom. (We are expecting either pseudocode or language description of your algorithm)
Given a set of jobs {J1, ... , Jn}, each job Ji = < ti, wi > has a required processing time ti and aweight wi. Design an efficient algorithm (pseudo code) to minimize the weighted sum of overallcompletion times ∑ni=1wiCi, where Ci is the completion time of job i. What is the time complexityof your algorithm? Note: You first need to briefly explain your ideas to solve the problem, e.g. what data structures are used, how the intermediate results are saved, which sorting strategy is used, and why the final results are correct;
A prominent masseuse is pondering which appointment invitations to accept after receiving a string of them. She requires a 15-minute pause between visits and hence cannot take any subsequent inquiries. Find the optimal (highest total booked minutes) set the masseuse can honour given a sequence of back-to-back appointment requests (all multiples of 15 minutes, none overlap, and none may be changed). Return the time in minutes.Input EXAMPLE: 30, 15, 60, 75, 45, 15, 15, 45180 minutes output (30, 60, 45, 45).
A celebrity has planned to give his/her live performance in Mumbai. He/she needs to travel from Kolkata to Mumbai by their own vehicle due to the safety reasons. Create an algorithm to help them to reach the destination with optimal cost. The cost factor may be attributed by fuel consumption, time taken and/or expected speed on a particular route which are depicted in the below map. By using the information provided for each city. Use the following algorithm to solve the problem: a) Iterative Deepening A*
Say in a scheduling scenario you are given a number of jobs, each with a start time and a finish time. Two jobs conflict if they overlap in time, i.e., one of them starts between the start and finish times of the other. Your goal is to select a maximum-size subset of jobs that have no conflicts. Example: Three jobs consuming the intervals [0, 3], [2, 5], and [4, 7]. The optimal solution in this case would consist of the first and third ones. Design and describe a greedy algorithm that computes an optimal solution to this problem. Informally argue why the solution is likely to be optimal and demonstrate on an example. You may assume that there are no ties.
No plagarism please! Correct and detailed answer will be Upvoted else downvoted. Thank you! Q. Which of the following is CORRECT for the weighted interval scheduling problem? 1. The original problem is one of the subproblems. 2. To ensure that a problem can be solved using dynamic programming, there should be a natural ordering on subproblems from “smallest” to “largest”. In the weighted interval scheduling problem, OPT(j) is a smaller problem than OPT(p(j)) 3. The recursive implementation of the algorithm for computing the optimal value without using memoization has o(n) complexity 4. Weighted interval scheduling problem has exponential computing complexity.