Simplify the Boolean expression, Computer Engineering

Assignment Help:

The Boolean expression A‾.B + A.B‾ + A.B is equivalent to ?

Ans. The Boolean expression A‾ .B + A. B‾+ A.B is equivalent to A + B

(A‾ .B + A. B‾+ A.B = B( A‾ + A) + A. B‾
= B + A. B‾ {Q ( A‾ + A) = 1}
= A + B {Q (B + A.B‾) = B + A}


Related Discussions:- Simplify the Boolean expression

ATM is an example of which topology?, ATM is an example of? ATM is illu...

ATM is an example of? ATM is illustration of Star topology.

Switch statement with the use of nested if-else statement, Compare the use ...

Compare the use of switch statement with the use of nested if-else statement. If-else statement:  When there are many conditional statements that may all evaluate to true, bu

What do you understand by scan codes, Q. What do you understand by Scan Cod...

Q. What do you understand by Scan Codes? A scan code is a code produced by a microprocessor in keyboard when a key is pressed and is unique to key struck. When this code is rec

Find out lowest propagation delay time in logic family, Which the digital l...

Which the digital logic family has the lowest propagation delay time ? Ans. ECL is the digital logic family that has the lowest propagation delay time. In ECL lowest propagati

In which page replacement policies balady’s anomaly occurs, In which page r...

In which page replacement policies Balady’s anomaly occurs? FIFO that is First in First Out.

What is computer, WHAT IS COMPUTER? Computer is termed in the Oxford di...

WHAT IS COMPUTER? Computer is termed in the Oxford dictionary as "An automatic electronic apparatus for making controlling operations or calculations    which are expressible i

What are the digital certificates of hardware computations, What are the Di...

What are the Digital certificates of hardware computations Digital certificates are highly dependent on hardware computations, it is essential that mechanisms are evolved to i

What is a reference string, What is a reference string? An algorithm is...

What is a reference string? An algorithm is evaluated by running it on a exacting string of memory references and computing the number of page faults. The string of memory refe

Explain time complexity in parallel algorithms, Q. Explain Time Complexity ...

Q. Explain Time Complexity in Parallel algorithms? As it takes place nearly everyone who implement algorithms wish to know how much of an individual resource (for example time

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd