Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Write a short note on file organization and access.
There are three methods to access files
The record access method is dependent on the physical medium on which the file is stored. Magnetic tape is sequential by it's extremely nature to read a record you must start at the beginning of the tape and sequentially read every record until you get to the one you want. With disks, obviously random access is possible. It is the same as the difference between audio compact disc and audio cassette. With audio tape you have to begin at the beginning and run the tape forward until you get to the song you want to hear. With compact disc you are able to play the songs in random order or go directly to the track you want to hear.
Though, not only ought to the medium permit for random access to records, however the file itself must support going directly to the record you want to retrieve. This feature of the file is called as file organization.
Determine a scheduling policy that is most suitable for a time-shared operating system Round-Robin is a scheduling policy that is most suitable for a time-shared operating s
What is segmentation? In a segmented memory management scheme a programmer views a program to be collection of program components called as segments. Every segment is a logical
Q. In a disk jukebox what would be the result of having more open files than the number of drives in the jukebox? Answer: Two bad results could result. One likelihood is star
Additional Reference bits algorithm Here we keep an 8-bit byte for every page in memory. At standard intervals the reference bit is shifted by the OS. If a shift register conta
Entry-sequenced file organization The records in an entry-sequenced file are store up in the order they are written into the file. New records are for all time appended to
simulate hole allocating ahogrithm
We will brie?y introduce paging to ?nish off this lecture. When a process is loaded, not all of the pages are immediately loaded, since it's possible that they will not all be need
SSTF (Shortest Seek Time First) After a demand go to the closest request in the work queue regardless of direction Decrease total seek time compared to FCFS Disadv
Problem: a) Define the term ‘process' and what are the different constituents of a process. b) In the three-state process model, what does each of the three states signify?
What are the requirements to be satisfied by the critical section problem? Following are the necessities to be satisfied by the critical section problem: a) Mutual exc
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd