Need urgent ans Need urgent ans

will be rating you full

O No 1 LU university, AU Suppose we have a machine with 32-bit wide address bus. In order to conserve the page table memory and improve translation speed we use a 3 level multi page table such that the page table entries are 10, 8 and 6 bit wide for level 1, level 2 and level 3 respectively. For such a system calculate: a. The page size b. Virtual memory size c. Memory needed by page table d. Suppose we have a process that needs 256K of memory. How many page table entries will be needed at each level starting from level 3? Assume that one page table entry requires 2 bytes. No 2 1 Consider a multilevel queue scheduling with two queues i.e., queuel and queue2. Queuel is having higher priority and queuel is using the FCFS approach and queue2 is using the round-robin approach (time quantum = 2ms). a. Make the Gantt Chart b. Calculate the waiting time for each process. Process Arrival time Burst time Queue P1 5 ms 1 Oms Oms P2 3 ms 2 P3 Oms 8 ms N P4 Oms 6 ms 1 O No 1 LU university, AU Suppose we have a machine with 32-bit wide address bus. In order to conserve the page table memory and improve translation speed we use a 3 level multi page table such that the page table entries are 10, 8 and 6 bit wide for level 1, level 2 and level 3 respectively. For such a system calculate: a. The page size b. Virtual memory size c. Memory needed by page table d. Suppose we have a process that needs 256K of memory. How many page table entries will be needed at each level starting from level 3? Assume that one page table entry requires 2 bytes. No 2 1 Consider a multilevel queue scheduling with two queues i.e., queuel and queue2. Queuel is having higher priority and queuel is using the FCFS approach and queue2 is using the round-robin approach (time quantum = 2ms). a. Make the Gantt Chart b. Calculate the waiting time for each process. Process Arrival time Burst time Queue P1 5 ms 1 Oms Oms P2 3 ms 2 P3 Oms 8 ms N P4 Oms 6 ms 1