Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
briefly explain about file system implementationseveral on-disk and in-memory structures are used to execute a file system on disk the file system
explain a working of file control block a file control block fcb has information about the file containing ownership permission and location of the
explain working of the logical file systemthe logical file system manages metadata information metadata contains all of the file-system structure
why is rotational latency usually not considered in disk scheduling how would you modify sstf scan and c-scan to include latency optimizationmost
explain why sstf scheduling tends to favor middle cylinders over the innermost and outermost cylindersthe center of the disk is the location having
is disk scheduling other than fcfs scheduling useful in a single-user environment explain your answerin a single-user environment the io queue
what is indexed allocationevery file has its own block of pointers to the sectors of the
what is linked allocation as detailed in textdirectory has pointers to first and last blocks of file every block of file except last has pointer to
what is preallocation why do itallocating space for a file before making the file to allow for expansion this reserves space for a certain file so
what is contiguous allocation allocation of a group of consecutive sectors for a one
list three ways of allocating storage and give advantages of eacha contiguous allocation fastest if no changes are to be made also simplest for
what is sector sparinglow-level formatting also sets aside extra sectors not visible to the operating system the controller can be told to change
what is the use of boot blockfor a computer to begin running when powered up or rebooted it requires having an initial program to run this bootstrap
what is low-level formattingbefore a disk can kept data it must be required into sectors that the disk controller can read and write this procedure
what are the various disk-scheduling algorithmsthe several disk-scheduling algorithms area first come first served schedulingb shortest seek time
define spoolinga spool is a buffer that holds output for a device like printer that cannot accept interleaved data streams when a request finishes
define cachinga cache is a region of fast memory that holds copies of data access to the cached copy is well-organized than access to the original
define bufferinga buffer is a memory area that keeps data whereas they are transferred among two devices or among a device and an application
how free-space is managed using bit vector implementationthe free-space list is implemented as a bit map or bit vector each block is shown by 1 bit
define rotational latency and disk bandwidthrotational latency is the additional time waiting for the disk to rotate the wanted sector to the disk
how can the index blocks be implemented in the indexed allocation schemethe index block can be implemented as followsa multilevel schemeb linked
what are the advantages of indexed allocationthe benefits area no external-fragmentation problemb solves the size-declaration problemsc supports
what are the disadvantages of linked allocationthe drawbacks area used only for sequential access of filesb direct access is not supportedc memory
what are the advantages of linked allocationthe benefits area no external fragmentationb size of the file does not require to be