Description
What to submit: One zip file named
own student ID). It should contain four files:
● one PDF file named hw10.pdf for Section 1. Write your answers in English. Check
your spelling and grammar. Include your name and student ID!
● The programming assignment will be posted separately with its own due date.
1. [30 points] Problem Set
1. [20 points] 11.2 Contrast the performance of the three techniques for allocating disk
blocks (contiguous, linked, and indexed) for both sequential and random file access.
You must elaborate to receive full credit.
2. [10 points] 11.8 Consider a file system that uses inodes to represent files. Disk
blocks are 8 KB in size, and a pointer to a disk block requires 4 bytes. This file
system has 12 direct disk blocks, as well as single, double, and triple indirect disk
blocks. What is the maximum size of a file that can be stored in this file system?
You must show your calculation to receive credit.
2. [30 points] Programming Problems
Strictly speaking, this is not really a programming problem, but more like an interactive
experimentation.
11.13 [modified preparation instruction] Before starting this problem, create two text files
named file1.txt, file3.txt (but not file2.txt!!) in a Unix or Linux-like system (i.e.,
uses inodes in its file system) with unique contents. Next, obtain the inode number of this file
with the command
ls -li file1.txt
This will produce output similar to the following:
16980 -rw-r–r– 2 os os 22 Sep 14 16:13 file1.txt
where the inode number is boldfaced. (The inode number of file1.txt is likely to be
different on your system.)
The UNIX ln command creates a link between a source and target file. This command
works as follows:
ln [-s]