1. Suppose we represent each process in a multiprogramming system with a dot and draw an arrow from one dot to another if the process represented by the first dot is waiting for a (nonsharable)...

1.
Suppose we represent each process in a multiprogramming system with a dot and draw an arrow from one dot to another if the process represented by the first dot is waiting for a (nonsharable) resource being used by the second. Mathematicians call the resulting picture a
directed graph.
What property of the directed graph is equivalent to deadlock in the system?

2.
Give some examples of poor choices for passwords and explain why they would be poor choices.