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!
Briefly discuss on Bankers algorithm?
The resource-allocation graph algorithm is not applicable to a resource-allocation system with multiple examples for each resource type. So we go for bankers algorithm but is less well-organized that resource allocation graph scheme.
When a new procedure enters it must declare the maximum number of instances of every resource type that it may need. When a user request a set of resources, the system must verify whether the allocation of these resource will leave the system in a safe state. If it will the resources are allocated; otherwise the process must wait unless some other process releases enough resources.
Demand paging With demand paging, a page is called into memory only when a location on that page is actually indexed during run time. With pre-paging, pages other than the one
Q. Is disk scheduling except FCFS scheduling useful in a single-user environment? describe your answer. Answer: In a single-user environment the I/O queue typically is empty.
Problem: (a) Modern operating systems are interrupt driven. If there are no processes to execute, no I/O devices to service, and no users to whom to respond, an operating syste
___paging fecthces a page only when needed
Which are the different states of a process? Different status of a process is: New: When the process is created. Running: When instructions are executed. Wait
Q. Data transfer between two processes? Communication: Data transfer between two processes is essential for some time. Both processes are on the one computer or on different
Explain Busy Waiting Semaphores Weak, Busy-wait Semaphores a) The simplest way to implement semaphores. b) Useful while critical sections last for a short time, or we com
Define throughput? Throughput in CPU scheduling is the number of processes that are completed per unit time. For long processes, this rate might be one process per hour; for sh
Q. What are the tradeoffs concerned in rereading code pages from the file system versus using swap space to store them? Answer: If codes pages are accumulate in swap space th
categorize the CPU scheduling algorithms and among them explain the non-preemptive algorithms..
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