Assignment 4 FIFO, Optimal Page Replacement
Assignment 4 FIFO, Optimal Page Replacement
PageReplacement.java
import java.io.*;
import java.util.Scanner;
class PageReplacement
{
public static void main(String args[])throws IOException
{
BufferedReader obj=new BufferedReader(new InputStreamReader(System.in));
int f,page=0,ch,pgf=0,n,chn=0;
boolean flag;
int pages[]; //pgf-page fault
do{
System.out.println("Menu");
System.out.println("1.FIFO");
System.out.println("2.Optimal Page Replacement");
System.out.println("3.EXIT");
System.out.println("ENTER YOUR CHOICE: ");
ch=Integer.parseInt(obj.readLine());
switch(ch)
{
case 1:
int pt=0;
System.out.println();
pgf++;
}
else
{
System.out.print("frame :");
for(int j=0;j<f;j++)
System.out.print(frame[j]+" ");
System.out.println();
}
chn++;
}
}while(chn!=n);
System.out.println("Page fault:"+pgf);
break;
case 2:
Scanner in = new Scanner(System.in);
int frames = 0;
int pointer = 0;
int numFault = 0;
int ref_len;
boolean isFull = false;
int buffer[];
boolean hit[];
int fault[];
int reference[];
int mem_layout[][];
if(search == -1)
{
if(isFull)
{
int index[] = new int[frames];
boolean index_flag[] = new boolean[frames];
for(int j = i + 1; j < ref_len; j++)
{
for(int k = 0; k < frames; k++)
{
if((reference[j] == buffer[k]) && (index_flag[k] == false))
{
index[k] = j;
index_flag[k] = true;
break;
}
}
}
int max = index[0];
pointer = 0;
if(max == 0)
{
max = 200;
}
case 3:
break;
}
} while(ch!=3);
}
}