This question is from Operating System.

5 9+1 Given memory partitions of 150 KB, 400 KB, 250KB, 300 KB and 650 KB (in order), how would each of the first-fit, best-fit and worst-fit algorithms place processes of 224 KB, 405 KB, 98 KB and 500 KB (in that order)? Which algorithm results in least external fragmentation? Assuming a 2-KB page size, what are the page numbers and offsets for the following address references (provided as decimal numbers) 5 a) 3089 b) 32095 c) 235201 Consider a paging system with the page table stored in memory. 3.75 a) If a memory reference takes 150 nanoseconds how long does a paged memory reference take? b) If we add a TLB and 77 percent of all page-table references are TLB hits, what is the effective memory reference time? (Assume that finding a page-table entry in the TLB takes zero time, if the entry is there.)