Consider the string: 1, 3, 2, 4, 2, 1, 5, 1, 3, 2, 6, 7, 5, 4, 3, 2, 4, 2, 3, 1, 4 Find the page faults for 3 frames using FIFO and LRU page replacement algorithms.

3.1kviews

written 6.9 years ago by

teamques10 ★ 69k

• modified 3.0 years ago

computer organization and architecture

ADD COMMENT EDIT

1 Answer

308views

written 3.0 years ago by

teamques10 ★ 69k

String = 1, 3, 2, 4, 2, 1, 5, 1, 3, 2, 6, 7, 5, 4, 3, 2, 4, 2, 3, 1, 4

Frame Size = 3

First In First Out (FIFO)

FIFO

Page Fault = 16

Least Recently Used (LRU)

LRU

Page Fault = 16

ADD COMMENT EDIT

Please log in to add an answer.