This is definitely a homework question (I'm working on it right now) so I think it's best that you answer this yourself. :)
Construct circuit for Boolean expression (Mention out put at each step) (PÚ~ Q) Ù (P Ú Q)
That is correct. Any processor worth it's salt will, when evaluating an expression like "1 and 0 and 1 and 1 and 0" will get as far as the first zero and "realize" that full expression will result in false regardless of the rest.
A boolean expression.
A boolean is an expression obtained in relational operators.
In C, any non-zero expression is true and any zero expression is false.
FALSE.... cuz in && operator the compiler chk both of the expression if any of the expression is false then answer will be false.. for true result both of d expression must be true... by warrior2pnk
In a boolean algebraic expression if the ^ is replaced by v and v replaced by ^ then that becomes dual of that boolean expression.
Construct circuit for Boolean expression (Mention out put at each step) (PÚ~ Q) Ù (P Ú Q)
need help to simplify boolean expression
Boolean expression
demorganization is used to reduce the Boolean expressions
That is correct. Any processor worth it's salt will, when evaluating an expression like "1 and 0 and 1 and 1 and 0" will get as far as the first zero and "realize" that full expression will result in false regardless of the rest.
Through Boolean algebra simplification, a Boolean expression is translated to another form with less number of terms and operations. A logic circuit for the simplified Boolean expression performs the identical function with fewer logic components as compared to its original form.
a ⊕ b = ab' + a'b
(a'b+b'a)'
A boolean expression.
A boolean is an expression obtained in relational operators.