Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
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
we are faced with three major components of the page-fault service time 1 service the page-fault interrupts2 read in the page3 restart the
a page fault causes the following sequence to occur1 trap shut in to the operating system2 save the process registers and process state3 verify that
performance of demand pagingdemand paging can have an important effect on the performance of a computer system as long as there are no page faults
the hardware to support demand paging is as follows page table this table has the skill to mark an entry invalid though a valid-invalid bit or
the procedure for handling the page fault is as follows1 we check the internal table to verify whether the reference was valid or invalid2 if the
basic conceptswhen a process is to be changed in the pager guesses which pages will be used before the process is changed out again instead of
explain about demand paginga demand paging system is same to a paging system with swapping processes reside on secondary memory when we require
what are files and explain the access methods for filesfile definitionattributes operations and typesdirect accesssequential access with diagramother
explain the various page replacement strategiespage replacement-basic scheme with diagramoptimal page replacementlru page replacementfifo page
general graph directorythe serious problem with using an acyclic-graph structure is ensuring that there are no cycles when we insert links to an
acyclic-graph directoriesan acyclic graph permits directories to have shared subdirectories and files the similar file or subdirectory may be in two
what are tree-structured directorieswe can generalize the directory structure to a tree of arbitrary height this permits the user to create their own
what is two-level directoryin the two-level directory structure every user has own user file directory ufd when a user jobs begins or a user logs in
what is single-level directoryall files are constrained in the similar directory which is simple to support and understood one limitation is when the
operations that are to be performed on a directory aresearch for a file we are able to find all files whose names match a exact patterncreate a file
normal 0 false false false en-in x-none x-none microsoftinternetexplorer4
what problems arise if the directory structure is a general graphsearching for a particular file may result in searching the similar directory many
what is a general grapha tree structure where links can go from one branch to a node earlier in the similar branch or other branch allowing
list ways to share files among directories in operating systemsa copy file from one account into anotherb link directory entry of copied file to