In: Computer Science
First derive the truth table for the requested modulus sequence, draw the circuit, then implement it using only the built-in AND, OR, and NOT gates.
Exercise 18 [3.0]
LOCK
Consider a boolean function with inputs: d, e, f, g. The value of the inputs can be defined as V = 8*d + 4*e + 2*f + 1*g. The output of this function is true if V mod 3 is 1.
if V mod 3 not equal to 1 then output is 0.
If V mod 3 equal to 1 then output s 1.
Truth Table