Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged demand-paging
0
votes
1
answer
1
#Applied Course
Consider a demand-paging system with a paging disk that has an average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main memory, with an access time of 1 microsecond per memory access. Thus, each memory reference ... of the total) cause page faults. The effective memory access time is _____ micro-seconds (Round off to 1 decimal place)
Consider a demand-paging system with a paging disk that has an average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main ...
Dknights
190
views
Dknights
asked
Dec 18, 2023
Operating System
demand-paging
+
–
0
votes
2
answers
2
Ace Test Series | Operating System | Demand paging
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 frame is available or the page to be replaces is not ... of the time the page to be replaced has been modified? 600.19 micro seconds 590.19 micro seconds 790.19 micro seconds none
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...
none30
405
views
none30
asked
Jul 1, 2023
Operating System
operating-system
demand-paging
ace-test-series
page-fault
+
–
0
votes
1
answer
3
Ace Test Series | Operating System | Demand Paging
On a system using demand - paged memory, it takes 120 ns to satisfy a memory request if the page is in memory. If the page is not in memory, the request takes 5 ms. What would the page fault rate need to be to achieve an effective access time of 1 us? 25% 30% 18% 20%
On a system using demand - paged memory, it takes 120 ns to satisfy a memory request if the page is in memory. If the page is not in memory, the request takes 5 ms. What ...
none30
479
views
none30
asked
Jul 1, 2023
Operating System
operating-system
demand-paging
ace-test-series
+
–
11
votes
3
answers
4
GATE CSE 2022 | Question: 54
Consider a demand paging system with four page frames (initially empty) and $\text{LRU}$ page replacement policy. For the following page reference string $7, 2, 7, 3, 2, 5, 3, 4, 6, 7, 7, 1, 5, 6, 1$ the page fault rate, defined as the ratio of number of page faults to the number of memory accesses $\textit{(rounded off to one decimal place)}$ is _____________.
Consider a demand paging system with four page frames (initially empty) and $\text{LRU}$ page replacement policy. For the following page reference string$$7, 2, 7, 3, 2, ...
Arjun
7.8k
views
Arjun
asked
Feb 15, 2022
Operating System
gatecse-2022
numerical-answers
operating-system
page-replacement
demand-paging
2-marks
+
–
0
votes
1
answer
5
Applied Live Test
Given a byte addressable system which implements demand paging, a TLB has 64 entries and the frame size is 4KB. The LAS is 4MB. TLB has a hit ratio of 90% and has an access time of 2 ns. If the main memory access time is 100 ns and page fault is 5%. The page fault service time is given to be 100 ms. The TLB reach for this system given above is _____ B Anyone can help this.
Given a byte addressable system which implements demand paging, a TLB has 64 entries and the frame size is 4KB. The LAS is 4MB. TLB has a hit ratio of 90% and has an acce...
ramakrushna
494
views
ramakrushna
asked
Jan 3, 2022
Operating System
test-series
operating-system
demand-paging
translation-lookaside-buffer
+
–
2
votes
2
answers
6
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 10
The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ records per page, with $1$ free main memory frame is recorded as follows. What is the number of Page Faults? $0100,0200,0430,0499,0510,0530,0560,0120,0220,0240,0260,0320,0370.$ $15,4$ $6,4$ $7,2$ $4,6$
The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ records per page, with $1$ free main memory frame is re...
admin
1.7k
views
admin
asked
Apr 1, 2020
Operating System
nielit2017oct-assistanta-it
operating-system
demand-paging
page-fault
+
–
0
votes
1
answer
7
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 33
The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ records per page, with $1$ free main memory frame is recorded as follows. What is the number of Page Faults? $0100,0200,0430,0510,0530,0560,0120,0220,0240,0260,0320,0370.$ $15,4$ $6,4$ $7,2$ $4,6$
The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ records per page, with $1$ free main memory frame is re...
admin
2.0k
views
admin
asked
Apr 1, 2020
Operating System
nielit2017oct-assistanta-cs
operating-system
demand-paging
page-fault
+
–
0
votes
0
answers
8
Made Easy
Shouldnt we take 1 instead of 1-P ?? As it should be sequential access???
Shouldnt we take 1 instead of 1-P ?? As it should be sequential access???
anjali007
288
views
anjali007
asked
Jan 23, 2019
Operating System
operating-system
demand-paging
page-fault
+
–
0
votes
0
answers
9
demand paging
In a swapping system with variable partitions, segments have probability -s/10 distribution ( e / 10) where s is the segment size in kilobytes. Holes -h/5 have probability distribution ( e / 5) where h is the hole size in kilobytes. What is the ... .html i'm stuck at how average segment segment size and average hole size is calculated? please comment if you have got any insight.
In a swapping system with variable partitions, segments have probability -s/10 distribution ( e / 10) where s is the segment size in kilobytes. Holes -h/5 have probabilit...
aambazinga
280
views
aambazinga
asked
Dec 25, 2018
Operating System
operating-system
demand-paging
+
–
2
votes
4
answers
10
ISI2016-PCB-CS-3
Consider the following extract from a program, written in a C-like language, that computes the transpose of a matrix. for (i=0; i<N; i++) for (j=0; j<N; j++) B[i,j]=A[i,j]; $A$ and $B$ are $N \times N$ matrices with floating point entries ... Each of $A$ and $B$ is stored starting from the beginning of a page None of the pages allocated to $A$ and $B$ are initially in memory.
Consider the following extract from a program, written in a C-like language, that computes the transpose of a matrix.for (i=0; i<N; i++) for (j=0; j<N; j++) B[i,j]=A[i,j]...
go_editor
890
views
go_editor
asked
Sep 18, 2018
Operating System
isi2016-pcb-cs
operating-system
demand-paging
page-fault
non-gate
descriptive
+
–
2
votes
1
answer
11
MadeEasy Test Series: Operating System - Page Replacement
Consider a demand paged memory system, page table is held in registers. It takes 800 nsec to service a page fault if empty page is available or replaced page is not modified and 950 nsec if the replaced page is modified, ... modified 85% of time and page faultrate is 20% then average memory access time is ________. (Upto 1 decimal place)
Consider a demand paged memory system, page table is held in registers. It takes 800 nsec to service a page fault if empty page is available or replaced page is not modif...
jhaanuj2108
2.4k
views
jhaanuj2108
asked
Aug 14, 2018
Operating System
made-easy-test-series
operating-system
demand-paging
page-fault
page-replacement
+
–
0
votes
1
answer
12
Operating System Demand Paging
In a demand-paged system, it takes 100 nanoseconds to access memory. The page table has 8 entries and is held in registers. It takes 10 milliseconds to service a page fault if an empty frame is available or if the victim frame is not ... is dirty 80% of the time, find the maximum page fault rate for which the effective memory access time remains within 200 nanoseconds
In a demand-paged system, it takes 100 nanoseconds to access memory. The page table has 8 entries and is held in registers. It takes 10 milliseconds to service a page fau...
kauray
1.6k
views
kauray
asked
Dec 20, 2017
Operating System
operating-system
demand-paging
memory-management
+
–
6
votes
2
answers
13
Made easy test series
A demand paging system has page fault service time as 125 time units if page is not dirty and 400 times units of page fault service time if it is a dirty page. Memory access time is 10 time units. The probability of a page fault is 0.3. In case of ... is P. It is observed that average access time is 50 time units. Then, the value of P is ______? [upto four decimal places]
A demand paging system has page fault service time as 125 time units if page is not dirty and 400 times units of page fault service time if it is a dirty page. Memory acc...
shivangi5
1.7k
views
shivangi5
asked
Oct 27, 2017
Operating System
operating-system
demand-paging
memory-management
+
–
5
votes
2
answers
14
#Page Faults
The address sequence generated by tracing a particular program executing in a pure demand paging system with 200 records per page with 1 free main memory frame is recorded as follows: 0100, 0139, 0209, 0430, 0237, 0578, 0500, 0730, 0799, 0600 The number of page faults are ________.
The address sequence generated by tracing a particular program executing in a pure demand paging system with 200 records per page with 1 free main memory frame is recorde...
Tuhin Dutta
1.0k
views
Tuhin Dutta
asked
Oct 9, 2017
Operating System
operating-system
page-replacement
demand-paging
+
–
0
votes
2
answers
15
Difference between Dynamic Loading and Demand Paging
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 needed. Both don't seems to be same??
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...
Shubhanshu
2.0k
views
Shubhanshu
asked
Sep 11, 2017
Operating System
operating-system
demand-paging
loading
+
–
2
votes
1
answer
16
demand paging
In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if an empty frame is available or if the replaced page is not modified, and it takes 20 m.secs., if the replaced page is ... is modified 70% of the time ? What is the maximum acceptable page-fault rate for an effective access time of no more than 200 nanoseconds?
In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if an empty frame is available or if the replaced pa...
set2018
1.2k
views
set2018
asked
Aug 31, 2017
Operating System
demand-paging
operating-system
+
–
1
votes
0
answers
17
Demand Paging
Can anyone pls explain what is the concept applied here http://www.cs.jhu.edu/~yairamir/cs418/os6/sld010.htm
Can anyone pls explain what is the concept applied herehttp://www.cs.jhu.edu/~yairamir/cs418/os6/sld010.htm
Aashish S
731
views
Aashish S
asked
Jun 20, 2017
Operating System
demand-paging
operating-system
+
–
1
votes
1
answer
18
Test by Bikram | Mock GATE | Test 4 | Question: 22
What is the technique that allows one to execute a program which is not entirely in memory called? Demand Paging Auxiliary Memory Secondary Memory Virtual Memory
What is the technique that allows one to execute a program which is not entirely in memory called?Demand PagingAuxiliary MemorySecondary MemoryVirtual Memory
Bikram
411
views
Bikram
asked
May 14, 2017
Operating System
tbb-mockgate-4
operating-system
memory-management
virtual-memory
demand-paging
+
–
9
votes
4
answers
19
Demand Paging
Suppose: TLB lookup time = 20 ns TLB hit ratio = 80% memory access time = 75 ns swap page time = 500,000 ns 75% of pages are dirty OS uses a 3 level page table What is the effective access time (EAT) if we assume the page fault rate is 15% ?
Suppose:TLB lookup time = 20 nsTLB hit ratio = 80%memory access time = 75 nsswap page time = 500,000 ns75% of pages are dirtyOS uses a 3 level page tableWhat is the effec...
biranchi
4.5k
views
biranchi
asked
Jan 25, 2017
Operating System
operating-system
demand-paging
memory-management
multilevel-paging
+
–
0
votes
1
answer
20
TestBook TestSeries
TLB lookup time (th) = 20 ns TLB hit ratio (ht) = 99% Memory access time (ts) = 100 ns Page fault rate (hp) =0.05% Swap page time (in or out) (tp) = 5000,000 ns What is the effective access time (EAT) if we assume that all pages currently in main memory are dirty? 5118.91 ns 51.21 ns 5120.9 ns None of the above
TLB lookup time (th) = 20 nsTLB hit ratio (ht) = 99%Memory access time (ts) = 100 nsPage fault rate (hp) =0.05%Swap page time (in or out) (tp) = 5000,000 nsWhat is the ef...
vnc
712
views
vnc
asked
Jan 23, 2017
Operating System
operating-system
demand-paging
+
–
4
votes
1
answer
21
Demand Paging
Consider a demand-paging system with a paging disk that has average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main memory, with an access time of 1 microsecond per memory access. Thus, each memory reference ... , 10 percent (or 2 percent of the total) cause page faults. What is the effective memory access time in milliseconds?
Consider a demand-paging system with a paging disk that has average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main me...
biranchi
9.7k
views
biranchi
asked
Jan 22, 2017
Operating System
operating-system
demand-paging
memory-management
+
–
1
votes
1
answer
22
Which of the following programming techniques and structures are good for demand-paged environment
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 Only a Both a, b Both a, c please explain with the reason
Which of the following programming techniques and structures are good for demand-paged environmenta)Stackb)Hashed symbol tablec)Sequential searchd)Pure code Only a Both...
Akriti sood
2.7k
views
Akriti sood
asked
Dec 4, 2016
Operating System
operating-system
demand-paging
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register