Page Replacement Showdown: FIFO vs LRU

AsterQuiz

Played 0

Create copy

About this activity

FIFO vs LRU tricks

Created by

Dr ARUNA S

India

Download the paper version to play

Top 10 results

There are still no results for this game. Be the first to stay in the ranking! Log in to identify yourself.

Make your own free game from our game creator

Compete against your friends to see who gets the best score in this game

Make challenge

US History: Pre-Civil War Quiz

Virginia Llanos

United States

(7)

Key terms quiz
Science Evidence Quest: Properties of Matter

Taylor Roberts

United States

(6)

Grade 5 science clues
Master the Steps: Geometry & Maps Quiz

Regine A. Wayan

Philippines

(6)

Landmark steps to master concepts
How much do you know about space?

Educaplay Educational Resources

Spain

(37)

Put your knowledge of the universe to the test.
Tag Questions Review

Cristian Adonay Avila Rivas

El Salvador

(6)

Quick tag questions practice


AsterQuiz Page Replacement Showdown: FIFO vs LRUOnline version FIFO vs LRU tricks by Dr ARUNA S 1 In a 3-frame memory, the pages load in order A, B, C, D, with FIFO replacement for a page fault. Which page is evicted first when E arrives? a C b B c A 2 With LRU, current order of last use is: E, D, C, B, A where A was used long ago. If F arrives, which page should be evicted? a A b E c D 3 Which scenario favors LRU over FIFO? a Random access patterns b Programs with locality of reference c Uniform page usage 4 FIFO can suffer fromBelady’s anomaly, which means: a Misses always decrease b Adding frames may increase expected misses c FIFO becomes faster 5 LRU implementation can be approximated efficiently by using: a A queue b A stack or timestamped counter c Random replacement policy 6 In a sequence 1-2-3-4-1-2-5-1-2-3-4-5 with 3 frames, which page faults are avoided by an efficient LRU strategy? a Never any faults b All misses only c Repeating recent pages 7 Which metric is most directly impacted by FIFO vs LRU choices? a Memory bandwidth b CPU utilization c Page fault rate 8 Which condition makes FIFO particularly poor? a Very small workloads b Constant random access c Sequential access with aging pages 9 With an LRU stack model, the page most recently used is kept at the top of the stack. When a fault occurs, which page is evicted? a Least recently used b Middle recently used c Most recently used 10 Which statement is true about FIFO and LRU? a FIFO is always optimal b LRU tracks usage; FIFO does not c Both require timestamps

AsterQuiz

Page Replacement Showdown: FIFO vs LRUOnline version

FIFO vs LRU tricks

by Dr ARUNA S

In a 3-frame memory, the pages load in order A, B, C, D, with FIFO replacement for a page fault. Which page is evicted first when E arrives?

With LRU, current order of last use is: E, D, C, B, A where A was used long ago. If F arrives, which page should be evicted?

Which scenario favors LRU over FIFO?

Random access patterns

Programs with locality of reference

Uniform page usage

FIFO can suffer fromBelady’s anomaly, which means:

Misses always decrease

Adding frames may increase expected misses

FIFO becomes faster

LRU implementation can be approximated efficiently by using:

A queue

A stack or timestamped counter

Random replacement policy

In a sequence 1-2-3-4-1-2-5-1-2-3-4-5 with 3 frames, which page faults are avoided by an efficient LRU strategy?

Never any faults

All misses only

Repeating recent pages

Which metric is most directly impacted by FIFO vs LRU choices?

Memory bandwidth

CPU utilization

Page fault rate

Which condition makes FIFO particularly poor?

Very small workloads

Constant random access

Sequential access with aging pages

With an LRU stack model, the page most recently used is kept at the top of the stack. When a fault occurs, which page is evicted?

Least recently used

Middle recently used

Most recently used

Which statement is true about FIFO and LRU?

FIFO is always optimal

LRU tracks usage; FIFO does not

Both require timestamps

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.

Page Replacement Showdown: FIFO vs LRU

AsterQuiz

About this activity

Created by

Download the paper version to play

Top Games

AsterQuiz

US History: Pre-Civil War Quiz

AsterQuiz

Science Evidence Quest: Properties of Matter

AsterQuiz

Master the Steps: Geometry & Maps Quiz

AsterQuiz

How much do you know about space?

AsterQuiz

Tag Questions Review

AsterQuiz

Page Replacement Showdown: FIFO vs LRUOnline version

by Dr ARUNA S

In a 3-frame memory, the pages load in order A, B, C, D, with FIFO replacement for a page fault. Which page is evicted first when E arrives?

With LRU, current order of last use is: E, D, C, B, A where A was used long ago. If F arrives, which page should be evicted?

Which scenario favors LRU over FIFO?

FIFO can suffer fromBelady’s anomaly, which means:

LRU implementation can be approximated efficiently by using:

In a sequence 1-2-3-4-1-2-5-1-2-3-4-5 with 3 frames, which page faults are avoided by an efficient LRU strategy?

Which metric is most directly impacted by FIFO vs LRU choices?

Which condition makes FIFO particularly poor?

With an LRU stack model, the page most recently used is kept at the top of the stack. When a fault occurs, which page is evicted?

Which statement is true about FIFO and LRU?

		%
	Anonymous	%
		%
		%