Simplify the following Boolean function in sum of minterm:
F(A, B, C, D) = Σ(0, 6, 8, 13, 14)
d (A, B, C, D) = Σ(2, 4, 10)
where, d stands for don't care condition
A = a1a0 and B = b1b0 are two 2-bit unsigned binary numbers. If F(a1, a0, b1, b0) is a Boolean function such that F = 1 only when A > B, and F = 0 otherwise, then F can be minimized to the form ______
1 Crore+ students have signed up on EduRev. Have you? Download the App |
How many different Boolean functions of n variables are there?
Which of the following is equivalent to the Boolean function X + XY?
The equivalence of given expression x + x'y with Boolean theorem is ____.
6 videos|76 docs|52 tests
|
6 videos|76 docs|52 tests
|