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. The instance of handshaking used 2 bits: a busy bit as well as a command-ready bit. Is it probable to implement this handshaking with only 1 bit? If it is illustrate the protocol. If it isn't explain why 1 bit is insufficient.
Answer: It is probable using the following algorithm. Let's presume we simply use the busy-bit (or the command-ready bit this answer is the similar regardless). While the bit is off the controller is idle. The host writes to data-out as well as sets the bit to signal that an operation is readies (the equivalent of setting the command-ready bit). While the controller is finished it clears the busy bit. The host then commence the next operation.
This solution necessitates that both the host and the controller have read and write access to the same bit which can complicate circuitry and increase the cost of the controller.
Scalability : Scalability is the competence of the system to adapt to increased service load. A scalable system will respond more gracefully to increased load than a non-sc
Write a short note about the different STATES of a process. As a process implement it changes state. The state of a process is described in part by the current activity of that
Q. Why is it significant to balance file system I/O among the disks as well as controllers on a system in a multitasking environment? Answer: A system can perform mere
Q. List three instances of deadlocks that aren't related to a computer system environment. Answer: Two cars passage a single-lane bridge from opposite directions.
The optimal replacement policy, called OPT, is to evict the page which will be accessed farthest into the future. Since we can't predict the future precisely, we can't implement OP
Explain the different sections of a process. Entry section Critical section Exit section Remainder section Consider a system inclusive of n processe
Explain bounded buffer and unbounded buffer. Here in a producer-consumer problem the producer process produces information that is consumed by a consumer process. At this time
Write a short note on PCB? Every process is represented in the operating system by a process control block also called a task control block. It contains more information regard
What is degree of multiprogramming ? Degree of multiprogramming signifies the number of processes in memory. If the degree of Multiprogramming is steady after that the average
Locks (also known as mutexes, short for mutual exclusion locks) provide mutual exclusion to shared data inside a critical session. They are implemented by means of two atomic routi
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