200 views
0 0 votes

Consider the page table for a system with 16-bit virtual and physical addresses and 4,096-byte pages.

The reference bit for a page is set to 1 when the page has been ref- erenced. Periodically, a thread zeroes out all values of the reference bit. A dash for a page frame indicates that the page is not in memory. The page-replacement algorithm is localized LRU, and all numbers are provided in decimal.

A) Convert the following virtual addresses (in hexadecimal) to the equivalent physical addresses. You may provide answers in either hexadecimal or decimal. Also set the reference bit for the appro- priate entry in the page table.

• 0x621C

• 0xF0A3

• 0xBC1A

• 0x5BAA

• 0x0BA1

B)Using the above addresses as a guide, provide an example of alogical address (in hexadecimal) that results in a page fault

C)From what set of page frames will the LRU page-replacement algorithm choose in resolving a page fault?

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
1 1 answer
193
193 views
tarunmundriya asked Dec 27, 2025
193 views
Consider the page table for a system with 12-bit virtual and physical addresses and 256-byte pages.The list of free page frames is D, E, F (that is, D is at the head of t...
1 1 vote
2 2 answers
476
476 views
tarunmundriya asked Dec 27, 2025
476 views
Consider the two-dimensional array A:int A[][] = new int[100][100];where A[0][0] is at location 200 in a paged memory system with pages of size 200. A small process that ...
0 0 votes
0 0 answers
214
214 views
tarunmundriya asked Dec 27, 2025
214 views
Given six memory partitions of 300 KB, 600 KB, 350 KB, 200 KB, 750 KB, and 125 KB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes ...
0 0 votes
1 1 answer
2.6k
2.6k views
Harsh Kumar asked Aug 14, 2018
2,551 views
A simplified view of thread states is Ready, Running, andBlocked, where a thread is either ready andwaiting to be scheduled, is running on the processor, or is blocked (f...