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 what the “blocking factor” of a file is Blocking factor is the number of logical records in one physical record
Q. Explain about Input - Output System Management? I/O System Management The module which keeps track of the status of devices is known as I/O traffic controller. Every
In a multiprogramming and time sharing environment several users share the system simultaneously .what are two such problems?
properies of Batch oriented and interactive operating system.
List operations to be performed on directories. Search for a file, delete a file, create a file, list a directory, rename a file, and traverse the file system.
What is preallocation? Why do it? Allocating space for a file before making the file to allow for expansion. This reserves space for a certain file so that other files can't gr
Q. Explain about Deadlocks? Deadlocks for (int i = 0; i // first find a thread that can finish for (int j = 0; j if (!finish[j]) { boolean temp = true; for
what do you mean by starvation?explain in detail
expalin about the design issues of network operating system
NEXT FIT ALGORITHM Here scanning starts from the first fit position and then it finds the next position which is large sufficient to hold the process. Thus the name next fit.
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