Table 1 shows that there are four jobs in the queue. Job 1 arived first, and 4 last. Their priority is given in shown in themiddle column (1 is the lowest, and 4 is highest), and CPU time is shown in right column. For the following questions,please circle the correct answer from the candidate list (time unit: second).Table 1Job # Priority CPU time(1) Using shortest-job-first scheduling algorithm,130tumaround time for Job 1 is90(a) 20(b) 30(c)50(d) 803480tumaround time for Job 2 is(a) 100(b) 130(c)(d) 250450170tumaround time for Job 3 is(a) 100(b) 130(c)150(d) 160turnaround time for Job 4 is(a) 30 (b) 5o(c)60(d) 80average turnaround time is(a) 100 (6) 110(c)120(d) 130(2) Using priority scheduling algorithm,(3) Using round-robin scheduling algorithm,tumaround time for Job 1 istumaround time for Job 1 is(a) 230(b) 250(c)300(d) 400(a) 100(b) 120(c)140(d) 190turmaround time for Job 2 isturnaround time for Job 2 is(a) 200(b) 220(c)300(d) 400(a) 200(b) 250(c)270(d) 300tumaround time for Job 3 isturnaround time for Job 3 is(a)30(b) 40(c)60(d) 80(a) 200(b) 220(c)240(d) 300tumaround time for Job 4 isturnaround time for Job 4 is(a)(b) 150(c)(d) 190130160(a) 100(b) 150(c) 180(d) 200average turnaround time isaverage turnaround time is(a) 125(b) 135(c)170(d) 185(a) 155.5(b) 177.5(c) 185.0(d) 197.5(1) When using shortest-job-first scheduling algorithm, what is the turnaround timefor Job 1, Job 2, Job 3, and Job 4? And what is the average turnaround time?1,2.

Answered: Image /qna-images/answer/b76a089e-fde4-4a76-b542-3374e60972ab.jpg

Table 1 shows that there are four jobs in the queue. Job 1 arived first, and 4 last. Their priority is given in shown in the middle column (1 is the lowest, and 4 is highest), and CPU time is shown in right column. For the following questions, please circle the correct answer from the candidate list (time unit: second). Table 1 Job # Priority CPU time (1) Using shortest-job-first scheduling algorithm, 1 30 turnaround time for Job 1 is 2 2 90 (a) 20 (b) 30 (c) 50 (d) 80 3 4 80 tumaround time for Job 2 is (a) 100 (b) 130 (c) (d) 250 3 50 170 tumaround time for Job 3 is (a) 100 (b) 130 (c) 150 (d) 160 tumaround time for Job 4 is (a) 30 (b) 50 (c) 60 (d) 80 average turnaround time is (a) 100 (b) 110 (c) 120 (d) 130 4,

Table 1 shows that there are four jobs in the queue. Job 1 arived first, and 4 last. Their priority is given in shown in the middle column (1 is the lowest, and 4 is highest), and CPU time is shown in right column. For the following questions, please circle the correct answer from the candidate list (time unit: second). Table 1 Job # Priority CPU time (1) Using shortest-job-first scheduling algorithm, 1 30 turnaround time for Job 1 is 2 2 90 (a) 20 (b) 30 (c) 50 (d) 80 3 4 80 tumaround time for Job 2 is (a) 100 (b) 130 (c) (d) 250 3 50 170 tumaround time for Job 3 is (a) 100 (b) 130 (c) 150 (d) 160 tumaround time for Job 4 is (a) 30 (b) 50 (c) 60 (d) 80 average turnaround time is (a) 100 (b) 110 (c) 120 (d) 130 4,

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

An industrial gas supplier every day supplies gas to its local manufacturing companies. On a particular day, the company has received following orders from 6 companies that they need to fulfill using their fleet of tankers each with a capacity of 100 units. Node 1 Node 2 Node 3 Node 4 Node 5 Node 6 Demand (Units) 40 Table below gives the distances (in Miles) between the companies central depot (Node 0) and the six customers (Node1, Node 2.....Node 6). Node 0 Node 1 Node 2 30 40 27 Node 0 Node 1 Node 2 Node 3 Node 4 Node 5 Node 6 30 40 37 52 60 31 45 27 21 29 26 20 20 38 20 30 32 10 Node 3 Node 4 Node 5 37 52 29 20 30 21 38 30 27 42 30 26 28 60 26 30 27 26 40 39 Node 6 31 20 32 42 28 39 (a) Use the sequential version of Savings algorithm to develop vehicle route that minimizes total distance travelled. (b) Use the parallel version of Savings algorithm to develop vehicle route that minimizes total distance travelled. How does this solution compare to one obtained in part (a)? Which one…
Consider a single-server queueing system with arrival and service details as: Interarrival times 3 2 6 2 45 Service times 2 5 5845 Prepare simulation table using Event Scheduling / Time Advance Algorithm for the given data. Stop simulation when the clock reaches 20. In the simulation table, include the following: 1) B: Cumulative Busy Time 2) MQ: Cumulative Maximum number of Customers in Queue 3) F: Cumulative number of Customers who spent more than 3 minutes in the system. 1
Complete weighted interval scheduling. Answers provided should be with respect to initial ordering of the intervals
Q3: Suppose there are 4 processors that arrived in an order below, you are using Shortest Job First Scheduling (Preemptive), you are asked to draw a Gantt chart and also find the average waiting time Process Name Arrival Time Burst Time Processor 1 13 Processor 2 18 Processor 3 25 Processor 4 9. 4 Processor 10 31
The traveling salesperson problem for the following instance 6 is to be solved using branch and bound starting at node a. Break ties alphabetically. v Which are the first 3 nodes dequeued from the priority queue? (Each node is identified by its path from the root) A. 28 v What is the bound for the node [a,d]? (Each node is identified by its path from the root) B. a.b.c.d.a - v A minimal tour is C. a,d,c,b,a v The minimal tour length is D. 34 E. a,b,d.c.a F. [a), [a,c), [a,d] G. [a]. [a,b]. [a,b,d.c,a]] Н. 19 1. 24 J. [a). [a.b). [a.c] K. a.c.b.d.a L. [a), [a,c), [a,c.d.b.a] М. 18
The following questions are based on a “Queue" data structure as shown in Figure Q2(a). [0] 2 [1] 8 [2] 4 rear [3] 44 [4] 81 front [5] 24 [6] Figure Q2(a) (i) How many data currently in the “Queue"?
Imagine you are a logistics manager for a major shipping company responsible for optimizing the delivery process. Your company operates in two different regions, each with its fleet of delivery trucks. The number of packages in each region can vary significantly, represented by two sorted lists: one for each region (nums1 and nums2). Your goal is to calculate the median delivery time it takes for packages to reach their destinations, considering both regions. This median time is crucial to ensure timely deliveries and customer satisfaction. The overall run time complexity should be O(log(m+n)), as you need an efficient method to calculate this median for effective logistics planning. In this logistics scenario, nums1 and nums2 represent the sorted lists of delivery times for each region. Just like in the original problem, you are tasked with finding the median efficiently, which is analogous to determining the median delivery time. Achieving this with O(log(m+n)) time complexity is…
Task 1: SJF Scheduling with preemption You can use the following input as sample: 2222 Proc P1 P5 Solution in a Gantt chart: P2 Process P1 P3 P4 2 P1 Sample Output Structure: P2 P3 AT 3 4 5 18 20 P4 P5 P2 Grant Chart: Pl P5 P2 P1 P5 P2 BT 8 on لیا لا 3 5 6 CT N HN B LOB N 22 ÔN H N ÔN ÔN 18 20 27 P2 28 Arrival Time 台 WT 11 H9965 0 2 3 4 5 P1 TAT 19 HAF 14 15 9 8 7 P4 Average waiting time: 8.0 Average turnaround time: 13.0 **Output values are random and do not match the given input. 11 Burst Time P1 P5 P2 P5 5 2 7 4 5 16 P1 P3 P3 23 P4 P3 P4
Asap