Consider the following sequence of page references: 1 2 3 3 4 4 1 4 1 3 4. Determine how many page faults will occur with LRU(Le
1 answer:
Answer:
7 page faults
Explanation:
I have created a small Java program that can be seen in the attached picture below. This Java program uses an LRU algorithm in order to find the number of page faults within an array of page references from the references given in the question. Using these references, and the java program we can see that there are a total of 7 page faults. This can be seen in the output highlighted by red in the picture below.
You might be interested in
Answer:
B. {1, 2, 2, 3, 3, 4, 5}
Explanation:
Given
The above code segment
Required
Determine which list does not work
The list that didn't work is
Considering options (A) to (E), we notice that only list B has consecutive duplicate numbers i.e. 2,2 and 3,3
All other list do not have consecutive duplicate numbers
Option B can be represented as:
if (nums.get(j).equals(nums.get(j + 1)))
The above if condition checks for duplicate numbers.
In (B), when the elements at index 1 and 2 (i.e. 2 and 2) are compared, one of the 2's is removed and the Arraylist becomes:
The next comparison is: index 3 and 4. Meaning that comparison of index 2 and 3 has been skipped.
<em>This is so because of the way the if statement is constructed.</em>