combinational circuit that compares two 2-bit binary numbers, A = a1a0 an

In the IEEE single-precision format, how many bits are reserved for the exponent?

Q2. Two integer numbers A and B are represented in pure binary by two bits, being A=a₁a0 and B=b₁bo. c) A logic circuit provides the 4 bits output C=C3C2C1C0, as shown in the truth table below. FO a₁ 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 ao og 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 b₁ 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 bo 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 C3 0 0 0 C2 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 1 1 C1 1 0 1 0 0 0 0 0 1 0 1 0 0 0 0 0 Write the expression as Max Term form with for c2. Co 1 1 1 1 0 OO 0 0 0 1 1 1 1 0 ooo 0 0 0

Give the bit pattern that would result from a bitwise AND, OR and XOR operation on the following two bit patterns: 10101010 11110000 AND: OR: XOR: