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 part of the system software, which under all circumstances must reside in the main memory is:

A simple two-pass assembler does the following in the first pass:

Match the pairs in the following question by writing the corresponding letters only.