search
Log In

Recent questions tagged boolean-algebra

3 votes
10 answers
3
1 vote
5 answers
4
0 votes
1 answer
5
If $B$ is a Boolean algebra, then which of the following is true? $B$ is a finite but not complemented lattice $B$ is a finite, complemented and distributive lattice $B$ is a finite,distributive but not complemented lattice $B$ is not distributive lattice
asked Mar 30 in Set Theory & Algebra Lakshman Patel RJIT 77 views
0 votes
2 answers
6
1 vote
3 answers
7
5 votes
4 answers
8
The value of the Boolean expression (with usual definitions) $(A’BC’)’ +(AB’C)’$ is $0$ $1$ $A$ $BC$
asked Sep 18, 2019 in Digital Logic gatecse 362 views
4 votes
3 answers
9
What is the time complexity for checking whether an assignment of truth values to variables $x_1,\dots ,x_n$ satisfies a given formula $f(x_1\dots,x_n)$? $O(2^n)$ $O(g(n))$ where $g$ is a polynomial $O(log(n))$ None of the above
asked May 15, 2019 in Digital Logic val_pro20 486 views
2 votes
1 answer
10
$(a) A = 101010$ and $B = 011101$ are $1’s$ complement numbers. Perform the following operations and indicate whether overflow occurs. $(i) A + B$ $(ii) A − B$ $(b)$ Repeat part $(a)$ assuming the numbers are $2’s$ complement numbers.
asked May 11, 2019 in Digital Logic val_pro20 354 views
2 votes
4 answers
11
Simplify the following expression AB’C + A’BC + A’B’C Solution given is A’C + B’C can someone show me how?
asked May 2, 2019 in Digital Logic vupadhayayx86 350 views
3 votes
3 answers
12
f(A,B,C,D)=∏M(0,1,3,4,5,7,9,11,12,13,14,15) is a max-term representation of a Boolean function f(A,B,C,D) where A is the MSB and D is the LSB. The equivalent minimized representation of this function is (A+C¯+D)(A¯+B+D)(A+C¯+D)(A¯+B+D) AC¯D+A¯BD+A¯BC A¯CD¯+AB¯CD¯+AB¯C¯D¯ (B+C¯+D)(A+B¯+C¯+D)(A¯+B+C+D)
asked Apr 18, 2019 in Digital Logic KULDEEP SINGH 2 2k views
0 votes
1 answer
16
Simplify the Following boolean function by means of the tabulation method. (a) P(A,B,C,D,E,F,G)=$\sum(20,28,52,60)$ (b) P(A,B,C,D,E,F,G)= $\sum(20,28,38,39,52,60,102,103,127)$ (C) P(A,B,C,D,E,F) = $\sum(6,9,13,18,19,25,27,29,41,45,57,61)$
asked Apr 2, 2019 in Digital Logic ajaysoni1924 429 views
2 votes
1 answer
17
Implement the following boolean function F together with the don’t-care conditions d using no more than two NOR gates. Assume both normal and the compliment inputs are available. F(A,B,C,D) = $\sum(0,1,2,9,11) $ $d(A,B,C,D) = \sum(8,10,14,15)$
asked Apr 2, 2019 in Digital Logic ajaysoni1924 286 views
0 votes
1 answer
18
A logic circuit implements the following Boolean function: F = A’C + AC’D’ it is found that the circuit input combination A=C=1 can never occur. Find a simpler expression for F using the proper don't-care conditions.
asked Apr 2, 2019 in Digital Logic ajaysoni1924 463 views
0 votes
0 answers
19
Simplify the boolean function F together with the don’t care conditions d in (1) sum of products and (2)product of sums. (A) $F(w,x,y,z) = \sum(0,1,2,3,7,8,10)$ $d(w,x,y,z) = \sum(5,6,11,15)$ (b) $F(A,B,C,D) = \sum (3,4,13,15)$ $d(A,B,C,D) =\sum(1,2,5,6,8,10,12,14)$
asked Apr 2, 2019 in Digital Logic ajaysoni1924 147 views
0 votes
0 answers
20
Simplify the following boolean function F together with the don’t care condition d; then express the simplified function in the sum of minterms. (a)$F(x,y,z)=\sum(0,1,2,4,5) $ $d(x,y,z)= \sum(3,6,7)$ (b) $F(A,B,C,D) = \sum(0,6,8,13,14)$ $d(A,B,C,D) = \sum(2,4,10)$ (C) $F(A,B,C,D) = \sum(1,3,5,7,9,15)$ $d(A,B,C,D)= \sum(4,6,12,13)$
asked Apr 2, 2019 in Digital Logic ajaysoni1924 115 views
0 votes
0 answers
21
List the Eight degenerate 2 level forms and show that they reduce to the single operation. Explain how the degenerate two-level forms can be used to extend the number of inputs to a gate.
asked Apr 2, 2019 in Digital Logic ajaysoni1924 82 views
0 votes
0 answers
22
...