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!
What is banker's algorithm?
Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple examples of each resource type. The two algorithms used for its execution are:
a. Safety algorithm: The algorithm for finding out whether or not a system is in a safe state.
b. Resource-request algorithm: if the resulting resource allocation is safe, the transaction is done and process Pi is allocated its resources. If the latest state is unsafe Pi must wait and the old resource-allocation state is restored.
Indexed allocation Indexed allocation bringing all the pointers together into one location: the index block. Every file has its own index block, which is an array of disk-block
Difference between cache and associate memory
What are overlays? To enable a process to be larger than the amount of memory allocated to it, overlays are used. The idea of overlays is to keep in memory only those instructi
Explain the general structure of a typical process? There are basically four main sections through which each of the process has to pass through.The universal algorithm is:-
What is a resource-allocation graph? Deadlocks can be explained more precisely in terms of a directed graph called a system resource allocation graph. This graph having of a se
Q. Presume that you have a page-reference string for a process with m frames (initially all empty). The page-reference string has length p along with n distinct page numbers
Explain the Architecting For Threads When available, threads are an integral part of any multitasking server application program. It is important that the operating system prov
What is a Process Control Block? Every process in the operating system is represented by a process control block as well called a task control block. It contains several pieces
what is the operating cycle in vegetable growing?
Define request edge and assignment edge. Answer: A directed edge from process Pi to resource type R j is denoted by Pi->j; it signifies that process Pi requested an instance
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