The pass numbers for each of the following activities

(i) object code generation
(ii) literals added to literal table
(iii) listing printed
(iv) address resolution of local symbols that occur in a two pass assembler respectively are

Both’s algorithm for integer multiplication gives worst performance when the multiplier pattern is

Consider the following floating point number representation

The exponent is in $$2’s$$ complement representation and mantissa is in the sign magnitude representation. The range of the magnitude of the normalized mantissa in this representation is

A $$ROM$$ is used to store the table for multiplication of two $$8$$ bit unsigned integers. The size of $$ROM$$ required is