Scheduling policies can easily be depicted with some strings of characters. For example, let's say we run Job A for 10-time units and then run job B for 8-time units. Dur string of this policy would look like this : AAAAAAAAAABBBBBBBB The priorities of the jobs can also be represented by a string of numbers. For example, for the above string we could say Job A had a priority of 2 and Job Ba priority of 1, which remained constant thro the processing of the jobs. Our Priority string would look like this where each number corresponded to the priority of the job at that time step: 222222222211111111 Answer the following questions related to the scenario described below: Scenario 1: Using multi-level feedback queue scheduling for Jobs A, B. Assume a 3-level MLFQ (high priority is 2, medium priority is 1, low priority is 0). Assume jobs A and B don't require any I/O each with a runtime of 10 time-units and both entering the system at T=0. Assume a quantum length at the highest priority level is 1, then 2 at the middle and 3 for the lowest priority. Finally Assume in cases where Round Robin is Applied Job A is initially chosen over B.

Scheduling policies can easily be depicted with some strings of characters. For example, let's say we run Job A for 10-time units and then run job B for 8-time units. Dur string of this policy would look like this : AAAAAAAAAABBBBBBBB The priorities of the jobs can also be represented by a string of numbers. For example, for the above string we could say Job A had a priority of 2 and Job Ba priority of 1, which remained constant thro the processing of the jobs. Our Priority string would look like this where each number corresponded to the priority of the job at that time step: 222222222211111111 Answer the following questions related to the scenario described below: Scenario 1: Using multi-level feedback queue scheduling for Jobs A, B. Assume a 3-level MLFQ (high priority is 2, medium priority is 1, low priority is 0). Assume jobs A and B don't require any I/O each with a runtime of 10 time-units and both entering the system at T=0. Assume a quantum length at the highest priority level is 1, then 2 at the middle and 3 for the lowest priority. Finally Assume in cases where Round Robin is Applied Job A is initially chosen over B.

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

write a program that read an excel sheet that contains some animals' information. The information consists of animal name, its weight in N, its height in m, and its availability in Iraq. The program will ask the user to select one of the available animals, then print the corresponding .information
IN C++ programming This question is inspired by the famous Uno card game. Write an activity that takes two arguments: (1) the player's current hand and (2) the current upward card on the table. Work will be back true if the player is able to make the game, or false if the player must draw on the deck. A player can make a game if: They have a card the same color as the upside card. They have the same number card as the upside card. canPlay (["yellow 3", "yellow 7", "blue 8", "red 9", "red 2"], "red 1") => truth
Dynamic Programming
Write a program in C programming language. also provide a screenshot that it is workingHere is the question: Write a program that determines the correct input password of an account. If the inputed text is not the correct password, the text must display "password incorrect".
Write a program that displays a clock to show the current time, as shown in Figure 9.27a. To obtain the current time, use the datetime class in Supplement II.B.
In Chefland there is a competition with N participants (numbered 1 to N). There are N-IN-1 rounds in the competition; in each round two arbitrarily selected contestants will compete, one of them will lose and be eliminated from the competition. There are 10 weapon types (numbered 1 to 10). You are given the N strings s1,s2,s3.....sn. for each valid i and j, the jth character of Si is '1' if it has ii. contestant originally weapon of type jj or '0' otherwise. During each battle, for each type of j such that both contestants in that battle currently have type j weapons, those weapons of both contestants are destroyed; after the battle, the winner collects all remaining (undestroyed) weapons of the loser. Remember that each competitor can win or lose regardless of the weapons they have. The chef is bored watching the competition, so he wants to find the maximum possible number of weapons that the winner of the tournament could have after the last battle, regardless of which contestants…
Computer Science Write a Java program that reads a line and a line segment and then determines whether they intersect or not. When they overlap completely, consider that as intersecting. Use variables ((lp1x, lp1y), (lp2x, lp2y)) to represent a line and ((sp1x, sp1y), (sp2x, sp2y)) to represent a line segment
Computer Science Implement RSA encryption and decryption functions in Java. Note you should not use any existing security modules to perform the encryption/decryption tasks. Just write a program to compute the answers. Your program should ask user’s input for a public key (n, e), and for Q1 ask for m and display c; and ask for c and display private key d and original message m.
A private hospital would like to implement a Java application to manage patient-specialist appointment. The hospital has five specialists, in different areas of medicine (e.g. cardiac, renal, paediatric). These specialists have regular slots for appointments every week. For example, the cardiac specialist may have six slots available on Monday, Wednesday and Friday; for simplicity, we assume each slot starts on the hour (e.g. 9am, 10am etc).The system should be used by patients to schedule an appointment with a specialist. Each patient will first enter their unique hospital id number, and then the specialist they want to meet and desired date. The system will list the available slots for that specialist. The patient may then select one of the availableslots, select a different date, or a different specialist. The patient should also be shown a list of all booked appointments, which they have yet to attend. When the patient arrives for their appointment, they need to enter their…
In Chefland there is a competition with N participants (numbered 1 to N). There are N-IN-1 rounds in the competition; in each round two arbitrarily selected contestants will compete, one of them will lose and be eliminated from the competition. There are 10 weapon types (numbered 1 to 10). You are given the N strings s1,s2,s3.....sn. for each valid i and j, the jth character of Si is '1' if it has ii. contestant originally weapon of type jj or '0' otherwise. During each battle, for each type of j such that both contestants in that battle currently have type j weapons, those weapons of both contestants are destroyed; after the battle, the winner collects all remaining (undestroyed) weapons of the loser. Remember that each competitor can win or lose regardless of the weapons they have. The chef is bored watching the competition, so he wants to find the maximum possible number of weapons that the winner of the tournament could have after the last battle, regardless of which contestants…
Using Java programming language write a program to manage a hotel with 24 rooms;10 rooms are Executive, with price Gh ₵ 2500.00 per night, 7 rooms are Chalets, with amounts Gh ₵ 1500.00 per night7 rooms are Ordinary, with amount Gh ₵ 500.00 per night The program should allow customers to book for rooms for a number of nights, and update the number of empty rooms available for each category when a customer has paid fully and has checked-in; also update the number of empty rooms available when customer checks-out. Customers should make bookings with their first names, telephone number A customer should be prompted to know if a room is booked (meaning a another customer has booked it but has not paid fully, or has not checked-in) A customer should be prompted to know if a room is occupied (meaning a booked room has been fully paid for, or the customer has checked-in) A customer should be prompted to know if a room is available (meaning a room has neither been booked nor checked-in). A…
vvvHarry has a big wall clock, that got hit while he was playing. Now, the minute hand doesn't rotate by the angle 2π/3600 each second, but now it moves according to different angle x. You can assume that coordinates of the centre of the clock are (0, 0) and the length of the minute hand is l. One endpoint of the minute hand is always located at the clock centre; the other endpoint is initially located at the point (0, l). One second later, Harry observes that this endpoint is at distance d above the x-axis, i.e., the y-coordinate of this endpoint is equal to d. Harry is curious about where the minute hand will be (specifically, its y-coordinate) after t seconds. Because t can be very large, Harry can't wait for that moment. Please help him to write a python code that prints a single line containing the output.Input: 4 2 2Output4Harry has a big wall clock, that got hit while he was playing. Now, the minute hand doesn't rotate by the angle 2π/3600 each second, but now it moves according…