Scribd
Upload
3 views

COMP3101-Tutorial9 (1)

The document covers key concepts in operating systems related to device I/O, disk scheduling, and file management, including programmed vs interrupt driven I/O, block vs stream oriented devices, and various file allocation methods. It also includes practical exercises on calculating average seek lengths for different disk scheduling algorithms and determining the largest partition supported by a file system. Additionally, it compares NTFS and ext2 file systems based on their features and explores the maximum file size supported by a file system using specific indexing methods.

Uploaded by

kid unique
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

COMP3101-Tutorial9 (1)

The document covers key concepts in operating systems related to device I/O, disk scheduling, and file management, including programmed vs interrupt driven I/O, block vs stream oriented devices, and various file allocation methods. It also includes practical exercises on calculating average seek lengths for different disk scheduling algorithms and determining the largest partition supported by a file system. Additionally, it compares NTFS and ext2 file systems based on their features and explores the maximum file size supported by a file system using specific indexing methods.

Uploaded by

kid unique
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

COMP3101 Operating Systems

Tutorial 9 – Device I/O, Disk Scheduling and File Management

1. Discuss each of the following concepts:


 programmed I/O vs interrupt driven I/O
 block device vs stream oriented device
 disk block and disk sector
 file allocation table
 indexed allocation
 free list

2. The head of a disk is at track 100 and moving toward the last (innermost) track. There are
requests for cylinders 80, 123, 45, 79, and 130 (in that order. Calculate the average seek length
under each of the following scheduling algorithms:
a. FIFO
b. SSTF
c. SCAN

3. A computer file system uses a 32-bit block address with a block size of 512 bytes. What is the
largest partition this system can support?

4. Windows and Linux use the NTFS and ext2 file systems respectively. Identify which of these
two file systems support(s)neach of the following features:
a. create, open or delete a file
b. tree structured directories
c. case sensitive file and folder names
d. ability to mount one file system onto another file system
e. access control mechanisms

5. A file system uses a 1 KB block size. Each file is identified by an index nodes(i-node) which has
14 pointers. Each of the first 12 pointers points to 1 block of that that the file stores. The 13 th
pointer points to a block that contains 64 pointers each of which points to a block of data. The
14th pointer in an i-node uses double indirect addressing by which the block stores 64 pointers
each of which points to another block of 64 pointers. What is the largest file that this file
system can support?

You might also like