Search results for operating-system+page-replacement / GATE Overflow for GATE CSE

35 votes

2 answers

1

GATE CSE 2005 | Question: 22, ISRO2015-36
Increasing the RAM of a computer typically improves performance because: Virtual Memory increases Larger RAMs are faster Fewer page faults occur Fewer segmentation faults occur

Increasing the RAM of a computer typically improves performance because:Virtual Memory increasesLarger RAMs are fasterFewer page faults occurFewer segmentation faults occ...

Kathleen

41.9k views

Kathleen asked Sep 22, 2014

76 votes

11 answers

2

GATE CSE 2014 Set 2 | Question: 33
A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that order, and repeats the access sequence THRICE. Which one of ... as the optimal page replacement policy for this program? Least-recently-used First-in-first-out Last-in-first-out Most-recently-used

A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that ord...

go_editor

28.7k views

go_editor asked Sep 28, 2014

61 votes

4 answers

3

GATE CSE 2021 Set 2 | Question: 48
Consider a three-level page table to translate a $39-$bit virtual address to a physical address as shown below: The page size is $\text{4 KB} \;(1\text{KB}=2^{10}$ bytes$)$ and page table entry size at every level is $8$ bytes. A ... $P$ across all levels is _________ $\text{KB}$.

Consider a three-level page table to translate a $39-$bit virtual address to a physical address as shown below:The page size is $\text{4 KB} \;(1\text{KB}=2^{10}$ bytes$)...

Arjun

28.6k views

Arjun asked Feb 18, 2021

69 votes

10 answers

4

GATE CSE 2016 Set 1 | Question: 49
Consider a computer system with ten physical page frames. The system is provided with an access sequence $(a_{1}, a_{2},....,a_{20}, a_{1}, a_{2},...a_{20})$, where each $a_{i}$ is a distinct virtual page number. The difference in the number of page faults between the last-in-first-out page replacement policy and the optimal page replacement policy is_________.

Consider a computer system with ten physical page frames. The system is provided with an access sequence $(a_{1}, a_{2},....,a_{20}, a_{1}, a_{2},...a_{20})$, where each ...

Sandeep Singh

18.9k views

Sandeep Singh asked Feb 12, 2016

66 votes

9 answers

5

GATE CSE 2004 | Question: 21, ISRO2007-44
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by the instruction set architecture page size number of processes in memory physical memory size

The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined bythe instruction set architecturepage sizenum...

Kathleen

23.9k views

Kathleen asked Sep 18, 2014

21 votes

4 answers

6

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.6k views

admin asked Feb 15, 2023

56 votes

5 answers

7

GATE CSE 1995 | Question: 2.7
The address sequence generated by tracing a particular program executing in a pure demand based 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$ $13$ $8$ $7$ $10$

The address sequence generated by tracing a particular program executing in a pure demand based paging system with $100$ records per page with $1$ free main memory frame ...

Kathleen

16.2k views

Kathleen asked Oct 8, 2014

44 votes

4 answers

8

GATE IT 2007 | Question: 12
The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ bytes per page is $\text{0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0410.}$ Suppose that the memory can store only one page and ... to $\text{x + 99}$ are loaded on to the memory. How many page faults will occur? $0$ $4$ $7$ $8$

The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ bytes per page is$\text{0100, 0200, 0430, 0499, 0510, 0...

Ishrat Jahan

15.1k views

Ishrat Jahan asked Oct 29, 2014

46 votes

5 answers

9

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

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 pa...

Arjun

15.3k views

Arjun asked Feb 14, 2017

13 votes

3 answers

10

GATE CSE 2021 Set 1 | Question: 11
In the context of operating systems, which of the following statements is/are correct with respect to paging? Paging helps solve the issue of external fragmentation Page size has no impact on internal fragmentation Paging incurs memory overheads Multi-level paging is necessary to support pages of different sizes

In the context of operating systems, which of the following statements is/are correct with respect to paging?Paging helps solve the issue of external fragmentationPage si...

Arjun

13.0k views

Arjun asked Feb 18, 2021

72 votes

4 answers

11

GATE IT 2007 | Question: 58
A demand paging system takes $100$ time units to service a page fault and $300$ time units to replace a dirty page. Memory access time is $1$ time unit. The probability of a page fault is $p$ ... that the average access time is $3$ time units. Then the value of $p$ is $0.194$ $0.233$ $0.514$ $0.981$

A demand paging system takes $100$ time units to service a page fault and $300$ time units to replace a dirty page. Memory access time is $1$ time unit. The probability o...

Ishrat Jahan

22.8k views

Ishrat Jahan asked Oct 30, 2014

11 votes

3 answers

12

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

8.1k views

Arjun asked Feb 15, 2022

20 votes

5 answers

13

GATE CSE 2009 | Question: 9, ISRO2016-52
In which one of the following page replacement policies, Belady's anomaly may occur? FIFO Optimal LRU MRU

In which one of the following page replacement policies, Belady's anomaly may occur?FIFOOptimalLRUMRU

Kathleen

8.5k views

Kathleen asked Sep 22, 2014

63 votes

6 answers

14

GATE IT 2008 | Question: 41
Assume that a main memory with only $4$ pages, each of $16$ bytes, is initially empty. The CPU generates the following sequence of virtual addresses and uses the Least Recently Used (LRU) page replacement policy. $\text{0, 4, 8, 20, 24, 36, 44, 12, 68, 72, 80, 84, 28, 32, 88, 92}$ How many ... $1, 2, 3, 4$ $7$ and $1, 2, 4, 5$ $8$ and $1, 2, 4, 5$ $9$ and $1, 2, 3, 5$

Assume that a main memory with only $4$ pages, each of $16$ bytes, is initially empty. The CPU generates the following sequence of virtual addresses and uses the Least Re...

Ishrat Jahan

23.8k views

Ishrat Jahan asked Oct 28, 2014

2 votes

1 answer

15

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

517 views

admin asked Dec 15, 2022

33 votes

2 answers

16

GATE CSE 1994 | Question: 1.13
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed then LRU page replacement algorithm is used FIFO page replacement algorithm is used LFU page replacement algorithm is used None of the above

A memory page containing a heavily used variable that was initialized very early and is in constant use is removed thenLRU page replacement algorithm is usedFIFO page rep...

Kathleen

11.4k views

Kathleen asked Oct 4, 2014

1 votes

1 answer

17

GATE Overflow Test Series | Mock GATE | Test 6 | Question: 56
A demand paging system takes $500$ time units to service a page fault when page is not dirty and $501$ time units in case the page is dirty. Memory access time is $1$ time unit. The probability of a page fault is $p$. In ... that the average access time is $12$ time units. Then the value of $100p$ is ________ (up to two decimal places).

A demand paging system takes $500$ time units to service a page fault when page is not dirty and $501$ time units in case the page is dirty. Memory access time is $1$ tim...

Arjun

228 views

Arjun asked Jan 30, 2022

6 votes

4 answers

18

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.5k views

Satbir asked Jan 13, 2020

35 votes

3 answers

19

GATE CSE 2007 | Question: 56
A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements: P: Increasing the number of page frames allocated to a process sometimes increases the page fault rate. Q: ... are true, but Q is not the reason for P. P is false but Q is true Both P and Q are false.

A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements:P: I...

Kathleen

17.2k views

Kathleen asked Sep 21, 2014

32 votes

4 answers

20

GATE CSE 1997 | Question: 3.9
Thrashing reduces page I/O decreases the degree of multiprogramming implies excessive page I/O improve the system performance

Thrashingreduces page I/Odecreases the degree of multiprogrammingimplies excessive page I/Oimprove the system performance

Kathleen

13.3k views

Kathleen asked Sep 29, 2014

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