Question 84

Computer Awareness Binary Logics Medium

A Boolean function \( xy + xy'z + x'yz' \) is equivalent to

(A) xz + yz'
(B) xy + yz'
(C) x + y + z
(D) xy + xz'
✓ Correct Answer: Option A Verified Solution

📘 Step-by-Step Solution & Detailed Explanation:

After analyzing the expression with a Karnaugh map, we find that splitting the \( xy \) term is beneficial: \[ xy + xy'z + x'yz' \] Expanding and simplifying step by step: \[ xy(1) + xy'z + x'yz' \] \[ xy(z + z') + xy'z + x'yz' \] \[ (xyz + xy'z) + (xyz' + x'yz') \] \[ xz(y + y') + yz'(x + x') \] \[ xz(1) + yz'(1) \] \[ xz + yz' \] Thus, the simplified Boolean expression is: \[ \mathbf{xz + yz'} \]

Practice Similar Binary Logics Questions

Reinforce your conceptual grasp with related questions from CUET-MCA 2021:

Q58 The smallest integer than can be represented by an 8-bit number in 2's...
Solve →
Q82 In the expression \( Y+X \) . ( Y ) , which operator will be evaluated...
Solve →
Q83 Which of the following is false?
Solve →
Q85 Which of the following logic operations is performed by the following...
Solve →
Q86 The output of an AND gate with three inputs ( A, B ) and C is HIGH when
Solve →
Full-Length Test Series

Prepare for CUET-MCA Under Real Exam Conditions

Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.

Start Free Mock Test Series →