The Gateway to Computer Science Excellence
+1 vote
1.4k views

Consider a file currently consisting of $50$ blocks. Assume that the file control block and the index block is already in memory. If a block is added at the end (and the block information to be added is stored in memory), then how many disk $I/O$ operations are required for indexed (single-level) allocation strategy ?

  1. $1$ 
  2. $101$
  3. $27$
  4. $0$
in Operating System by Boss (30.2k points)
recategorized by | 1.4k views

1 Answer

0 votes

Since file control block and the index block is already in memory  we need not fetch them from disc.

We need to copy the new block to be added from disc (1 I/O operation). that's it

Answer will be A

by Boss (32.5k points)
0
but "a nd the block information to be added is stored in memory " doesn't it mean no block is needed or what? (hope u understand by intention at D. 0 further easing the memory in ur direction of argument only)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,491 answers
195,434 comments
100,668 users