Donate SIGN UP
Home > Science > Computer Architecture - Mips

Computer Architecture - Mips

Avatar Image
Joe111 | 20:54 Wed 27th Mar 2013 | Science
5 Answers
Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and
600 KB (in order), how would each of the first-fit, best-fit, and worst-fit
algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in
order)? Which algorithm makes the most efficient use of memory?
(7 marks)
prev Computer Architecture - Mips
  
next Computer Architecture - Mips
Gravatar

Answers

1 to 5 of 5rss feed

Best Answer

No best answer has yet been selected by Joe111. Once a best answer has been selected, it will be shown here.

For more on marking an answer as the "Best Answer", please visit our FAQ.
Avatar Image gen2
Are you telling me that you don't know what first-fit, best-fit, and worst-fit algorithms are? Their names are pretty self descriptive.
22:32 Wed 27th Mar 2013
Avatar Image boxtops
Joe's suspended, gen2
22:33 Wed 27th Mar 2013
Avatar Image DaisyNonna
Yer what?
22:39 Wed 27th Mar 2013
Avatar Image gen2
Just 'suspended' boxtops - He'll be back soon once the deadline has passed for handing in the answers (9am tomorrow).

I presume his rapid copy-paste of multiple questions in a short time looked like the actions of a spammer to the AB Protection Bots.
23:05 Wed 27th Mar 2013
Avatar Image omnipotence
Joe is trying to em "study" for an Exam for second year computer science at strathclyde university in glasgow. the exam is in 3hrs and 24 minutes as of this post, the questions are all from past papers of the last 2 years exams.
05:07 Mon 13th May 2013

1 to 5 of 5rss feed

Do you know the answer?

Computer Architecture - Mips

Answer Question >>