Week 12 Tutorial
================

The tutorial review questions for this week are:
   from Chapter 13, File Management, #5, #6, #8, #9 .
bfn

#5 How many device operations (for example, disk sector reads
   and writes) are required to add a released node to a free
   list, where the free list is implemented with the linked-list
   approach?  Do two-way linked lists decrease the number of
   device operations?

#6 How many device operations are required to add a released
   node to a free list when the block status map approach is
   used to implement the free list?

#8 Suppose a file system is based on the indexed allocation
   strategy for managing blocks.  Assume each file has a
   directory entry giving the filename, first index block,
   and the length of the file.  The first index block, in turn,
   points to 249 file blocks and to the next index block.  If
   the file is currently positioned at logical block 2010
   and the next operation is to access logical block 308,
   how many physical blocks must be read from the disk?
   Explain your answer.

#9 Suppose a UNIX disk block will hold 2056 disk addresses.
   What is the maximum-sized file using only the direct
   pointers?  Single-indirection capability?  Double-
   indirection capability? Triple-indirection capability?