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 disk scheduling
One of the responsibities of operating system O/S is to use the hardware efficiently. Whenever a process requires I/O to or from the disc it issues a system call to the operating system. The request state severer pieces of information:
If the disk controller and drive are available the request can be serviced immediately. If the controller or drive is busy any new request for service will be placed on the queue of pending request for that drive. For a multiprogramming system with several processes the disk queue may often have several pending requests. Therefore when request is accomplish the operating system chooses which pending request to service next.
Define the DosSleep(ms) Function used in the os/2 DosSleep() suspends the currently executing thread for some time interval specified in the ms parameter. If a value of 0 is
A UNIX file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contains 10 direct entries, and one single, double, and triple indirect entry
What are the four necessary conditions of deadlock prevention? Ans: Four essential conditions for deadlock prevention: a. The meaning of removing the mutual exclusio
Define which is not a key piece of information, stored in single page table entry, supposing pure paging and virtual memory A reference for the disk block which stores the pa
Define Instance. An instance is an administrative unit in which components of R/3 systems giving one or more services are grouped together. The services offered by a case are
Q. Describe the concept of transaction atomicity? Answer: A transaction is a sequence of read as well as writes operations upon some data followed by a commit operation. If the
short note on context switching
LRU approximation page replacement In this we are able to use the reference bit associated with the page entry to choose a page to be removed. The various algorithms used for
Linked allocation With linked allocation, every file is a linked list of disk blocks; the disk blocks might be scattered anywhere on the disk. The directory has a pointer to th
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.
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