Help in operating system concept

 

1. Consider the following ROOT directory and FAT. (Note that block 12 is the
   first free block in the free list. The FAT is at block 1 and the ROOT at 2.)

                              -----------
                              |  0 | 12 |
                              -----------
                              |  1 |  0 |
                              -----------
                              |  2 |  0 |
               ----------     -----------
               | F1 |  4 |    |  3 | 10 |
               ----------     -----------
               | F2 | 13 |    |  4 |  5 |
               ----------     -----------
               | F3 |  7 |    |  5 |  6 |
               ----------     -----------
               |    |    |    |  6 |  8 |
               ----------     -----------
               |    |    |    |  7 |  0 |
               ----------     -----------
               |    |    |    |  8 | 11 |
               ----------     -----------
                 ROOT         |  9 | 14 |
                              -----------
                              | 10 |  0 |
                              -----------
                              | 11 |  0 |
                              -----------
                              | 12 | 17 |
                              -----------
                              | 13 |  3 |
                              -----------
                              | 14 | 15 |
                              -----------
                              | 15 | 16 |
                              -----------
                              | 16 |  0 |
                              -----------
                              | 17 |  9 |
                              -----------
                                  FAT

   Indicate the entries in these tables when the following procedures are
   executed.

                          ADDBLOCK(F2,B)
                          ADDBLOCK(F1,B)
                          DELBLOCK(F1,5)
                          DELBLOCK(F3,7)
                          ADDBLOCK(F1,B)

2. Write a function "string getfile(FileSys& filesystem, string filename)" 
   which uses the FileSys class to return the contents of the file "filename" 
   in the file system "filesystem". The function should read each block from 
   the file and concatenate the contents of the block onto the string.

3. A disk drive has 16384 cylinders, 1024 sectors, 16 surfaces and 
   512 bytes/block, and spins at 12000RPM. 
   a. What is the storage capacity of the disk?
   b. What is the maximum data transfer rate (bytes/second)?
   c. What is the maximum rotational delay?
   d. What is the transfer time?

4. A floppy has two sides, 18 sectors/track, 80 tracks and 512 byte blocks.
   a. If DOS has 12 bit block addresses, how many blocks are needed 
      to store the FAT?
   b. If 16 bit block addresses are used, how many blocks are needed 
      to store the FAT?

5. A Unix file system is installed on a disk with 1024 byte logical blocks. 
   (Logical blocks can be increased in size by combining physical blocks.)
   Every i-node in the system has 10 block addresses, one indirect block 
   address and one double indirect block address.
   
   a. If 24 bit block addresses are used what is the maximum size of a file?
   b. If the block size is increased to 4096, then what is the maximum file 
      size?
Place your order
(550 words)

Approximate price: $22

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
The price is based on these factors:
Academic level
Number of pages
Urgency
Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

Read more

Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.

Read more

Privacy policy

Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.

Read more

Fair-cooperation guarantee

By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.

Read more