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

Explain formats supported in linux for executable programs, Explain Formats...

Explain Formats supported in Linux for executable programs. Linux supports two formats for executable programs: a. Out-binary format b. ELF - dynamic libraries

What is uml architecture, Takes care structural and behavioural aspect of a...

Takes care structural and behavioural aspect of a software system. Contains software usage, functionality, performance, economic, reuse, and technology constraints.

objectives- parallel computing, Objectives After going through this un...

Objectives After going through this unit, you will be able to : Tell historical facts of parallel computing; Can explain the essential concepts of the discipline, e.g.

Datastructure, deque insertion and deletion ..

deque insertion and deletion ..

By which analog signal combine with a carrier frequency, Analog signals can...

Analog signals can be              by combining them with a carrier frequency (A)  Carried                                      (B)  Transported (C)  Multiplexed

Explain about the term middleware, Explain about the term Middleware. M...

Explain about the term Middleware. Middleware is the term frequently used to explain the application or business logic present within an application server. Unfortunately, simi

Compare single bus structure and multiple bus structure, Compare single bus...

Compare single bus structure and multiple bus structure? A system that having only one bus(i.e only one transfer at a time) is known as a single bus structure. A system is know

Predicates - first-order logic, Predicates - first-order logic: First ...

Predicates - first-order logic: First and foremost in first-order logic sentences, because predicates. Hence the indications of that some things are related in some way. So af

Implementation of 4-to-1 multiplexer, Implement the Y(A, B, C) = ∑(2,3,5,6)...

Implement the Y(A, B, C) = ∑(2,3,5,6) function using 4-to-1 multiplexer.   Ans. Y(A,B,C)=∑(2,3,5,6) Here we take B,C as the select bits also A as input. To select the input we can

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