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 structure
Modern disk drives are initiate as large one dimensional array of logical blocks where the logical block is the smallest unit of transfer. The size of the logical block is typically 512 bytes and the one dimensional array of logical block is mapped onto the sectors of disk sequentially. Sector 0 is the initially first sector of the track on the outermost cylinder the mapping proceeds in order through that track after that through the rest of the tracks in that cylinder and then through rest of the cylinder from outermost to innermost. The faster a track is from the centre of disk that the greater its length so the more sectors it can hold. While we move from outer zone to inner zone the number of sectors per track decreases. Tracks in the outermost zone usually hold 40 percent more sectors than do tracks in the innermost zone. The drive enhance its rotation speed as the head moves from the outer to the inner track to keep the same rate of data moving under the head.
what is a batch system give me answer in simple words so that i can understand
Q. Define the difference among pre-emptive and non pre-emptive scheduling. Answer: Pre-emptive scheduling permits a process to be interrupted in the midst of its execution ta
What are the three main activities of an operating system in regard to memory management? Keep track of which parts of memory are now being used and by whom. Decide which pr
Paging: Only the needed memory pages are moved to main memory from the swap machine for execution. Process size does not matter. Produce the concept of the virtual memory. It
Q. Presume that a system is in an unsafe state. Illustrate that it is possible for the processes to complete their execution without entering a deadlock state. Answer: An unsaf
While it is hard to resolve a deadlock which has been detected, fortunately it is fairly easy to prevent deadlocks from ever happening. The key is that the conditions above for dea
Gang Scheduling : A set of related process is scheduled to execute on a set of processors at the similar time, on a 1-to-1 basis. Closely related processes or threads may be sched
Ask question #Minimuexplain the programable clock modes in a computer system m 100 words accepted#
Q. Is there any way to execute truly stable storage? Describe your answer. Answer: Truly steady storage would never lose data. The fundamental technique for steady storage is
Optimal page replacement An optimal page replacement algorithm has the least page fault rate of all algorithms. The algorithm states that a 'replace the page that will not be
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