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

1. a

2. a

3. d

explanation:

you already know many words that you use every day as part of your writing and you probably also know that certain words fit better in certain situations. tonight she will , sit) down and , write) a cover letter to when writing, you need to choose the correct word according to its spelling and

given the lack of choices, i'm gonna wing it and say that pushing your car off a cliff might not be the best idea. your car might sustain damage from the fall and will probably result in the car being too damaged to jump start.

if that's not good enough, avoid filling the car with bees. bees might get agitated when trapped or during the moving process, and might result in death or painful stings that will make jump starting your car very difficult. but in the event that you do choose to fill your car with bees, remember to wear protective gear!