Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for page-fault+
21
votes
4
answers
1
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
10.4k
views
admin
asked
Feb 15, 2023
Operating System
gatecse-2023
operating-system
page-replacement
least-recently-used
page-fault
numerical-answers
2-marks
+
–
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
389
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
405
views
none30
asked
Jul 1, 2023
Operating System
operating-system
demand-paging
ace-test-series
page-fault
+
–
2
votes
1
answer
4
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
487
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
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.1k
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
657
views
Overflow04
asked
Jan 7, 2023
Operating System
operating-system
self-doubt
page-fault
+
–
0
votes
1
answer
7
UGC NET CSE | December 2009 | Part 2 | Question: 37
A page fault (A) is an error specific page. (B) is an access to the page not currently in memory. (C) occur when a page program occur in a page memory. (D) page used in the previous page reference
A page fault(A) is an error specific page.(B) is an access to the page not currently in memory.(C) occur when a page program occur in a page memory.(D) page used in the p...
rishu_darkshadow
542
views
rishu_darkshadow
asked
Sep 17, 2017
Operating System
ugcnetcse-dec2009-paper2
operating-system
page-fault
+
–
6
votes
4
answers
8
ISRO2020-30
Consider the following page reference string. $1\ 2\ 3\ 4\ 2\ 1\ 5\ 6\ 2\ 1\ 2\ 3\ 7\ 6\ 3\ 2\ 1\ 2\ 3\ 6\ $ What are the minimum number of frames required to get a single page fault for the above sequence assuming LRU replacement strategy? $7$ $4$ $6$ $5$
Consider the following page reference string.$1\ 2\ 3\ 4\ 2\ 1\ 5\ 6\ 2\ 1\ 2\ 3\ 7\ 6\ 3\ 2\ 1\ 2\ 3\ 6\ $What are the minimum number of frames required to get a single ...
Satbir
5.4k
views
Satbir
asked
Jan 13, 2020
Operating System
isro-2020
operating-system
memory-management
page-replacement
page-fault
normal
+
–
1
votes
1
answer
9
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
657
views
LRU
asked
Oct 20, 2021
Operating System
test-series
operating-system
effective-memory-access
page-fault
+
–
0
votes
2
answers
10
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
918
views
admin
asked
Mar 31, 2020
Operating System
nielit2016mar-scientistb
operating-system
page-replacement
page-fault
least-recently-used
+
–
5
votes
4
answers
11
ISRO2016-48
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 one having brought earlier than page 2. (LRU page replacement 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, 4Assume that the main memory can accommodate 3 pages and th...
habedo007
8.2k
views
habedo007
asked
Jul 5, 2016
Operating System
page-replacement
page-fault
isro2016
operating-system
+
–
1
votes
2
answers
12
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 13 (Page No. 255)
If an instruction takes $1\: nsec$ and a page fault takes an additional $n\: nsec,$ give a formula for the effective instruction time if page faults occur every $k$ instructions.
If an instruction takes $1\: nsec$ and a page fault takes an additional $n\: nsec,$ give a formula for the effective instruction time if page faults occur every $k$ instr...
admin
1.6k
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
page-fault
descriptive
+
–
0
votes
1
answer
13
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
+
–
3
votes
1
answer
14
gatebook-os
Consider a virtual memory system running on a RISC CPU. Page tables are not locked in memory and may be swapped to disk. An 1w (load word) instruction reads one data word from memory; the address is the sum of value in a register and an immediate constant ... In the worst case how many page faults could be generated as a result of the fetch, decode, and execution of an 1w instruction?
Consider a virtual memory system running on a RISC CPU. Page tables are not locked in memory and may be swapped to disk. An 1w (load word) instruction reads one data word...
rishi71662data4
2.3k
views
rishi71662data4
asked
Dec 21, 2017
Operating System
page-fault
operating-system
virtual-memory
+
–
2
votes
2
answers
15
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
+
–
1
votes
1
answer
16
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
+
–
1
votes
1
answer
17
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 42 (Page No. 259)
It has been observed that the number of instructions executed between page faults is directly proportional to the number of page frames allocated to a program. If the available memory is doubled, the mean interval between page faults ... page faults, how long would it take to run if twice as much memory were available?
It has been observed that the number of instructions executed between page faults is directly proportional to the number of page frames allocated to a program. If the ava...
admin
598
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
page-fault
descriptive
+
–
2
votes
4
answers
18
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
+
–
8
votes
2
answers
19
OS:- Page fault service time vs Effective memory access time
I got some doubt while solving previous year questions:- Since While calculating EMAT and question involves page fault service time,we use formulae:- p*s+(1-p)*m ,taken from Galvin p is page fault rate s is page fault service time m ... sense. So why in first reference/doubt we are not using 2m instead of m in case of NOT a page fault?
I got some doubt while solving previous year questions:-Since While calculating EMAT and question involves page fault service time,we use formulae:-p*s+(1-p)*m ,taken fro...
rahul sharma 5
12.8k
views
rahul sharma 5
asked
Aug 29, 2017
CO and Architecture
page-fault
operating-system
effective-memory-access
+
–
0
votes
1
answer
20
Galvin Edition 9 Exercise 9 Question 21 (Page No. 453)
Consider the following page reference string: $7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0 , 1.$ Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms ? $•$ $LRU$ $replacement$ $•$ $FIFO$ $replacement$ $•$ $Optimal$ $replacement$
Consider the following page reference string:$7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0 , 1.$Assuming demand paging with three frames, how many page faults ...
akash.dinkar12
4.2k
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
virtual-memory
page-fault
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register