FIFO

public static int FIFO(int numframes,int[] refString){
        int[] queue = new int[numframes];
        Arrays.fill(queue,-1);
        int queuePos = 0;
        int fault = 0;
        for(int i = 0; i < refString.length;++i){
            System.out.print("RefString= "+refString[i]+" ");
            if(!contains(queue,refString[i])){
                if(queuePos < numframes){
                    queue[queuePos++]  = refString[i];
                } else {
                    queuePos = 0;
                    queue[queuePos++]  = refString[i];
                }
                fault++;
                printFram(queue);
            }
            System.out.println();
        }
        return fault;
    }