FIFO REPLACEMENT ALGORITHM

import java.util.Arrays;
import java.util.Scanner;

public class FifoReplacementAlgorithm {
    static void print(int a, int[] frames, boolean b) {
        if (!b)
            System.out.println("\t" + a + "\t" + Arrays.toString(frames)
                    + " FAULT");
        else
            System.out.println("\t" + a + "\t" + Arrays.toString(frames)
                    + " HIT");
    }

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter the number of frames");
        int[] frames = new int[sc.nextInt()];
        for (int i = 0; i < frames.length; i++)
            frames[i] = -1;
        System.out.println("Enter the number of pages : ");
        int[] pages = new int[sc.nextInt()];
        System.out.println("Enter the pages : ");
        for (int i = 0; i < pages.length; i++)
            pages[i] = sc.nextInt();

        int lru = 0;
        int slru = 0;
        for (int i = 0; i < pages.length; i++) {
            int flag = 0;
            int j = 0;
            for (j = 0; j < frames.length; j++) {
                if (frames[j] == pages[i])
                    flag = 1;
            }
            if (flag == 0) {
                System.out.println(lru);
                frames[lru] = pages[i];
                lru = (lru += 1) % frames.length;

                System.out.println(pages[i] + " " + Arrays.toString(frames)
                        + " MISS");
            } else {

                System.out.println(pages[i] + " " + Arrays.toString(frames)
                        + " HIT");
            }

        }
    }

}