Register

Made Easy Boolean Algebra,Logic Gates and K-Maps

• retagged by
1,002 views

1 Answer

1 1 vote
x y z f
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 0

f = x’yz’ + x’yz + xy’z’ + xy’z

f = x’y(z + z’) + xy’(z’ + z)

f = x’y + xy’                         (∵ a + a’ = 1)

Voting & Accepting an answer helps improve the community
Answer:
← Previous · Ace Test SeriesNext → · Database ER model
← Previous in category · GO Classes | IIITH P...Next in category → · GO Classes | IIITH P...
Position:
Show:

Related questions

0 0 votes
2 2 answers
883
883 views
vivek1211 asked Nov 18, 2023
883 views
k maps
4 4 votes
6 6 answers
827
827 views
GO Classes asked Jun 3, 2025
827 views
GO Classes DPP | Digital Logic |boolean-algebra| Philadelphia University
The function $\mathbf{F}(\mathbf{A}, \mathbf{B}, \mathbf{C})=\sum(\mathbf{1}, \mathbf{2}, \mathbf{3}, \mathbf{5}, \mathbf{7})$ is equivalent to$\bar{C}+\bar{A} B$$C+A B$$...
8 8 votes
6 6 answers
860
860 views
GO Classes asked May 31, 2025
860 views
GO Classes DPP | Digital Logic | Boolean Algebra | UNC Charlotte
Minimize the below expression$$F(a, b, c, d)=\left(\left(a+b^{\prime}+d^{\prime}\right) \cdot(c+d) \cdot\left(a^{\prime}+c+d\right) \cdot\left(a+b+d^{\prime}\right)\right...