大连外国语大学《计算机基础》2016-2017学年第一学期期末试卷.pdfVIP

大连外国语大学《计算机基础》2016-2017学年第一学期期末试卷 Problem 1: Buffer Manager (12 points, 3 points per part) Consider buffering of disk blocks in memory under the assumption that, to begin with, the buffer is empty, and that the maximum number of blocks that can be held in buffer is four. Assume in the following schedule that each of the data items A, B, C, D, E, F accessed in the schedule lies on distinct blocks. R (A,1) R (B,2) W (A,3) R (C,4) W (B,5) C W (C,6) R (D,7) 1 2 1 3