- Computer Science Engineering (CSE)
- Digital Electronics and Logic Design
- The simplified form of the Boolean expre...

Q. |
## The simplified form of the Boolean expression (X+Y+XY)(X+Z) is |

A. | x + y + zx + y |

B. | xy – yz |

C. | x + yz |

D. | xz + y |

Answer» C. x + yz |

View all MCQs in:
Digital Electronics and Logic Design

- When simplified with Boolean Algebra (x + y)(x + z) simplifies to
- Write the expression for Boolean function F (A, B, C) = m (1,4,5,6,7) in standard POS form.
- The simplification of the Boolean expression (A'BC')'+ (AB'C)' is
- The Boolean expression A.B+ A.B+ A.B is equivalent to
- Simplify the Boolean expression F = C(B + C)(A + B + C).
- the boolean expression AB'CD'is
- The boolean expression X = AB + CD represents
- The implementation of simplified sum-of-products expressions may be easily implemented into actual logic circuits using all universal gates with little or no increase in circuit complexity. (Select the response for the blank space that will BEST make the statement true.)
- The absorption law in Boolean algebra say that
- Which one of the following is NOT a valid rule of Boolean algebra?

Login to Continue

It will take less than 2 minutes

Report MCQ