Question 1
Given that it takes 1.75 ms to travel from one track to the next of a hard drive; that the arm is originally positioned at Track 15 moving toward the low- numbered tracks; and that you are using the LOOK scheduling policy: Compute the total seek time to satisfy the following requests-4, 40, 35, 11, 14, and 7. Assume all requests are initially present in the wait queue. (Ignore rotational time and transfer time; just consider seek time.)
Question 2
Describe how implementation of a RAID Level 2 system would be beneficial to a university payroll system. In your own words, describe the disadvantages of such a system, if any, in that environment, and if appropriate, suggest an alternative RAID system and explain your reasoning.
Question 3
Imagine one real life example of each: a multi-file volume and a multi-volume file. Include a description of the media used for storage and a general description of the data in the file
Question 4
The following is an access verification technique, listing several files and the access allowed for a single user. Identify the control technique used here, and for each, explain the type of access allowed.
a. File_1 R-E-
b. File_12 RWE-
c. File_13 RW-
d. File_14 -E-
Question 5
Devise a way to compress the following list of city/town names from a travel database. Describe your method and show the compresses list. Explain if you would use a lossless or lossy technique and explain the advantages or disadvantages of using the other technique: Alban, Albany, Almon, Almond, Angelica, Angelo.