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!
Q. Is disk scheduling except FCFS scheduling useful in a single-user environment? describe your answer.
Answer: In a single-user environment the I/O queue typically is empty. Requests in general arrive from a single process for one block or for a sequence of consecutive blocks. In these cases the FCFS is an economical method of disk scheduling. However LOOK is nearly as easy to program and will give much better performance when multiple processes are performing concurrent I/O such as when a Web browser retrieves data in the background while the operating system is paging as well as another application is active in the foreground.
Priority Scheduling leads to the risk of starvation: a process is ready, but never is given the processor. Some preemptive priority schedulers therefore reserve a fraction of the p
Write note on process, process state? A process is in excess of the program code which is sometimes known as text section. It as well includes the current activity as represent
What is indexed allocation? Every file has its own block of pointers to the sectors of the file.
Q. Catalogue the design goals of Windows XP. Answer: Design goals comprise security and reliability and Windows and POSIX application compatibility with high performance and ex
Explain about deadlock prevention? In order for the occurrence of deadlock, the four conditions like mutual exclusion, hold and wait, no pre-emption and circular wait must hap
Write about critical regions and monitors. Critical region definition Monitor definition Implementation of the conditional-region construct Syntax of monitor Monito
what is a batch system give me answer in simple words so that i can understand
what is unbounded buffer
Q. Presume that you have coded the deadlock-avoidance safety algorithm as well as now have been asked to implement the deadlock-detection algorithm. Can you do thus by simply usin
Contiguous allocation: Every file will be allocated contiguous space in the memory. Allow the block size be 1K If a 50K files desires to be allocated space after t
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