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.
Define the difference between preemptive and nonpreemptive scheduling. State why strict nonpreemptive scheduling is unlikely to be used in a computer center. Preemptive schedul
Write on short note DMA. Direct M emory Access (DMA) is a technique for transferring data from main to a device without passing it through the CPU. Computers that have
We can view an operating system as a resource allocator. Explain. We can outlook an operating system as a resource allocator. A computer system has Many resources (software and
The producer-consumermodel above has a standard human analogy of an assembly line. Humans have specialized skills, however, whereas threads running the same program do not need to
Q. How would utilize of a RAM disk affect your selection of a disk-scheduling algorithm? What factors would you require to consider? Do the similar considerations apply to hard-di
What is real time system? A real time system has well explained, fixed time constraints. Processing must be done within the explained constraints, or the system will fail. It i
Define the OS/2 threads code The sample program in Listing is very similar to the NetWare example. OS/2 commands are substituted for the pseudocode commands controlling thread
what is multiprogramming
Define Server Processing with Queues The efficient server processing of client request is essential for optimized client- server applications. This process is greatly enhanced
Q. Explain the differences in terms of cost between the three storage types nonvolatile, volatile and stable. Answer: Volatile storage refers to main as well as cache memory an
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