Question: Consider a paging memory system that uses 2-level paging with 1KB pages. Each index page accommodates 100 frame numbers. For simplicity, assume that 1K=1000 and
Consider a paging memory system that uses 2-level paging with 1KB pages. Each index page accommodates 100 frame numbers. For simplicity, assume that 1K=1000 and all numbers are decimal. Answer the questions that follow for this case:
| The address 3850 is in memory page (start from 0) | Answer 1Choose...1000031GBYes10GB110MB6NoNone of the mentioned1002Unknown |
| The maximum job size in this case is | Answer 2Choose...1000031GBYes10GB110MB6NoNone of the mentioned1002Unknown |
| If P1 size is 77KB then its index has exactly Y levels where Y= | Answer 3Choose...1000031GBYes10GB110MB6NoNone of the mentioned1002Unknown |
| There can be as many as X pages in the lower level index, where X= | Answer 4Choose...1000031GBYes10GB110MB6NoNone of the mentioned1002Unknown |
| Is the size of the frame pointer for this case realistic for a modern computer? | Answer 5Choose...1000031GBYes10GB110MB6NoNone of the mentioned1002Unknown |
| The address 600850 location is given in first (inner) level index page number | Answer 6Choose...1000031GBYes10GB110MB6NoNone of the mentioned1002Unknown |
| If P1 size is 990KB then its index has exactly Y levels where Y= |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
