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

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…
. You have a shopping list of some items. You want to substitute one of the items with some other items. Write a script that does that. For example: Your old shopping list is: ['apple', 'pear', 'orange', 'grape'] Enter 3 new items: banana peach kiwi Enter the item to be replaced: orange New list: ['apple', 'pear', ['banana', 'peach', 'kiwi'], 'grape']
Write a program that reads a string (password) and a number. The maximum number of attempts (3). The program with stop asking data if the word ‘quit’ is provided in the password value. If user provide correct credentials the message access granted will be displayed otherwise the message access denied with be generated
Write a python program that takes a string as an input from the user. Then check which email domain the user is using and print it. For this question, assume you have only 4 email domains available and they are gmail, yahoo, outlook, and bracu. [You are NOT allowed to use split() and sting slicing for this task] Sample Input 1: tom@gmail.com Sample Output 1: The user is using gmail as a mailing domain. Explanation 1: Since gmail domain is being used by the user. Sample Input 2: kelvin@yahoo.com Sample Output 2: The user is using yahoo as a mailing domain. Explanation 2: Since yahoo domain is being used by the user. II
Write a program that reads a string (password) and a number. The maximum number of attempts (3). The program with stop asking data if the word ‘quit’ is provided in the password value. If user provide correct credential the message access granted will be displayed otherwise the message access denied with be generated.
Fast
Whenever you mail a letter, you must decide how much postage to put on the envelope. You like to use this rule of thumb – use a stamp for every five sheets of paper or fraction thereof. For example, if you have 11 sheets of paper, then you use three stamps. Since you’re parsimonious, if an envelope requires more than three stamps, then you simply don’t mail the envelope. Show how the number of stamps per envelope would be calculated. Provide a solution in the form of pseudocode. Your pseudocode must read in appropriate data and print how many stamps to use.
The chef Kunal Kapur wants to prepare a special meal in the final of MasterChef India. There is a special Kunal's recipe for this dish, so he decided to get it all over the MasterChef. After some research, he found it in a secret cave. He can only enter the cave if he has a password; Fortunately, the string S, which serves as the password for this password, is written next to the cave. The chef knows that a secret password is a blank start for string S. Also, you know that: if the start-up appears in S as often as a substring, then the probability that this start-up is a higher secret password (the probability that the prefix is selected as a secret password is an increasing number of events in S) if two start-ups have the same number of events in S, then a longer start has a higher chance of being a secret password The chef wants to guess the secret password with great chance of success. Help the Chef and get a start where this opportunity is high. Example Input 3 abc Example Output…
artificial intelligence
A group of m people is considering sharing the cost of buying some items for their summer camp. There are a total of n possible items to purchase. Each person writes a list of the items they are interested in purchasing on a paper. For example, person one may write “boat, trampoline, hot tub,” whereas person two may write “ hot tub, kayak, paddleboard”. There is no limit to how many items a person registers on their sheet. The goal is to determine if at least k items can be purchased. The following rules apply 1. The cost of any purchased item must be split equally among all those who listed that item on their sheet. No person can refuse to contribute to an item chosen for purchase, which is listed on their sheet. 2. Since each person has a limited budget, they may only contribute to at most one item on their list. The problem of determining if at least k items can be purchased is called SummerCamp. Show that this problem is NP-complete.
This sequence of numbers can start with any positive number n. s is the sum of the individual digits in n. If s divides n equally it means that the next term of the series is n// s. Otherwise the next word is n * s. Eventually the series will come to an end when two numbers are exchanged: 58, 754, 12064, 928, 17632, 928, 17632. This series has 5 lengths and 17632 as the last term. S Create a function that takes a positive number and returns its series length and its final term. Examples deadEnd (5) [2, 1] deadEnd (11) [7, 11440]
Q1 Creating RES Give a regular expression for the language I over the alphabet = {0, 1}, where every string in I must contain the substring 110, but cannot have more that two consecutive O's. For example, 110 € L, 1100 € L, 11000 € L, 1111011111 EL, 1011010111 L, 1011010011 L, 1011010001L, 01010 € L