435 views
0 votes
0 votes
Consider a virtual system with 2 level paging. 32 bit virtual address is used to support 32 bit physical address. Page size is 4096 bytes and page table has 4 bytes of page table entry. How many memory accesses are required to read or write a single word?

a)2

b)3

c)4

d)5

1 Answer

Best answer
1 votes
1 votes

According to my understanding, accessing the frame means we get all those words...

it is a 1-level paging ===> you have one Page Table but it should be kept somewhere in Memory

∴ Accessing Page Table Frame + Accessing required Page Frame ===> 2 Memory Read operations required

 

it is a 2-level paging ===> you have one Page Table but it should be kept somewhere in Memory

∴ Accessing 1st Page Table Frame + Accessing 2nd Page Table Frame + Accessing required Page Frame ===> 3 Memory Read operations required

 


it is a n-level paging ===> n+1 Memory Read operations required

selected by

Related questions

235
views
2 answers
1 votes
1.2k
views
1 answers
1 votes
DebRC asked Sep 12, 2022
1,153 views
Consider the following segment:Note : Assume the count = count + 1; will execute in 3' different instructions.Where, m[count] refers to memory value of count variable.Preemption ... = 15c) Min = 1, Maximum = 15d) Min = 15, Maximum = 15
1.7k
views
1 answers
1 votes
Shreya2002 asked Aug 5, 2022
1,656 views
Consider a process P running on a system with non-preemptive Kernel design. Consider following actions by P :(i) A blocking system call.(ii) Servicing a timer ... as ready.Which of the above actions always result in context-switch of P?
1.4k
views
2 answers
0 votes
Shreya2002 asked Aug 5, 2022
1,424 views
While of the following is incorrect?(a) if a system uses preemptive CPU scheduler then deadlock is not possible in system(b) Deadlock state is an ... scheduling then how can this statement could be incorrect. please clarify the doubt