Question: There is a hashed page table, in which the hash function is h(p) = p mod m . Note that p is the page number;

There is a hashed page table, in which the hash function is h(p) = p mod m. Note that p is the page number; m is the number of entries in a page table. The format of each node in a chain is (page number, frame number, next pointer).There is a hashed page table, in which the hash function is

Answer the below 3 sub-questions:

What is the frame number of page 82?

what is the frame number of page 79?

which page number is listed in the wrong chain?

Page table 30 24 55 82 20 3 0 11 15 1 26 4 826 27 | 79 2 3 93 51 39 9 38 53 4 79 35

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!