Register

Recent questions tagged page-faults

1 1 vote
1 answers 1 answer
1.3k
1.3k views
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 memo...
User Avatar
2 2 votes
2 2 answers
2.3k
2.3k views
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 re...
User Avatar
0 0 votes
1 1 answer
2.5k
2.5k views
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 re...
User Avatar
1 1 vote
1 1 answer
1.8k
1.8k views
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 boundLocality of reference is applicable to the processSize of pages is reducedPro...
User Avatar
0 0 votes
2 2 answers
1.4k
1.4k views
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 th...
User Avatar
0 0 votes
2 answers 2 answers
2.4k
2.4k views
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$...
User Avatar
0 0 votes
2 2 answers
2.0k
2.0k views
UGC NET CSE | December 2007 | Part 2 | Question: 37
A program has five virtual pages, numbered from $0$ to $4$. If the pages are referenced in the order $012301401234$, with three page frames, the total number of page faul...
User Avatar
6 6 votes
5 5 answers
10.1k
10.1k views
ISRO CSE 2020 | Question: 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 ...
User Avatar
0 0 votes
0 0 answers
633
633 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 52 (Page No. 260 - 261)
Write a program that simulates a toy paging system that uses the $\text{WSClock}$ algorithm. The system is a toy in that we will assume there are no write references (not...
User Avatar
0 0 votes
0 0 answers
709
709 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 51 (Page No. 260)
Write a program that simulates a paging system using the aging algorithm. The number of page frames is a parameter. The sequence of page references should be read from a ...
User Avatar
1 1 vote
0 0 answers
1.1k
1.1k views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 47 (Page No. 259 - 260)
We consider a program which has the two segments shown below consisting of instructions in segment $0,$ and read/write data in segment $1.$ Segment $0$ has read/execute p...
User Avatar
0 0 votes
0 0 answers
613
613 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 44 (Page No. 259)
A machine-language instruction to load a $32-bit$ word into a register contains the $32-bit$ address of the word to be loaded. What is the maximum number of page faults t...
User Avatar
1 1 vote
1 1 answer
990
990 views
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 ava...
User Avatar
Page: