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.
Relocation bits employed by relocating loader are specified by Relocation bits employed by relocating loader are specified by Assembler or Translator
Define semaphore A semaphore is a protected abstract or variable data type that constitutes the classic method for restricting access to shared resources like shared memory in
Hierarchical paging method Most modern computer systems maintain a large logical-address space. In this situation the page table itself turns into excessively large. To remedy
To evade race condition, the maximum number of processes that may be at the same time inside the critical section is The maximum number of processes which may be at the same t
advantages and disadvantages
categorize the CPU scheduling algorithms and among them explain the non-preemptive algorithms..
what is hashed page tables & explain of there work & figure
server configure
Explain the Exit (status) Function Exit function causes the calling process to be terminated. Actually, all file descriptors are immediately closed but the process is not
Applications allocate memory in terms of the number of bytes that they need, but this level of granularity is too ?ne-grained for the operating system to manage the system memory i
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