Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Need urgent ans Need urgent ans ans will be rating you full O No 1 LU university, AU Suppose we have a machine with 32-bit

Need urgent ans Need urgent ans ans

will be rating you full

image text in transcribed

image text in transcribed

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

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Design Application And Administration

Authors: Michael Mannino, Michael V. Mannino

2nd Edition

0072880678, 9780072880670

More Books

Students also viewed these Databases questions

Question

6. Are my sources reliable?

Answered: 1 week ago

Question

5. Are my sources compelling?

Answered: 1 week ago