The number of substrings (of all length inclusive) that can be formed from a character string of length $$n$$ is

Let A and B be any two arbitrary events, then, which one of the following is true?

Consider the resource allocation graph given in the figure.
(a) Find if the system is in a deadlock state.
(b) Otherwise, find a safe sequence.

Consider the following heap (Figure) in which blank regions are not in use and hatched region are in use.

The sequence of requests for blocks of size $$300, 25, 125, 50$$ can be satisfied if we use.