UGC NET CS 2016 July- paper-2
March 14, 2024UGC NET CS 2016 July- paper-2
March 14, 2024UGC NET CS 2016 July- paper-2
|
Question 8
|
Simplified Boolean equation for the following truth table is:
|
F = yz’ + y’z
|
|
|
F = xy’ + x’y
|
|
|
F = x’z + xz’
|
|
|
F = x’z + xz’ + xyz
|
Question 8 Explanation:
Method-1: Using K-Map
Method-2: Using boolean simplification
= x’y’z+x’yz+xy’z’+xyz’
= x’z(y’+y)+ xz'(y’+y)
= x’z+xz’ (Since y’+y=1)
Method-2: Using boolean simplification
= x’y’z+x’yz+xy’z’+xyz’
= x’z(y’+y)+ xz'(y’+y)
= x’z+xz’ (Since y’+y=1)
Correct Answer: C
Question 8 Explanation:
Method-1: Using K-Map
Method-2: Using boolean simplification
= x’y’z+x’yz+xy’z’+xyz’
= x’z(y’+y)+ xz'(y’+y)
= x’z+xz’ (Since y’+y=1)
Method-2: Using boolean simplification
= x’y’z+x’yz+xy’z’+xyz’
= x’z(y’+y)+ xz'(y’+y)
= x’z+xz’ (Since y’+y=1)
Subscribe
Login
0 Comments