Here's a simulation of FIFO page replacement technique . . .
FifoPageReplacement.java
import java.util.Scanner;
public class FifoPageReplacement
{
public static void main(String[] args)
{
/*System.out.println("Enter the number of pages : ");
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
System.out.println("Enter the size Physical memory : ");
int P = sc.nextInt();
while(true)
{
System.out.println("Enter page referenced : ");
int p = sc.nextInt();
}*/
int pages[] = new int[100];
int inMem[] = {0,0,0};
int i=0,x,memPt=-1;
Scanner sc=new Scanner(System.in);
System.out.println("Enter Page String (0 for END)");
while(true)
{
x=sc.nextInt();
if(x==0) break;
pages[i++]=x;
}
for(x=0;x<i;x++)
{
if(pages[x]==inMem[0] || pages[x]==inMem[1] || pages[x] == inMem[2])
System.out.println("No Page Fault");
else
{
System.out.println("Page Fault for "+pages[x]+" Main Mem is ["+inMem[0]+inMem[1]+inMem[2]+"]");
memPt =(memPt+1)%3;
inMem[memPt]=pages[x];
}
}
}
}