Here they say
Page table has m enties
Inverted page table has n entries
Now suppose if the page is need to be brought from Conventional paging technique then
Page table has to be used . Here each process will have Page table of its own . we will go to the pAge table which itself lies in a memory so access time is m
While if paging is done be inverted table method then
Here we dont have process page table
Here we keep information about for which frame has which pages of a process
supossed there are 5 frames then
Frame 1 : p1 :2 ( it mean frame 1 has Process p1 second page )
Frame 1 : p2 :2 ( it mean frame 2 has Process p2 second page )
similary others
At worst case you may need a page which is stored at N entries (last entries )
n* k memory acces time
So answer should be a
