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!
Question :
(a) The dynamic allocation problem is how to satisfy a request of size n from a list of free holes into memory. The best-fit, first-fit and worst-fit strategies are the most common methods used for selecting a free memory hole from a set of memory holes. Simply describe these 3 strategies.
(b) Given memory partitions of 100K, 500K, 200K, 300K and 600K (in order). How would each of the First-fit, Best-fit and Worst-fit algorithms place processes of 212K, 417K, 112K and 426K (in order)?
(c) Which algorithm makes the most efficient use of memory?
Q. If magnetic hard disks eventually have the same cost per gigabyte as do tapes will tapes turn into obsolete or will they still be needed? Describe your answer. Answer: Tap
Q. Several CPU-scheduling algorithms are parameterized for instance the RR algorithm requires a parameter to indicate the time slice. Multilevel response queues require parameters
What is a Latency Time Latency Time is the time required through a sector to reach below read/write head.
write a linux command to display lines from 25 - 45 of directory "/edc/password" write a linux command to display directory in /edc
Ok so i think i got this right by not 100% on this. what I want to figure out is if there are x visitors that can line up for a ride but only 1 passenger can get on the ride at a t
What is contiguous allocation? Allocation of a group of consecutive sectors for a one file.
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
How can deadlocks be represented? Deadlocks are able to be described in terms of a directed graph called as a system resource-allocation graph. This graph contains of the foll
Parent and Child process communicate in unix A child and parent can interact through any of the normal inter-process communication schemes (pipes, message queues, sockets, s
What is spooling? Spooling overlaps the I/O of single job with the computation of other jobs.
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