• retagged by
3,480 views
1 1 vote

Which of the following programming techniques and structures are good for demand-paged environment
a)Stack
b)Hashed symbol table
c)Sequential search
d)Pure code

  1.   Only a
  2.   Both a, b
  3.   Both a, c

please explain with the reason

1 Answer

Best answer
1 1 vote

Stack is used if LRU replacement algorithm is employed. 

Hashed symbol table is employed during compiling, when we talk about demand paging we're talking about low level instructions availability which suggests the post compiling time period. 

Sequential search as pages are randomly scattered due to page replacements. 

Therefore I think a & c. 

• selected by
Position:
Show:

Related questions

0 0 votes
2 2 answers
2.7k
2.7k views
Shubhanshu asked Sep 11, 2017
2,662 views
In Dynamic Loading:- We load the particular module into the main memory when it is needed.In Demand Paging:- We load the particular page into the main memory when it is n...
1 1 vote
1 1 answer
90
90 views
GO Classes asked Aug 13
90 views
Suppose a $32K \times 8K$ matrix $A$ with $1$-byte elements is stored in row-major order in virtual memory.Assume:Only this program occupies physical memory. The matrix b...
3 3 votes
2 2 answers
136
136 views
GO Classes asked Aug 11
136 views
An operating system can use page tables and exceptions to perform allocation on demand, where it does not allocate physical memory for a program until the program tries t...
0 0 votes
1 1 answer
1.5k
1.5k views
none30 asked Jul 1, 2023
1,524 views
On a system using demand paging, it takes 200 ns to satisfy a memory request if the page is in memory. If the page is not in memory, the request takes 7 ms if a free fram...