I've attached a document I need help with three essay questions: 1,2, and 5...thank u 

 

Chapter 2: Memory Management: Simple SystemsTRUE/FALSE1.Single­user systems in a non­networked environment allocate, to each user, access to all availablemain memory for each job, and jobs are processed sequentially, one after the other.True2.A single­user system supports multiprogramming.False3.The first attempt to allow for multiprogramming used fixed partitions.True4.Single­user contiguous allocation schemes have the problem of partition intrusion..True5.The algorithm used to store jobs into memory in a fixed partition system requires a few more stepsthan the one used for a single­user system because the size of the job must be matched with the size ofthe partition to make sure it fits completely.True6.The fixed partition scheme does not require that the entire program be stored contiguously and inmemory from the beginning to the end of its execution.False7.The fixed partition scheme works well if all of the jobs run on the system are of the same size or if thesizes are known ahead of time and don’t vary between reconfigurations.True8.In a fixed partition scheme, large jobs will need to wait if the large partitions are already booked, andthey will be rejected if they’re too big to fit into the largest partition.True9.The best­fit allocation method keeps the free/busy lists organized by memory locations, low­ordermemory to high­order memory.False10.A large job can have problems with a first­fit memory allocation scheme.True11.The first­fit algorithm assumes that the Memory Manager keeps only one list containing free memoryblocks.False12.One of the problems with the best­fit algorithm is that the entire table must be searched before theallocation can be made because the memory blocks are physically stored in sequence according to theirlocation in memory.True13.Research continues to focus on finding the optimum allocation scheme.True14.For a fixed partition system, memory deallocation is relatively complex.False

Attachments:

• 1494556451-ch2A-2.rtf.pdf