Enhanced Second chance algorithm
In this a modify bit is as well used. Now if the ordered pair of reference and modify is
(0,0) neither recently used nor modified - the best page to replace.
(1,1) both referenced and modified- the worst to replace
(1,0) referenced but not modified
(0,1) not recently used but modified.
This algorithm is utilized in the Macintosh virtual memory management scheme.