Invitation to Computer Science 8th Edition

Published by Cengage Learning
ISBN 10: 1337561916
ISBN 13: 978-1-33756-191-4

Chapter 4 - 4.4 - Building Computer Circuits - Practice Problems - Page 209: 2

Answer

The truth table for this circuit would be as follows: $\begin{array}{llll}{a} & {b} & {\text { Output }} \\ {0} & {0} & {0} \\ {0} & {1} & {0} \\ {1} & {0} & {1} \\ {1} & {1} & {0}\end{array} \quad$ (because $a$ is greater than $b )$ There is only one case where there is a 1 bit in the output. It is in the third row and corresponds to the following Boolean expression: $a \cdot \overline{b}$ We can skip Step 3 because with only one case, there is no combining of Boolean expressions. Thus, the circuit diagram for this circuit is
1561989000

Work Step by Step

The truth table for this circuit would be as follows: $\begin{array}{llll}{a} & {b} & {\text { Output }} \\ {0} & {0} & {0} \\ {0} & {1} & {0} \\ {1} & {0} & {1} \\ {1} & {1} & {0}\end{array} \quad$ (because $a$ is greater than $b )$ There is only one case where there is a 1 bit in the output. It is in the third row and corresponds to the following Boolean expression: $a \cdot \overline{b}$ We can skip Step 3 because with only one case, there is no combining of Boolean expressions. Thus, the circuit diagram for this circuit is
Small 1561989000
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.