Prove the equations using the boolean algebraic theorems, Computer Engineering

Assignment Help:

Prove the equations A + A‾ .B + A.B‾ = A + B using the Boolean algebraic theorems ?

Ans.
The equation is A + A‾.B + A.B‾ = A + B
L.H.S. = A + A‾ .B + A.B‾
= (A + A.B‾) + A‾.B
= A (1+ B‾) + A‾.B
= A + A‾ .B (? 1+B‾ =1)
= (A +A‾ ) (A + B)
= (A + B) (? A + A‾ = 1)
= R.H.S
Thus Proved

Related Discussions:- Prove the equations using the boolean algebraic theorems

Explain about microsoft access, Microsoft access name has been transformed ...

Microsoft access name has been transformed to Microsoft office access. This software incorporates relational database management system which joins GUI (graphical user interface) w

Explain the numbering plan for isdn address structure, Explain the numberin...

Explain the numbering plan for ISDN address structure. The numbering plan for ISDN is evolved with using the following guidelines: 1. This is based on, and is an improvemen

Virtual memory, examples of virtual memory

examples of virtual memory

Define range which a normalised mantissa can signify, Now let's define rang...

Now let's define range which a normalised mantissa can signify. Let's presume that our present representations has normalised mantissa so left most bit can't be zero so it has to b

Example application - canonical genetic algorithm, Example Application: ...

Example Application: There are many fantastic applications of genetic algorithms. Conceivably my favorite is their usage in evaluating Jazz melodies done as part of a PhD proj

Shm, composition of two shm in right angles to each other to havingg time p...

composition of two shm in right angles to each other to havingg time period in the ratio 1:2

Define class p, Define class P The class of all sets L that can be kno...

Define class P The class of all sets L that can be known in polynomial time by deterministic TM. The class of all decision problems that can be decided in polynomial time.

First-order inference rules - artificial intelligence, First-Order Inferenc...

First-Order Inference Rules -artificial intelligence: Now we have a perfect definition of a first-order model is,in the same way, we may define soundness for first-order infere

Define variants of turing machine, Define variants of Turing Machine? ...

Define variants of Turing Machine? Variants are Non deterministic turing machine. Mutlitape turing machine. Enumerators

What are condition codes, What are condition codes? In many processors,...

What are condition codes? In many processors, the condition code flags are kept in the processor status register. They are either set are cleared by lots of instructions, so th

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages