Core OS Concepts | Dataford Interview Questions

Explain key OS concepts and fundamentals of operating systems and concurrency.

Implement a Banker's algorithm safety check for processes competing for multiple resource types. Given currently available resources, each process's allocation, and its declared maximum demand, return whether all processes can finish in some order without deadlock.

The function accepts three lists of equal dimensions and returns a boolean. A process can finish when its remaining need is no greater than the currently available resources; after finishing, it releases its allocation.

Constraints

1 <= len(allocation) == len(maximum) <= 100
1 <= len(available) <= 20
Every allocation row and maximum row has len(available) elements
0 <= allocation[i][j] <= maximum[i][j]
0 <= available[j] <= 10^6

Function Signature

def is_safe_state(available, allocation, maximum):

Your question is Core OS Concepts. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Explain key OS concepts and fundamentals of operating systems and concurrency.

Constraints

1 <= len(allocation) == len(maximum) <= 100
1 <= len(available) <= 20
Every allocation row and maximum row has len(available) elements
0 <= allocation[i][j] <= maximum[i][j]
0 <= available[j] <= 10^6

Function Signature

def is_safe_state(available, allocation, maximum):

Your question is Core OS Concepts. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.