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 the function of operation management?
Explain Components of conflict phase of dispatch latency The conflict phase of dispatch latency has two components 1. Preemption of any process running in the kernel. 2.
Characteristics of suspend process Suspended process isn't immediately available for execution. The process may or may not be waiting on an event. For preventing t
Q. Give an instance of an application in which data in a file should be accessed in the following order: a. Sequentially b. Randomly Answer: a. Print the content of
As mentioned above, page tables, are lookup tables mapping a process' virtual pages to physical pages in RAM. How would one implement these page tables? The most straightforward
Additional-reference-bits algorithm We can keep an 8-bit byte for every page in a table in memory. The operating system shifts the reference bits right 1 bit, discarding the lo
Q. Present an algorithm for reconstructing a logical ring after a process in the ring fails? Answer: Typically distributed systems utilize a coordinator process that performs
What are threads? A thread - sometimes called as an implementation context or a lightweight process - is a single sequential flow of control within a program. We use threads
Q. Explain about Spooling? Acronym for simultaneous peripheral operations on line. Spooling denotes to putting jobs in a buffer, a special area in memory or on a disk where
Buffering Messages exchanged by communication processes reside in a impermanent queue. Such a queue can be executed in three ways. Zero capacity: The queue length is 0.
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