-
Notifications
You must be signed in to change notification settings - Fork 0
/
FIFO.java
58 lines (53 loc) · 1.7 KB
/
FIFO.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
import java.util.*;
public class FIFO{
public static void main(String Args[]){
Scanner sc = new Scanner(System.in);
System.out.print("Enter the No of elements to be inserted: ");
int noDigs = sc.nextInt();
int[] digs = new int[noDigs];
for(int i = 0; i < noDigs; i++){
System.out.print("Enter the element: ");
digs[i] = sc.nextInt();
System.out.println(" ");
}
System.out.println(" ");
System.out.print("Enter the legnth of cache: ");
int pageSize = sc.nextInt();
sc.close();
int[] fifo = new int[pageSize];
for(int i = 0; i < pageSize; i++){
fifo[i] = 0;
}
int hits = 0;
int pageNo = 0;
boolean flag = false;
for(int i = 0; i < noDigs; i++){
if(pageNo == pageSize){
pageNo = 0;
}
for(int j = 0; j < pageSize; j++){
if(fifo[j] == digs[i]){
flag = true;
for(int k = 0; k < pageSize; k++){
System.out.print(" |" + fifo[k] + "| ");
}
System.out.print(" Hit ");
System.out.println(" ");
}
}
if(flag == false){
fifo[pageNo] = digs[i];
pageNo++;
}else if(flag == true){
hits++;
flag = false;
continue;
}
for(int j = 0; j < pageSize; j++){
System.out.print(" |" + fifo[j] + "| ");
}
System.out.println(" ");
}
System.out.println("Hits: " + hits);
}
}