Avoidance needs a concrete way to decide whether granting a request keeps the system safe when resources have several instances. Banker's algorithm does that by checking for a safe sequence using each process's declared maximum need. Use it for the classic table numericals that ask for Need, a safe sequence or whether a request can be granted. Real operating systems rarely run it, because processes seldom know their maximum needs in advance.