Determine mean process turnaround time

Assignment Help Data Structure & Algorithms
Reference no: EM1363606

Five batch jobs, A through E arrive at the scheduler at approximately the same time. They have estimated running times of 40ms, 50ms, 90ms, 30ms and 80ms respectively. Their priorities are 2, 3, 1, 5 and 4, respectively, with 1 being the highest priority. Specify the order in which processes execute and determine the mean process turnaround time for each of the following scheduling algorithms:

a) Round robin (assume the jobs are preemptable)

b) Priority scheduling

c) First come, first serve (assume order A, B, C, D, E)

d) Shortest job first

For (a), assume each process gets a fair share of time on the CPU. For (b) through (d), assume that only one job runs at a time until finished. Ignore process switching overhead (assume it takes 0 time).

Reference no: EM1363606

Questions Cloud

Write program to allow two users to play tic-tac-toe : Write a program that will allow two users to play tic-tac-toe. The program should ask for moves alternately from player X and player O.
Explain which one of the following makes up : Explain Which one of the following makes up the Administrative and regulatory agencies arena
What questions would you ask dynamic duos owners : Explain what questions would you ask Dynamic Duo's owners and what legal steps would you recommend that Dynamic Duo take?
Genetic syndrome causing facial malformations : Crouzon Syndrome is a genetic syndrome that cause facial malformations. It occurs in 1 in 60,000 births annually. This submission provides specific details about the syndrome and the treatments required to address the syndrome.
Determine mean process turnaround time : Their priorities are 2, 3, 1, 5 and 4, respectively, with 1 being the highest priority. Specify the order in which processes execute and determine the mean process turnaround time for each of the scheduling algorithms.
Tax consequences of transfer : There're 3 major requirements of Code Section 351: (1) the transfer must consist of property, (2) the transfer must be solely in exchange for stock and (3) the transferors must be in control immediately after the exchange.
Define the dielectric constant of the dielectric : define the dielectric constant of the dielectric.
Explain what is goodwill at work : Goodwill at Work - Explain what is goodwill at work and What are some examples of goodwill where you work
Technology in the areas of nursing : Do you think that there are areas of nursing that are not improved by increased technology? Why?

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Determine computational complexity of algorithm

Describe the algorithm in psuedo-code. You should give thought to what data structures(s) make sense for e client implementation. Determine computational complexity of your algorithm.

  Advantage of fast running time of insertion sort

Running time of quicksort can be enhanced in practice by taking advantage of fast running time of insertion sort when its input is "nearly" sorted.

  Algorithm for finding smallest element in unsorted array

Consider the following algorithm for finding the smallest element in an unsorted array: RANDOMMIN(A[1 .. n]). What is the exact expected number of executions of line ( )?

  Write down the algorithm to insert an item

Write down the sample code to create a Linked List and allocate storage space for a node Write down the algorithm to insert an item At the beginning of a linked list

  Testing item in array of member using sequential search

Look up each test item in array of member items, by using sequential search. What is the worst-case running time of it. (asymptotically, in terms of n and k)?

  Design algorithm to find the average miles per gallon

Design an algorithm to find the average miles per gallon. Sample data: 68723, 71289, 15.75, 16.30, 10.95, 20.65, 30.00.

  Describe implementation of algorithm on simd computer

Describe an implementation of that algorithm on an SIMD computer where the processors are connected to form a linear array

  Create a binary search tree program

Creating a Binary Search Tree program - Finding the largest and smallest values in the tree Add two class methods

  Online vs. face-to-face classes

Communication A significant distinction between online and face-to-face classes lies in the area of communication.

  Design analgorithm that decides for each node

Design an O(n) algorithm that decides (schedules) for each node at which time slot to start sending data such that the total number of time (slots) is minimized.

  Explaining simple symmetric encryption algorithm

Consider a simple symmetric encryption algorithm as follows:Is it a problem if the first block of input happens to be the same as the key? Explain why?

  Compare the average behavior of insertion sort

Compare the average behavior of insertion sort for n elements with that of the n insertions into an initially-empty straight array implementation of a priority queue

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd