The time complexity of Banker's algorithm is r* (P*P) where P is the number of active processes and r is the number of _____
The time complexity of Banker's algorithm is r* (P*P) where P is the number of active processes and r is the number of _____
The correct option is B Resources
The time complexity of
banker's algorithm is r* (P*P) where P is the number of active processes and r
is the number of resources.
The banker's algorithm
is a resource allocation and deadlock avoidance algorithm that tests for safety by simulating the allocation for predetermined maximum possible amounts of all resources, then makes an “s-state” check to test for possible activities,
before deciding whether allocation should be allowed to continue.
Banker's algorithm is a resource
allocation and deadlock avoidance algorithm. Banker's algorithm is generally
used to find if a safe
sequence exist or not.
Deadlock:-
A deadlock is a situation in which two computer programs sharing the
same resource are effectively preventing each other from accessing the
resource, resulting in both programs ceasing to function. The earliest computer
operating systems ran only one program at a time.
The time complexity of banker's algorithm is r* (P*P) where P is the number of active processes and r is the number of resources.
The banker's algorithm is a resource allocation and deadlock avoidance algorithm that tests for safety by simulating the allocation for predetermined maximum possible amounts of all resources, then makes an “s-state” check to test for possible activities, before deciding whether allocation should be allowed to continue.
Banker's algorithm is a resource allocation and deadlock avoidance algorithm. Banker's algorithm is generally used to find if a safe sequence exist or not.
Deadlock:-
A deadlock is a situation in which two computer programs sharing the same resource are effectively preventing each other from accessing the resource, resulting in both programs ceasing to function. The earliest computer operating systems ran only one program at a time.
