Question

Write the logic expression (Z = …) for the diagram shown below.
X goes to U1 NOT and U2 NOT
Y goes to OR2
Then at z

Answer 1

To write the logic expression \( Z \) based on the provided description, let's break down the components mentioned:

1. **Inputs:**
- \( X \)
- \( Y \)

2. **NOT gates (U1 and U2):**
- \( U1 \) outputs \( \overline{X} \) (the NOT of \( X \)).
- \( U2 \) also takes \( X \) as input, so it also outputs \( \overline{X} \).

3. **OR gate (OR2):**
- Since \( Y \) goes to OR2, we need to consider what the inputs to this OR gate are.
- Assuming \( U2 \)'s output (which is \( \overline{X} \)) also feeds into this OR gate along with \( Y \).

4. **Final Output (Z):**
- The output \( Z \) of the system would be the output of the OR gate, which takes inputs of \( \overline{X} \) and \( Y \).

Putting this all together, the logic expression for \( Z \) can be expressed as follows:

\[
Z = \overline{X} + Y
\]

Where:
- \( \overline{X} \) is the output from NOT gate U1 (or U2, since they both are fed the same input \( X \)).
- \( + \) represents the OR operation.

Thus, the final expression \( Z \) is \( Z = \overline{X} + Y \).