1. Determine the number of locations required in the page tables for a three-level page mapping given that the virtual address has 32 bits divided into a 12-bit directory field, a 10-bit page field and a 10-bit line (offset) field. How many bits are there in the table entries for addresses?
2. Apply the first fir, best fit and worst fit placement algorithm to insert a 290 byte segment in a 10 Kbyte memory partition which contains segments at locations given in Table 2.1. Show the location of the incoming segment. Repeat, taking into account that no incoming segment will be less than 11 bytes.
