Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > A process refers to 5 pages, A, B, C, D and E...
Start Learning for Free
A process refers to 5 pages, A, B, C, D and E in the order - A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of pages which transfer with an empty internal store of 3 frames is
- a)8
- b)10
- c)9
- d)7
Correct answer is option 'C'. Can you explain this answer?
Verified Answer
A process refers to 5 pages, A, B, C, D and E in the order - A, B, C, ...
The first 3 reference A, B, C fills the internal storage with A, B,C in 3 page transfers. Now the next reference D results in a page fault. So page A is downloaded and D takes its place after a page transfer. So, the internal store has D, Fand C. The next reference is A - results in a page fault. So, a page transfer takes place and swaps B and A. Continuing this way, we find totally 9 page transfers are necessary.
Most Upvoted Answer
A process refers to 5 pages, A, B, C, D and E in the order - A, B, C, ...
Explanation:
The given page reference string is A, B, C, D, A, B, E, A, B, C, D, E and the internal store has 3 frames. Let's apply the FIFO page replacement algorithm to this page reference string.
At the beginning, the internal store is empty, and the page A is referenced, so it is loaded into the internal store. The internal store now looks like this: A _ _.
Next, the page B is referenced, and it is loaded into the internal store. The internal store now looks like this: A B _.
Then, the page C is referenced, and it is loaded into the internal store. The internal store now looks like this: A B C.
Next, the page D is referenced, and it is loaded into the internal store. The internal store now looks like this: D B C.
When the page A is referenced again, it is not in the internal store, so the page A is replaced with the next page in the page reference string, which is E. The internal store now looks like this: D B E.
When the page B is referenced again, it is already in the internal store, so no page replacement occurs. The internal store remains the same: D B E.
When the page C is referenced again, it is already in the internal store, so no page replacement occurs. The internal store remains the same: D B E.
When the page D is referenced again, it is already in the internal store, so no page replacement occurs. The internal store remains the same: D B E.
When the page E is referenced again, it is already in the internal store, so no page replacement occurs. The internal store remains the same: D B E.
Therefore, a total of 9 pages were transferred with an empty internal store of 3 frames. Thus, option (C) is the correct answer.
The given page reference string is A, B, C, D, A, B, E, A, B, C, D, E and the internal store has 3 frames. Let's apply the FIFO page replacement algorithm to this page reference string.
At the beginning, the internal store is empty, and the page A is referenced, so it is loaded into the internal store. The internal store now looks like this: A _ _.
Next, the page B is referenced, and it is loaded into the internal store. The internal store now looks like this: A B _.
Then, the page C is referenced, and it is loaded into the internal store. The internal store now looks like this: A B C.
Next, the page D is referenced, and it is loaded into the internal store. The internal store now looks like this: D B C.
When the page A is referenced again, it is not in the internal store, so the page A is replaced with the next page in the page reference string, which is E. The internal store now looks like this: D B E.
When the page B is referenced again, it is already in the internal store, so no page replacement occurs. The internal store remains the same: D B E.
When the page C is referenced again, it is already in the internal store, so no page replacement occurs. The internal store remains the same: D B E.
When the page D is referenced again, it is already in the internal store, so no page replacement occurs. The internal store remains the same: D B E.
When the page E is referenced again, it is already in the internal store, so no page replacement occurs. The internal store remains the same: D B E.
Therefore, a total of 9 pages were transferred with an empty internal store of 3 frames. Thus, option (C) is the correct answer.
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
A process refers to 5 pages, A, B, C, D and E in the order - A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of pages which transfer with an empty internal store of 3 frames isa)8b)10c)9d)7Correct answer is option 'C'. Can you explain this answer?
Question Description
A process refers to 5 pages, A, B, C, D and E in the order - A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of pages which transfer with an empty internal store of 3 frames isa)8b)10c)9d)7Correct answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2025 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 A process refers to 5 pages, A, B, C, D and E in the order - A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of pages which transfer with an empty internal store of 3 frames isa)8b)10c)9d)7Correct answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2025 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for A process refers to 5 pages, A, B, C, D and E in the order - A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of pages which transfer with an empty internal store of 3 frames isa)8b)10c)9d)7Correct answer is option 'C'. Can you explain this answer?.
A process refers to 5 pages, A, B, C, D and E in the order - A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of pages which transfer with an empty internal store of 3 frames isa)8b)10c)9d)7Correct answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2025 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 A process refers to 5 pages, A, B, C, D and E in the order - A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of pages which transfer with an empty internal store of 3 frames isa)8b)10c)9d)7Correct answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2025 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for A process refers to 5 pages, A, B, C, D and E in the order - A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of pages which transfer with an empty internal store of 3 frames isa)8b)10c)9d)7Correct answer is option 'C'. Can you explain this answer?.
Solutions for A process refers to 5 pages, A, B, C, D and E in the order - A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of pages which transfer with an empty internal store of 3 frames isa)8b)10c)9d)7Correct answer is option 'C'. 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 A process refers to 5 pages, A, B, C, D and E in the order - A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of pages which transfer with an empty internal store of 3 frames isa)8b)10c)9d)7Correct answer is option 'C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
A process refers to 5 pages, A, B, C, D and E in the order - A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of pages which transfer with an empty internal store of 3 frames isa)8b)10c)9d)7Correct answer is option 'C'. Can you explain this answer?, a detailed solution for A process refers to 5 pages, A, B, C, D and E in the order - A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of pages which transfer with an empty internal store of 3 frames isa)8b)10c)9d)7Correct answer is option 'C'. Can you explain this answer? has been provided alongside types of A process refers to 5 pages, A, B, C, D and E in the order - A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of pages which transfer with an empty internal store of 3 frames isa)8b)10c)9d)7Correct answer is option 'C'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice A process refers to 5 pages, A, B, C, D and E in the order - A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of pages which transfer with an empty internal store of 3 frames isa)8b)10c)9d)7Correct answer is option 'C'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
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