Design a complete circuit for a few comparison functions (on 2bit integers). The function takes 2 2bit inputs (lets call these a0, a1 and b0, b1) and has three outputs (lets call these l, g, and e). The l output is 1 if the 2bit integer in a1a0 (a0 being the least significant bit) is less than b1b0, and 0 otherwise. The g output is 1 if a1a0 is greater than b1b0, and 0 otherwise. The e output is 1 if a1a0 is equal to b1b0, and 0 otherwise. The process you will use is outlined below: 1. Create a truth table for the four inputs and three outputs. Fill in the truth table, using your own understanding of less than, equal, and greater than. 2. From the truth table in part 1, create a Boolean expression for each of the outputs, in terms of a0, a1, b0, and b1. 3. Simplify this Boolean expression using any of the techniques weve learned. 4. Create the equivalent digital circuit design using a software tool (logism). Be sure to label the inputs and outputs. Ideally, the inputs should be on the left side (or the top) and the outputs should be on the right side (or bottom), for clarity.

Design a circuit with at least 4 inputs to calculate any function you like. Use the same strategy as you used for the above task to design the circuit. Examples: Design a circuit to subtract 2 2bit binary numbers Design a circuit that has inputs for whether or not one of four keywords was present in the EMail, and an output indicating whether or not the message is spam