Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged page-replacement
0
votes
0
answers
91
Operating System Concepts by Galvin- 9th edition
In Ch. 9- Vitual memory management- Topic no- 9.4.5.3 (Enhanced Second-Chance Algorithm)- Last paragraph, it is written that "The major difference between this algorithm (Enhanced Second-Chance Algorithm) and the simpler clock ... , modified (dirty) page is removed first whereas in other algorithm non-modified (non-dirty) page is removed first?
Swati Rauniyar
asked
in
Operating System
May 30, 2017
by
Swati Rauniyar
442
views
page-replacement
operating-system
3
votes
1
answer
92
Test by Bikram | Mock GATE | Test 4 | Question: 30
Consider the following statements: $S_1$: An increase in the number of page frames allotted to a process always increases the page fault rate in $\text{FIFO}$ page replacement policy, regardless of the page reference sequence $S_2$: It is not ... statements is/are CORRECT? Only $S_1$ Only $S_2$ Both $S_1$ and $S_2$ Neither $S_1$ nor $S_2$
Bikram
asked
in
Operating System
May 14, 2017
by
Bikram
669
views
tbb-mockgate-4
operating-system
runtime-environment
page-replacement
2
votes
1
answer
93
Virtual Memory
Consider the following passage to answer questions from Q. Nos. 1 to 6 : Virtual Memory is a technique that allows the execution of processes that may not be completely in the memory. In this system of over-allocation, while a user process is executing, a page fault ... reference string for four frames ? (A) 09 page faults (B) 10 page faults (C) 14 page faults (D) 12 page faults
Beyonder
asked
in
Operating System
Mar 14, 2017
by
Beyonder
4.2k
views
operating-system
memory-management
virtual-memory
page-replacement
page-fault
page
46
votes
5
answers
94
GATE CSE 2017 Set 1 | Question: 40
Recall that Belady's anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements: $S_1$: Random page replacement algorithm (where a page chosen at random is replaced) suffers from Belady's ... is true, $S_2$ is false $S_1$ is false, $S_2$ is true $S_1$ is false, $S_2$ is false
Arjun
asked
in
Operating System
Feb 14, 2017
by
Arjun
15.1k
views
gatecse-2017-set1
page-replacement
operating-system
normal
1
vote
0
answers
95
Virtual Gate Test Series: Operating System - Page Replacement
Consider the two-dimensional array A$:$ int A[ ] [ ] = new int[100][100]; where A[0][0] is at location 200 in a paged memory system with pages of size 200. A small process that manipulates the matrix resides in page 0 (locations 0 to 199). ... other two are initially empty? for(int j=0;j<100;j++) for(int i=0;i<100;i++) A[i][j]=0;
Samujjal Das
asked
in
Operating System
Jan 24, 2017
by
Samujjal Das
535
views
operating-system
page-replacement
page-fault
virtual-gate-test-series
1
vote
1
answer
96
Test by Bikram | Mock GATE | Test 2 | Question: 40
Consider a set associative cache memory with $8$ cache blocks $(0 - 7)$ and main memory with $128$ blocks. The following block requests are made by the $CPU$ ($\text{LRU}$ ... pair in which main memory block $7$ is present is: $3, 7$ $3, 6$ $2, 5$ $7$ is recently replaced
Bikram
asked
in
CO and Architecture
Jan 24, 2017
by
Bikram
398
views
tbb-mockgate-2
co-and-architecture
page-replacement
cache-memory
0
votes
2
answers
97
MadeEasy Subject Test: Operating System - Page Replacement
Why S1 is false??
Lucky sunda
asked
in
Operating System
Jan 8, 2017
by
Lucky sunda
433
views
made-easy-test-series
operating-system
page-replacement
2
votes
0
answers
98
Page Replacement Algorithm #Virtualgate
A.11 B.12 C.13 D.14 Couldn't visualize how counter is assigned and how page is exactly replaced based on counter.Visual representation would be helpful rather than just ans!
Prajwal Bhat
asked
in
Operating System
Dec 27, 2016
by
Prajwal Bhat
963
views
page-fault
operating-system
page-replacement
2
votes
0
answers
99
Page fault in reverse order
Which of the page replacement algorithm has the property that if we traverse the reference string from start to end or from end to start,the number of page faults will be same?
rahul sharma 5
asked
in
Operating System
Dec 5, 2016
by
rahul sharma 5
1.6k
views
page-fault
page-replacement
0
votes
1
answer
100
ace operating system
Answer given is B, but I think it should be D. Stack will pop the least recently used page from the top. How can having most recently used page on top help in LRU implementation?
Purple
asked
in
Operating System
Nov 29, 2016
by
Purple
743
views
operating-system
paging
least-recently-used
page-replacement
6
votes
2
answers
101
Probability of a Page being Dirty
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 ... P. It is observed that average access time is 50 time units. Then, the value of P is ______? [upto four decimal places]
User007
asked
in
Operating System
Nov 14, 2016
by
User007
2.0k
views
page
page-fault
page-replacement
1
vote
1
answer
102
Doubt in LFU Page Replacement
Q : One doubt that I feel while solving the LFU page replacement is that is it like we consider the number of times each page has been referenced till the current page reference in the reference string and then we replace that page ... or counter of each type of page references till the current page reference in the reference string?Plz someone resolve this doubt.
Habibkhan
asked
in
Operating System
Oct 31, 2016
by
Habibkhan
411
views
operating-system
page-replacement
1
vote
1
answer
103
page replacement
Which page will LRU replace?
vaishali jhalani
asked
in
Operating System
Oct 9, 2016
by
vaishali jhalani
656
views
operating-system
page-replacement
1
vote
1
answer
104
page replacement algorithm
vaishali jhalani
asked
in
Operating System
Oct 7, 2016
by
vaishali jhalani
1.1k
views
operating-system
page-replacement
0
votes
6
answers
105
UGC NET CSE | August 2016 | Part 2 | Question: 37
Suppose that the virtual Address space has eight pages and physical memory with four page frames. If $LRU$ page replacement algorithm is used, ______ number of page faults occur with the reference string. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1 $11$ $12$ $10$ $9$
makhdoom ghaya
asked
in
Operating System
Sep 28, 2016
by
makhdoom ghaya
1.9k
views
ugcnetcse-aug2016-paper2
operating-system
least-recently-used
page-replacement
1
vote
1
answer
106
optimal page replacement problem
resilientknight
asked
in
Operating System
Sep 3, 2016
by
resilientknight
754
views
optimal
page-replacement
operating-system
page-fault
0
votes
2
answers
107
GATE Overflow | Operating Systems | Test 1 | Question: 22
On a virtual memory system with FIFO page replacement policy, for an arbitrary page access pattern, increasing the number of page frames in main memory will always decrease the number of page faults always increase the number of page faults sometimes increase the number of page faults do not affect the number of page faults
Bikram
asked
in
Operating System
Sep 3, 2016
by
Bikram
291
views
go-os-1
operating-system
page-replacement
1
vote
2
answers
108
GATE Overflow | Operating Systems | Test 1 | Question: 16
Determine the number of page faults when references to pages occur in the sequence -$1,2,4,5,2,1,2,4$. Assume that the main memory can accommodate 3 pages and already has pages 1, 2 with page 1 having been brought earlier than page 2 and LRU being the replacement strategy used.
Bikram
asked
in
Operating System
Sep 3, 2016
by
Bikram
488
views
go-os-1
operating-system
numerical-answers
page-replacement
least-recently-used
1
vote
1
answer
109
GATE Overflow | Operating Systems | Test 1 | Question: 14
Dirty bit is used to show the page with corrupted data wrong page in the memory page that is modified after being loaded into cache memory page that is less frequently accessed
Bikram
asked
in
Operating System
Sep 3, 2016
by
Bikram
205
views
go-os-1
operating-system
page-replacement
2
votes
1
answer
110
GATE Overflow | Operating Systems | Test 1 | Question: 11
Aging is keeping track of the cache contents keeping track of what pages are currently residing in the memory keeping track of how many times a given page is referenced increasing the priority of jobs to ensure termination in a finite time
Bikram
asked
in
Operating System
Sep 3, 2016
by
Bikram
429
views
go-os-1
operating-system
page-replacement
3
votes
1
answer
111
UGC NET CSE | June 2016 | Part 2 | Question: 36
Consider the reference string: 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are ____ and ___ respectively. 10, 9 9, 9 10, 10 9, 10
go_editor
asked
in
Operating System
Aug 16, 2016
by
go_editor
7.8k
views
ugcnetcse-june2016-paper2
operating-system
page-replacement
page-fault
3
votes
2
answers
112
UGC NET CSE | Junet 2015 | Part 2 | Question: 38
A LRU page replacement is used with $4$ page frames and eight pages. How many page faults will occur with the reference string $0172327103$ if the four frames are initially empty? $6$ $7$ $5$ $8$
go_editor
asked
in
Operating System
Jul 30, 2016
by
go_editor
11.4k
views
ugcnetcse-june2015-paper2
operating-system
page-replacement
2
votes
1
answer
113
UGC NET CSE | September 2013 | Part 3 | Question: 71
Consider a main memory with three page frames for the following page reference string: 5, 4, 3, 2, 1, 4, 3, 5, 4, 3, 4, 1, 4 Assuming that the execution of process is initialized after loading page 5 in memory,, the number of page faults in FIFO and second chance replacement respectively are 8 and 9 10 and 11 7 and 9 9 and 8
go_editor
asked
in
Operating System
Jul 24, 2016
by
go_editor
4.0k
views
ugcnetcse-sep2013-paper3
operating-system
page-replacement
0
votes
3
answers
114
UGC NET CSE | June 2014 | Part 3 | Question: 35
Consider a program that consists of $8$ pages (from $0$ to $7$) and we have $4$ ... including initial page faults to fill available page frames with pages) : $9$ and $6$ $10$ and $7$ $9$ and $7$ $10$ and $6$
makhdoom ghaya
asked
in
Operating System
Jul 9, 2016
by
makhdoom ghaya
7.5k
views
ugcnetjune2014iii
operating-system
page-replacement
5
votes
4
answers
115
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
habedo007
asked
in
Operating System
Jul 5, 2016
by
habedo007
8.2k
views
page-replacement
page-fault
isro2016
operating-system
2
votes
2
answers
116
UGC NET CSE | June 2012 | Part 2 | Question: 33
Consider the following page trace: 4,3,2,1,4,3,5,4,3,2,1,5 Percentage of page fault that would occur if FIFO page replacement algorithm is used with number of frames for the JOB m=4 will be 8 9 10 12
go_editor
asked
in
Operating System
Jul 5, 2016
by
go_editor
8.8k
views
operating-system
page-replacement
ugcnetcse-june2012-paper2
6
votes
2
answers
117
ISRO2016-49
Working Set $(t,k)$ at an instant of time $t$ is the set of $k$ future references that the OS will make the set of future references that the OS will make in next $t$ unit of time the set of $k$ references with high frequency the $k$ set of pages that have been referenced in the last $t$ time units
Desert_Warrior
asked
in
Operating System
Jul 3, 2016
by
Desert_Warrior
6.3k
views
operating-system
page-replacement
isro2016
5
votes
2
answers
118
ISRO2011-73
Belady's anomaly means Page fault rate is constant even on increasing the number of allocated frames Page fault rate may increase on increasing the number of allocated frames Page fault rate may increase on decreasing the number of allocated frames Page fault rate may decrease on increasing the number of allocated frames
go_editor
asked
in
Operating System
Jun 23, 2016
by
go_editor
2.7k
views
isro2011
operating-system
page-replacement
page-fault
1
vote
1
answer
119
ISRO2008-67
The page replacement algorithm which gives the lowest page fault rate is LRU FIFO Optimal page replacement Second chance algorithm
go_editor
asked
in
Operating System
Jun 13, 2016
by
go_editor
4.6k
views
isro2008
operating-system
page-replacement
6
votes
3
answers
120
ISRO2007-10
The term ‘aging’ refers to booting up the priority of the process in multi-level of queue without feedback. gradually increasing the priority of jobs that wait in the system for a long time to remedy infinite blocking keeping track of the ... letting job reside in memory for a certain amount of time so that the number of pages required can be estimated accurately.
go_editor
asked
in
Operating System
Jun 10, 2016
by
go_editor
5.5k
views
isro2007
operating-system
memory-management
page-replacement
Page:
« prev
1
2
3
4
5
6
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged page-replacement
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...