Question 3119 – Environment
March 31, 2024Question 4274 – UGC NET CS 2005 june-paper-2
March 31, 2024Question 4271 – UGC NET CS 2005 june-paper-2
The logic expression x’yz’+x’yz+xyz’+xyz reduces to :
Correct Answer: C
Question 7 Explanation:
We can use two methods to solve this problem.
Method-1 using K-Maps:
Method-2 using boolean simplification:
x’yz’+x’yz+xyz’+xyz
= x’y(z’+z)+xy(z’+z)
= x’y + xy
= y(x’+x)
= y
Method-1 using K-Maps:
Method-2 using boolean simplification:
x’yz’+x’yz+xyz’+xyz
= x’y(z’+z)+xy(z’+z)
= x’y + xy
= y(x’+x)
= y
x’z
xyz
y
yz
Subscribe
Login
0 Comments