Consider a Multilevel Queue scheduler with two queues, numbered 1 and 2. Queue 1 has higher priority over queue 2. Both queues use RR scheduling. Time Quantum: TQ1 = 3, TQ2 = 4 Process Burst Time Arrival Priority Queue PI 12 1 2 P2 P3 P4 Ps 4 5 1 5 12 10 18 Find average turnaround time, average waiting time.

Consider a Multilevel Queue scheduler with two queues, numbered 1 and 2. Queue 1 has higher priority over queue 2. Both queues use RR scheduling. Time Quantum: TQ1 = 3, TQ2 = 4 Process Burst Time Arrival Priority Queue PI 12 1 2 P2 P3 P4 Ps 4 5 1 5 12 10 18 Find average turnaround time, 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

Given a Resource Allocation Graph G with i processes Pi and j Resources Rj; graph G shows a particular situation at any time. Under which condition of G is it clear that a deadlock cannot occur?
Thus, I'm seeking to determine the time required to enqueue and dequeue a queue using two stacks. Thus, how long would it take to enqueue each number from 1 to n, but I want to dequeue two items for every four that I enqueue? I'm merely seeking an educated estimate as to how long this will take.
Dijkstra's single-source shortest path algorithm makes use of a priority queue Q of vertices with an associated value on which the queue is sorted and a sets of processed vertices for which it has determined the shortest distance from the source vertex s. The value on which the priority queue is ordered is the shortest distance from the source vertex s to the vertex u in Q using only vertices within S. O True O False
Please make sure you choose the right answer
a. If the size of circular queue K is 4 with indices number from 0 to 3 what would be the state of the queue after the following set of 8 operations below. Show in a diagram the state of queue K after each of the 8 operations. K. enqueue (“F") , K. enqueue (“R"), K.dequeue(), K. enqueue (“P"), dequeue(), K.front(), K. enqueue (“Z"), K. enqueue (“G")
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 tumaround time for Job 1 is 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 4 50 170 tumaround time for Job 3 is (a) 100 (b) 130 (c) 150 (d) 160 turnaround time for Job 4 is (a) 30 (b) 5o (c) 60 (d) 80 average 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 is tumaround time for Job 1 is (a) 230 (b) 250 (c) 300 (d) 400 (a) 100 (b) 120 (c) 140 (d) 190 turmaround time for Job 2 is turnaround time for Job 2 is (a) 200 (b) 220 (c)…
8. Ilustrate Dynamic Programming algorithm to compute the minimum cost for the following assermbly line scheduling problem. Compute the F-table and L-table, and trace the path. e-12. 2.
3. Suppose you have a queue in which the values 1 through 5 must be enqueued on the queue in that order, but that an item on the queue can be dequeued and printed at any time. Based on these constraints, give the list of operations that would produce each of the following sequences. If it is not possible, state so. a. 1 3 5 4 2 b. 1 2 3 4 5 c. Are there sequences that cannot occur? Explain why or why not.
a. b. C. d. e. f. After many insertions and deletions of items to a circular queue; the final status looks like the figure given below: myFront = 4 and myBack = 2 1 myBack 0 X P A D 3 How many items are in the circular queue? What are the items? (Write characters) What is the front item (letter) in the queue? What is the rear item (letter) in the queue? If 'F' is inserted in the existing queue; what will be the value of myBack and myFront? myFront = and myBack = If the front item is removed; myBack? myFront = myFront what will be the value of myFront and and myBack =
Need help in detail:
Calculate average waiting time (AWT), average turnaround time (ATAT) and average response time (ART) for the following Ready Queue scenario by using following algorithms. Shortest Job First Algorithm (Preemptive) Round Robin where Time Quantum = 2 Analyze and tell that which one is efficient in term of AWT, ATAT and ART. Process Burst Time Arrival Time P1 4 3 P2 2 2 P3 5 1 P4 3 4 P5 6 5
Prob 1. Consider a dequeue() operation for a Dynamic Queue. For a n size Queue filled with n elements, show how the amortized running time O(1)* could be derived.“