Alpha Geek

(8)

$10/per page/Negotiable

About Alpha Geek

Levels Tought:
University

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Environmental science,Essay writing,Programming,Social Science,Statistics Hide all
Teaching Since: Apr 2017
Last Sign in: 344 Weeks Ago, 3 Days Ago
Questions Answered: 9562
Tutorials Posted: 9559

Education

  • bachelor in business administration
    Polytechnic State University Sanluis
    Jan-2006 - Nov-2010

  • CPA
    Polytechnic State University
    Jan-2012 - Nov-2016

Experience

  • Professor
    Harvard Square Academy (HS2)
    Mar-2012 - Present

Category > Accounting Posted 25 Apr 2017 My Price 3.00

Consider a system with a total of 150 units of memory

 

Consider a system with a total of 150 units of memory, allocated to three processes as shown:

Apply the banker’s algorithm to determine whether it would be safe to grant each of the following requests. If yes, indicate a sequence of terminations that could be guaranteed possible. If no, show the reduction of the resulting allocation table.

a. A fourth process arrives, with a maximum memory need of 60 and an initial need of 25 units.

b. A fourth process arrives, with a maximum memory need of 60 and an initial need of 35 units.

 

 

 
 

Answers

(8)
Status NEW Posted 25 Apr 2017 04:04 PM My Price 3.00

-----------

Attachments

file 1493138552-Answer.docx preview (221 words )
\----------- Co-----------nsi-----------der----------- a -----------sys-----------tem----------- wi-----------th -----------a t-----------ota-----------l o-----------f 1-----------50 -----------uni-----------ts -----------of -----------mem-----------ory-----------, a-----------llo-----------cat-----------ed -----------to -----------thr-----------ee -----------pro-----------ces-----------ses----------- as----------- sh-----------own-----------: ----------- A-----------ppl-----------y t-----------he -----------ban-----------ker-----------’-----------s a-----------lgo-----------rit-----------hm -----------to -----------det-----------erm-----------ine----------- wh-----------eth-----------er -----------it -----------wou-----------ld -----------be -----------saf-----------e t-----------o g-----------ran-----------t e-----------ach----------- of----------- th-----------e f-----------oll-----------owi-----------ng -----------req-----------ues-----------ts.----------- If----------- ye-----------s, -----------ind-----------ica-----------te -----------a s-----------equ-----------enc-----------e o-----------f t-----------erm-----------ina-----------tio-----------ns -----------tha-----------t c-----------oul-----------d b-----------e g-----------uar-----------ant-----------eed----------- po-----------ssi-----------ble-----------. I-----------f n-----------o, -----------sho-----------w t-----------he -----------red-----------uct-----------ion----------- of----------- th-----------e r-----------esu-----------lti-----------ng -----------all-----------oca-----------tio-----------n t-----------abl-----------e. ----------- a.----------- A -----------fou-----------rth----------- pr-----------oce-----------ss -----------arr-----------ive-----------s, -----------wit-----------h a----------- ma-----------xim-----------um -----------mem-----------ory----------- ne-----------ed -----------of -----------60 -----------and----------- an----------- in-----------iti-----------al -----------nee-----------d
Not Rated(0)