Answer Happy

1. Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of 210 KB, 415 KB, 113 KB, and 427 KB (in order)? Which algorithm makes the most efficient use of memory? (25 pts) 2. Consider the following segment table, what are the physical addresses for the following logical addresses? (20 pts) Segment Base Length 0 219 600 1 2300 14 2 90 100 1327 580 1952 96 (a) 1,12 (b) 3,650 (c) 4,76
3. Assuming a 1-KB page size, what are the page numbers and offsets for the following address references (provided as decimal numbers). (25 pts) (a) 2377 (b) 20000 (c) 16385 4. Consider a logical address space of 256 pages of 1,024 bytes each, mapped onto a physical memory of 128 frames. (30 pts) (a) How many bits are there in the logical address? (b) How many bits are there in the physical address? (c) If a logical address is generated as page number = 10, offset = 23 with page table indicating that the index 10 is mapped to frame number 2, then what would be the corresponding physical address in memory? Suppose that one byte is equal to one word and the memory is a word addressable.