I have a question regarding page replacement algorithms and their worst case reference strings. I want to find a single 20 elements long reference strings that has a worst case performance on all of these scheduling policies.
The scheduling policies: FIFO, LRU, CLOCK and OPT (all with cache size 4).
example reference string: 0,1,2,3,4,0,1,2,3,4,0,1,2,3,4,0,1,2,3,4