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.

A memory page containing a heavily used variable that was initialized very early and is in constant use is removed when

In which one of the following cases is it possible to obtain different results for call-by-reference and call-by-name parameter passing methods?