Lab 13

Suppose that you are a computer engineer, and you need a circuit that will take three inputs a0, a1, and a2, and produce two outputs, b0 and b1. Taken in the order b1 b0, the output must be the binary number that represents the number of 1's among a0, a1, and a2 . For example, if a0=1, a1=0, and a2=1, there are two 1's in all. Thus b1 b0 = 1 0, the binary representation of '2', ie b1=1, b0=0. The person who designs circuits will be happy to produce the required circuit, but you must tell the designer what boolean expression in terms of a0, a1, and a2 will produce b0, and what boolean expression in the a's will produce b1.

  1. Compute b0 for all possible truth values of a0, a1, and a2. Give your results in truth table format, with columns for a0, a1, a2, and b0. Repeat for b1.

  2. Produce boolean statements that have the same truth tables as the columns for b0 and b1 in the tables you developed in part 1.

This is a pencil-and-paper exercise. Laptops are not necessary for class on May 5.