Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
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
what are the drawbacks of contiguous allocation of disk spacethe disadvantages area suffers from internal fragmentationb suffers from external
what are the advantages of contiguous allocationthe advantages area supports direct accessb supports sequential accessc number of disk seeks is
what are the allocation methods of a disk spacemethods of allocating disk space which are widely in use area contiguous allocationb linked
define seek time and latency timethe time taken by the head to move to the appropriate cylinder or track is known as seek time once the head is at
what are the functions of virtual file system vfsa it separates file-system-generic operations from their execution defining a clean vfs interface it
what are the various layers of a file systemthe file system is composed of many dissimilar levels each level in the design uses the feature of the
what is beladys anomaly when plotting on a graph the page faults versus the number of available frames we notice that the number of faults for four
explain fifo page replacementa fifo replacement algorithm associates with every page the time when that page was brought into memory when a page must
what is reference stringwe evaluate an algorithm by running it on a definite string of memory reference and computing the number of page faults the
briefly discuss on page replacement page replacement approach is fixed as follows if no frame is free we search one that is not presently being used
enhanced second-chance algorithmwhen we increase the second-chance algorithm by considering both the reference bit and the modify bit as an order
second-chance algorithmwhen a page has been selected we inspect its reference bit if the value is 0 we proceed to replace this page if the reference
additional-reference-bits algorithmwe can keep an 8-bit byte for every page in a table in memory the operating system shifts the reference bits right
internal file structureall disk io is performed in units of single block and all blocks are the similar size it is unlikely that the physical record
file structurecertain files must conform to a needed structure that is understood by the operating system the operating system may consist that an
explain the various file typesa common technique for executing file types is to contain the type as part of the file name the name is split into two