subject

Given six memory partitions of 300 kb, 600 kb, 350 kb, 200 kb, 750 kb, and 125 kb (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of size 115 kb, 500 kb, 358 kb, 200 kb, and

375 kb (in order)? rank the algorithms in terms of how efficiently they use memory.

a) first fit:

115 -> 300

500-> 600

358 -> 750

200 -> 350

375 -> not able to allocate

b) best fit:

115 -> 125

500 -> 600

358 -> 750

200 -> 200

375 -> not able to allocate

c) worst fit:

115 -> 750

500 -> 600

358 -> not able to allocate

200 -> 350

375 -> not able to allocate

ansver
Answers: 2

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 23:20
How can you tell if someone sent you a text message to your email instead of a email
Answers: 1
question
Computers and Technology, 23.06.2019 21:30
Enzo’s balance sheet for the month of july is shown. enzo’s balance sheet (july 2013) assets liabilities cash $600 credit card $4,000 investments $500 student loan $2,500 house $120,000 mortgage $80,000 car $6,000 car loan $2,000 total $127,100 total $88,500 which expression finds enzo’s net worth?
Answers: 1
question
Computers and Technology, 24.06.2019 00:30
Afiling system in which an intermediary source of reference, such as a file card, must be consulted to locate specific files is called a(n) system. a. shelf filing b. direct filing c. indirect filing d. shingling
Answers: 1
question
Computers and Technology, 24.06.2019 02:30
How to apply the fly in effect to objects on a slide
Answers: 1
You know the right answer?
Given six memory partitions of 300 kb, 600 kb, 350 kb, 200 kb, 750 kb, and 125 kb (in order), how wo...
Questions
question
Social Studies, 11.09.2019 23:10
question
Mathematics, 11.09.2019 23:10
question
Mathematics, 11.09.2019 23:10
Questions on the website: 13722360