Identify the Boolean expression from the given options, which is equivalent to the Logic Circuit Diagram.

Correct option is A

• The first gate is an OR gate.
• Input A enters directly.
• Input B first passes through a NOT gate, producing B′.

Therefore, the output of the first gate is:

[A + B']

Step 2: Inversion of Input C

• Input C passes through a NOT gate.

Hence,

[C']

Step 3: Second Logic Gate (AND Gate)

• The output ((A + B')) and (C') are applied to an AND gate.

Output becomes:

​$$[(A + B') \cdot C']$$​​

Step 4: Final Logic Gate (OR Gate)

• The output from the AND gate is ORed with input D.

Thus, the final output expression is:

[(A + B')C' + D]

Final Boolean Expression

​​​$$\boxed{(A + B')C' + D}$$​​