Assignment 7, due Jul 5
Part of
the homework for CS:2630, Summer 2018

On every assignment, write your name legibly as it appears on your University ID card! Homework is due on paper at the start of class on the day indicated (Tuesday or Thursday). Exceptions will be made only by advance arrangement (excepting "acts of God"). Late work must be turned in to the TA's mailbox (ask the CS receptionist in 14 MLH for help). Never push homework under someone's door!
a) Give the truth table for a twoinput compare function that has a true output only when both inputs are equal. (0.5 points)
b) Use the given methodology to derive the logic for a twoinput compare function. Do not delete any unneeded gates. Present your result as a neatly drawn logic diagram. Do not use any shorthand notations. (0.5 points)
c) Redraw your solution from part b) without unneeded gates, aiming for maximum legibility. Again, present your result as a neatly drawn logic diagram. (0.5 points)
d) Give a boolean expression in terms of the and, or and not operators that is exactly equivalent to the logic diagram you gave as your answer to part b. (0.5 points)
Here are the same numbers in their Gray code order:
a) Give the truth table for a binarytoGraycode converter. This will have 3 inputs and 3 outputs, so if the input is, for example, 010, the output will be 011, and if the input is 101, the output will be 111. (0.5 points)
b) Use the methodology from Chapter 8 to convert that truth table to a logic diagram. Legibility counts! Again, do not abbreviate and do not delete any unneeded gates. (0.5 points)