Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged page-fault
1
votes
0
answers
1
Page replacement policy
For a certain page trace starting with no page in the memory, a demand-paged memory system operated under the LRU replacement policy results in 9 and 11 page faults when the primary memory is of 6 and 4 pages, respectively. When the same page trace is operated under the optimal policy, the number of page faults may be: (a) 9 and 7 (b) 7 and 9 (c) 10 and 12 (d) 6 and 7
For a certain page trace starting with no page in the memory, a demand-paged memory system operated under the LRU replacement policy results in 9 and 11 page faults when ...
Reetu Chaudhary
49
views
Reetu Chaudhary
asked
May 6
Operating System
operating-system
demand-paging
page-replacement
least-recently-used
page-fault
+
–
4
votes
1
answer
2
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 55
Consider the cache of size 512 bytes that is direct-mapped? Suppose the size of integer is 4 bytes and block size is 16 bytes. Assume cache is initially empty and all data except for the array x are stored in registers, and that the ... ) { sum += x[i]; } What is the miss rate for the above loop? (roundoff to two decimal places)
Consider the cache of size 512 bytes that is direct-mapped?Suppose the size of integer is 4 bytes and block size is 16 bytes. Assume cache is initially empty and all data...
GO Classes
486
views
GO Classes
asked
Feb 5
CO and Architecture
goclasses2024-mockgate-14
numerical-answers
co-and-architecture
cache-memory
page-fault
2-marks
+
–
0
votes
2
answers
3
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
528
views
none30
asked
Jul 1, 2023
Operating System
operating-system
demand-paging
ace-test-series
page-fault
+
–
22
votes
4
answers
4
GATE CSE 2023 | Question: 47
Consider the following two-dimensional array $\text{D}$ in the $\text{C}$ programming language, which is stored in row-major order: int D[128][128]; Demand paging is used for allocating memory and each physical page frame holds $512$ elements of the ... j++) D[j][i] *= 10; The number of page faults generated during the execution of this code snippet is _______________.
Consider the following two-dimensional array $\text{D}$ in the $\text{C}$ programming language, which is stored in row-major order:int D[128][128];Demand paging is used f...
admin
11.0k
views
admin
asked
Feb 15, 2023
Operating System
gatecse-2023
operating-system
page-replacement
least-recently-used
page-fault
numerical-answers
2-marks
+
–
1
votes
1
answer
5
GATE CSE 2023 | Memory Based Question: 20
Which of the following option guarantee that a computer system transit from user mode to kernel mode malloc call system call function call page fault
Which of the following option guarantee that a computer system transit from user mode to kernel modemalloc callsystem callfunction callpage fault
GO Classes
1.2k
views
GO Classes
asked
Feb 5, 2023
Operating System
memorybased-gatecse2023
goclasses
operating-system
page-fault
multiple-selects
+
–
0
votes
1
answer
6
Operating System
When a page is referred for the first time, then it will be counted in page fault or not?. E.g page reference 1,2,3,4,2,1. LRU is used with 3 frames(initially empty).
When a page is referred for the first time, then it will be counted in page fault or not?.E.g page reference 1,2,3,4,2,1.LRU is used with 3 frames(initially empty).
Overflow04
715
views
Overflow04
asked
Jan 7, 2023
Operating System
operating-system
self-doubt
page-fault
+
–
2
votes
1
answer
7
DRDO CSE 2022 Paper 2 | Question: 6
Compute the hit rate and miss/fault rate in least recently used page replacement algorithm for the given reference string with $4$ page frames. String: $7 \; 0 \; 1 \; 2 \; 0 \; 3 \; 4 \; 2 \; 3 \; 0 \; 3 \; 2 \; 1 \; 2 \; 0 \; 1$
Compute the hit rate and miss/fault rate in least recently used page replacement algorithm for the given reference string with $4$ page frames. String: $7 \; 0 \; 1 \; 2 ...
admin
541
views
admin
asked
Dec 15, 2022
Operating System
drdocse-2022-paper2
operating-system
page-replacement
least-recently-used
page-fault
4-marks
descriptive
+
–
1
votes
1
answer
8
Applied Test Series
In a paged memory, the page hit ratio is 0.35. The page fault service time takes 100 ns. The time required to access a page in primary memory is 10 ns. The effective memory access time required to access a page is ____ ns
In a paged memory, the page hit ratio is 0.35. The page fault service time takes 100 ns. The time required to access a page in primary memory is 10 ns. The effective memo...
LRU
734
views
LRU
asked
Oct 20, 2021
Operating System
test-series
operating-system
effective-memory-access
page-fault
+
–
2
votes
2
answers
9
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.8k
views
admin
asked
Apr 1, 2020
Operating System
nielit2017oct-assistanta-it
operating-system
demand-paging
page-fault
+
–
0
votes
1
answer
10
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.1k
views
admin
asked
Apr 1, 2020
Operating System
nielit2017oct-assistanta-cs
operating-system
demand-paging
page-fault
+
–
1
votes
1
answer
11
NIELIT 2017 DEC Scientific Assistant A - Section B: 58
Page fault frequency in an operating system is reduced when the : Process tend to be I/O bound Locality of reference is applicable to the process Size of pages is reduced Processes tend to be CPU bound
Page fault frequency in an operating system is reduced when the :Process tend to be I/O boundLocality of reference is applicable to the processSize of pages is reducedPro...
admin
1.3k
views
admin
asked
Mar 31, 2020
Operating System
nielit2017dec-assistanta
operating-system
page-fault
+
–
0
votes
2
answers
12
NIELIT 2016 MAR Scientist B - Section C: 38
Determine the number of page faults when references to pages occur in the following order: $1,2,4,5,2,1,2,4$. Assume that the main memory can accommodate $3$ pages and the main memory already has the pages $1$ and $2$, with page $1$ having been brought earlier than page $2$.(LRU algorithm is used). $3$ $5$ $4$ None of these.
Determine the number of page faults when references to pages occur in the following order: $1,2,4,5,2,1,2,4$. Assume that the main memory can accommodate $3$ pages and th...
admin
974
views
admin
asked
Mar 31, 2020
Operating System
nielit2016mar-scientistb
operating-system
page-replacement
page-fault
least-recently-used
+
–
0
votes
2
answers
13
NIELIT 2017 DEC Scientist B - Section B: 51
The total number of page faults for the reference string $1,2,3,4,5,6,7,8,9,10$ using FIFO page replacement policy for a process, if $3$ frames are allocated to it are $9$ $10$ $8$ $11$
The total number of page faults for the reference string $1,2,3,4,5,6,7,8,9,10$ using FIFO page replacement policy for a process, if $3$ frames are allocated to it are$9$...
admin
2.0k
views
admin
asked
Mar 30, 2020
Operating System
nielit2017dec-scientistb
operating-system
page-replacement
page-fault
+
–
Page:
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register