Sem 4 Operating System (OS) : FIFO Page replacement Java code / program

Given below is the Java program for FIFO page replacement algorithm.You can also use the DOWNLOAD BOX to download the '.java' file. import java.util.*; class FIFO { static boolean check(int p[],int n,int x) { for(int i=0;i<n;++i) { if(p[i]==x) return true; } return false; } public static void main(String args[]) { Scanner scr=new Scanner(System.in); System.out.println("Enter the number of page entries"); int n=scr.nextInt(); int fault=0,hit=0; int p[]=new int[n]; System.out.println("Enter the pages "); for(int i=0;i<n;++i) p[i]=scr.nextInt(); System.out.print("The page table entries are "); for(int i=0;i<n;++i) System.out.print(" "+p[i]); System.out.println(); int s=3; System.out.println("Do you wish to set a the number of page frames?(1=yes/0=no)"); int ch=scr.nextInt(); if(ch==1) { System.out.println("Enter the number of page frames "); s=scr.nextInt(); System.out.println("The number of page frames set to "+s); } else System.out.println("The default number of page frames are "+s); int pf[]=new int[s]; for(int i=0;i<s;++i) pf[i]=-1; int d=0; for(int i=0;i<n;++i) { if(check(pf,s,p[i])) { ++hit; for(int j=0;j<s && pf[j]!=-1;++j) System.out.print(pf[j]+" "); System.out.print("H\n"); } else { ++fault; if(d>s-1) d=0; pf[d]=p[i]; ++d; for(int j=0;j<s && pf[j]!=-1;++j) System.out.print(pf[j]+" "); System.out.print("F\n"); } } System.out.println("Number of page Hits= "+hit+"\nNumber of page Faults= "+fault); } }