Step 01 / Build your input

Build a
sequence.

One character = one page

The setup

Type a string like a1b2c3. The algorithm will handle the rest.

01 / Page reference string

What should memory remember?

A-Z, 0-9 only

Type your sequence

Each letter or number becomes one page access, in order.

Parsed requests

0 pages

Your split sequence appears here

02 / Algorithm

The oldest loaded page leaves first.

03 / Memory size

4

Memory frames

04 / End the session

Review the totals in the visualizer, then close the program out.

Group 6 · BSIT 2-1 · COMSCI 2101 · 8 members ·