Reference no: EM133482420
Question 1. Why is it desirable to be able to relocate a process's address space in memory?
Question 2. What are the advantages and disadvantages of being able to swap a whole process in and out of memory?
Question 3. Why is the fixed partition allocation inefficient and wasteful?
Question 4. Given six memory partitions of 500 KB, 200 KB, 400 KB, 700 KB, and 100 KB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of size 231 KB, 553 KB, 374 KB, 62 KB, and 197 KB (in order)?
Question 5. What are the advantages and disadvantages of the first-fit, best-fit and worst-fit dynamic storage allocation strategies?
Question 6. What are the costs and benefits of a paging system?