Derive Boolean expressions for the circuits of Figure 2.19; use truth tables to discover if they are equivalent.
Figure 2.19 Circuits for Exercise 2.1.
- Z = m 0 + m 1 + m 2 + m 5 + m 7 + m 8 + m 10 + m 14 + m 15
- Z = m 3 + m 4 + m 5 + m 7 + m 9 + m 13 + m 14 + m 15
Describe two ways of representing negative binary numbers. What are the advantages and disadvantages of each method?
A floating-point decimal number may be represented as:
(–1) s x 1 · m x 2 e
Explain what the binary numbers s, m, and e represent. How many bits would typically be used for s, m, and e in a single precision floating-point number?