For the following questions answer them individually
Which of the given number has its IEEE-754 32-bit floating-point representation as
(0 10000000 110 0000 0000 0000 0000 0000)
The range of integers that can be represented by an n-bit 2’s complement number system is
If half adders and full adders are implements using gates, then for the addition of two 17 bit numbers (using minimum gates) the numberofhalf adders and full adders required will be
Minimum number of 2 x 1 multiplexers required to realize the following function, $$f= \overline{A} \overline{B} C + \overline{A} \overline{B} \overline{C}$$.
Assume that inputs are available only in true form and Boolean a constant 1 and 0 are available.