Linux uses a time-sharing algorithm ___________
A. To pair preemptive scheduling between multiple processes
B. For tasks where absolute priorities are more important than fairness
C. All of the mentioned
D. None of the mentioned
The replacement of a bad block generally is not totally automatic because ___________
A. Data in bad block can not be replaced
B. Data in bad block is usually lost
C. Bad block does not contain any data
D. None of the mentioned
What will happen during the recovery from a failure?
A. Each pair of physical block is examined
B. Specified pair of physical block is examined
C. First pair of physical block is examined
D. None of the mentioned
When we write something on the disk, which one of the following can not happen?
A. Successful completion
B. Partial failure
C. Total failure
D. None of the mentioned
RAID level 1 refers to ___________
A. Disk arrays with striping
B. Disk mirroring
C. Both disk arrays with striping and disk mirroring
D. €?. advertisement
A swap space can reside in ___________
A. Separate disk partition
B. Ram
C. Cache
D. None of the mentioned