Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > There are five virtual pages, numbered from 0...
Start Learning for Free
There are five virtual pages, numbered from 0 to 4. The page are referenced in the following order
0 1 2 3 0 1 4 0 1 2 3 4
If FIFO page replacement algorithm is used then find:
1. Number of page replacement faults that occur if 3 page frames are present.
2. Number of page faults that occur if 4 page frames are present.
0 1 2 3 0 1 4 0 1 2 3 4
If FIFO page replacement algorithm is used then find:
1. Number of page replacement faults that occur if 3 page frames are present.
2. Number of page faults that occur if 4 page frames are present.
- a)10,9
- b)9,10
- c)9, 8
- d)10,11
Correct answer is option 'B'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
There are five virtual pages, numbered from 0 to 4. The page are refer...
If 3 page frames are used
Page hit : 0, 1, 4.
∴ Number of page fault = 9
If 4 pages frames are used
Page faults ; 0, 1, 2, 3, 4, 0, 1,2, 3, 4 Page hit : 0, 1
∴ Number of page faults = 10
Page hit : 0, 1, 4.
∴ Number of page fault = 9
If 4 pages frames are used
Page faults ; 0, 1, 2, 3, 4, 0, 1,2, 3, 4 Page hit : 0, 1
∴ Number of page faults = 10
Most Upvoted Answer
There are five virtual pages, numbered from 0 to 4. The page are refer...
Explanation:
First-In-First-Out (FIFO) algorithm: It is a page replacement algorithm that replaces the oldest page in the main memory with a new page when a page fault occurs.
Given: 5 virtual pages numbered from 0 to 4 referenced in the following order:
0 1 2 3 0 1 4 0 1 2 3 4
1. Number of page replacement faults that occur if 3 page frames are present:
Step 1: Initially all the page frames are empty and the page fault occurs for every reference.
0 1 2 3 0 1 4 0 1 2 3 4
F F F
Step 2: For the first 3 references, the page faults occur and the pages are loaded into the page frames.
0 1 2 3 0 1 4 0 1 2 3 4
F F F 0 1 2
Step 3: For the next 3 references, the pages are already present in the page frames and no page fault occurs.
0 1 2 3 0 1 4 0 1 2 3 4
F F F 0 1 2
Step 4: For the next reference, page 4 is not present in any of the page frames and a page fault occurs. As per FIFO algorithm, the oldest page in the memory is replaced with page 4.
0 1 2 3 0 1 4 0 1 2 3 4
F F F 0 1 2 F
Step 5: For the next 3 references, the pages are already present in the page frames and no page fault occurs.
0 1 2 3 0 1 4 0 1 2 3 4
F F F 0 1 2 F
Therefore, the total number of page faults = 9.
2. Number of page faults that occur if 4 page frames are present:
Step 1: Initially all the page frames are empty and the page fault occurs for every reference.
0 1 2 3 0 1 4 0 1 2 3 4
F F F F
Step 2: For the first 4 references, the page faults occur and the pages are loaded into the page frames.
0 1 2 3 0 1 4 0 1 2 3 4
F F F F 0 1 2 3
Step 3: For the next 2 references, the pages are already present in the page frames and no page fault occurs.
0 1 2 3 0 1 4 0 1 2 3 4
F F F F 0 1 2
First-In-First-Out (FIFO) algorithm: It is a page replacement algorithm that replaces the oldest page in the main memory with a new page when a page fault occurs.
Given: 5 virtual pages numbered from 0 to 4 referenced in the following order:
0 1 2 3 0 1 4 0 1 2 3 4
1. Number of page replacement faults that occur if 3 page frames are present:
Step 1: Initially all the page frames are empty and the page fault occurs for every reference.
0 1 2 3 0 1 4 0 1 2 3 4
F F F
Step 2: For the first 3 references, the page faults occur and the pages are loaded into the page frames.
0 1 2 3 0 1 4 0 1 2 3 4
F F F 0 1 2
Step 3: For the next 3 references, the pages are already present in the page frames and no page fault occurs.
0 1 2 3 0 1 4 0 1 2 3 4
F F F 0 1 2
Step 4: For the next reference, page 4 is not present in any of the page frames and a page fault occurs. As per FIFO algorithm, the oldest page in the memory is replaced with page 4.
0 1 2 3 0 1 4 0 1 2 3 4
F F F 0 1 2 F
Step 5: For the next 3 references, the pages are already present in the page frames and no page fault occurs.
0 1 2 3 0 1 4 0 1 2 3 4
F F F 0 1 2 F
Therefore, the total number of page faults = 9.
2. Number of page faults that occur if 4 page frames are present:
Step 1: Initially all the page frames are empty and the page fault occurs for every reference.
0 1 2 3 0 1 4 0 1 2 3 4
F F F F
Step 2: For the first 4 references, the page faults occur and the pages are loaded into the page frames.
0 1 2 3 0 1 4 0 1 2 3 4
F F F F 0 1 2 3
Step 3: For the next 2 references, the pages are already present in the page frames and no page fault occurs.
0 1 2 3 0 1 4 0 1 2 3 4
F F F F 0 1 2
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
There are five virtual pages, numbered from 0 to 4. The page are referenced in the following order0 1 2 3 0 1 4 0 1 2 3 4If FIFO page replacement algorithm is used then find:1. Number of page replacement faults that occur if 3 page frames are present.2. Number of page faults that occur if 4 page frames are present.a)10,9b)9,10c)9, 8d)10,11Correct answer is option 'B'. Can you explain this answer?
Question Description
There are five virtual pages, numbered from 0 to 4. The page are referenced in the following order0 1 2 3 0 1 4 0 1 2 3 4If FIFO page replacement algorithm is used then find:1. Number of page replacement faults that occur if 3 page frames are present.2. Number of page faults that occur if 4 page frames are present.a)10,9b)9,10c)9, 8d)10,11Correct answer is option 'B'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about There are five virtual pages, numbered from 0 to 4. The page are referenced in the following order0 1 2 3 0 1 4 0 1 2 3 4If FIFO page replacement algorithm is used then find:1. Number of page replacement faults that occur if 3 page frames are present.2. Number of page faults that occur if 4 page frames are present.a)10,9b)9,10c)9, 8d)10,11Correct answer is option 'B'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for There are five virtual pages, numbered from 0 to 4. The page are referenced in the following order0 1 2 3 0 1 4 0 1 2 3 4If FIFO page replacement algorithm is used then find:1. Number of page replacement faults that occur if 3 page frames are present.2. Number of page faults that occur if 4 page frames are present.a)10,9b)9,10c)9, 8d)10,11Correct answer is option 'B'. Can you explain this answer?.
There are five virtual pages, numbered from 0 to 4. The page are referenced in the following order0 1 2 3 0 1 4 0 1 2 3 4If FIFO page replacement algorithm is used then find:1. Number of page replacement faults that occur if 3 page frames are present.2. Number of page faults that occur if 4 page frames are present.a)10,9b)9,10c)9, 8d)10,11Correct answer is option 'B'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about There are five virtual pages, numbered from 0 to 4. The page are referenced in the following order0 1 2 3 0 1 4 0 1 2 3 4If FIFO page replacement algorithm is used then find:1. Number of page replacement faults that occur if 3 page frames are present.2. Number of page faults that occur if 4 page frames are present.a)10,9b)9,10c)9, 8d)10,11Correct answer is option 'B'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for There are five virtual pages, numbered from 0 to 4. The page are referenced in the following order0 1 2 3 0 1 4 0 1 2 3 4If FIFO page replacement algorithm is used then find:1. Number of page replacement faults that occur if 3 page frames are present.2. Number of page faults that occur if 4 page frames are present.a)10,9b)9,10c)9, 8d)10,11Correct answer is option 'B'. Can you explain this answer?.
Solutions for There are five virtual pages, numbered from 0 to 4. The page are referenced in the following order0 1 2 3 0 1 4 0 1 2 3 4If FIFO page replacement algorithm is used then find:1. Number of page replacement faults that occur if 3 page frames are present.2. Number of page faults that occur if 4 page frames are present.a)10,9b)9,10c)9, 8d)10,11Correct answer is option 'B'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of There are five virtual pages, numbered from 0 to 4. The page are referenced in the following order0 1 2 3 0 1 4 0 1 2 3 4If FIFO page replacement algorithm is used then find:1. Number of page replacement faults that occur if 3 page frames are present.2. Number of page faults that occur if 4 page frames are present.a)10,9b)9,10c)9, 8d)10,11Correct answer is option 'B'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
There are five virtual pages, numbered from 0 to 4. The page are referenced in the following order0 1 2 3 0 1 4 0 1 2 3 4If FIFO page replacement algorithm is used then find:1. Number of page replacement faults that occur if 3 page frames are present.2. Number of page faults that occur if 4 page frames are present.a)10,9b)9,10c)9, 8d)10,11Correct answer is option 'B'. Can you explain this answer?, a detailed solution for There are five virtual pages, numbered from 0 to 4. The page are referenced in the following order0 1 2 3 0 1 4 0 1 2 3 4If FIFO page replacement algorithm is used then find:1. Number of page replacement faults that occur if 3 page frames are present.2. Number of page faults that occur if 4 page frames are present.a)10,9b)9,10c)9, 8d)10,11Correct answer is option 'B'. Can you explain this answer? has been provided alongside types of There are five virtual pages, numbered from 0 to 4. The page are referenced in the following order0 1 2 3 0 1 4 0 1 2 3 4If FIFO page replacement algorithm is used then find:1. Number of page replacement faults that occur if 3 page frames are present.2. Number of page faults that occur if 4 page frames are present.a)10,9b)9,10c)9, 8d)10,11Correct answer is option 'B'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice There are five virtual pages, numbered from 0 to 4. The page are referenced in the following order0 1 2 3 0 1 4 0 1 2 3 4If FIFO page replacement algorithm is used then find:1. Number of page replacement faults that occur if 3 page frames are present.2. Number of page faults that occur if 4 page frames are present.a)10,9b)9,10c)9, 8d)10,11Correct answer is option 'B'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup