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

Capacity and performance of storage - computer architecture, Capacity: ...

Capacity: Raw capacity Total amount of stored information that a medium or storage device can hold is expressed as a quantity of bytes and bits (for example 10.4 megabyte

Challenges in changing information technology, Q: Challenges and Prospects ...

Q: Challenges and Prospects in Changing Information Technology? There is no doubt that information technology has made significant progress during the past two decades. Modern

Explain vector processing with pipelining, Vector Processing with Pipelinin...

Vector Processing with Pipelining Because in vector processing vector instructions execute the similar computation on various data operands repeatedly, vector processing is the

Mips assembly language equivalents , MIPS' native assembly code only has tw...

MIPS' native assembly code only has two branch instructions, beq and bne, and only one comparison instruction, slt. Using just these three instructions (along with the ori instruct

Software project planning, Software Project Planning In the previous da...

Software Project Planning In the previous days of computing software costs comprised a small % of overall computer based system cost. In order of magnitude error software cost

Explain about the flash memories, Explain about the Flash memories Thes...

Explain about the Flash memories These are re-writable non-volatile memories evolved from EEPROM; they are generally connected to the USB port on the computer enabling a user t

Example of unification, Example of Unification: Let now here, assume i...

Example of Unification: Let now here, assume instead that we had these two sentences as: knows(john,X) → hates(john, X) knows(jack, mary) Thus here the predicate n

Explain bitwise-and operator, Bitwise-AND Operator: & AND-expression : ...

Bitwise-AND Operator: & AND-expression : relational-expression AND-expression & equality-expression The bitwise-AND operator (&) compares each bit of its first operand t

Explain the do while loops, Explain The do while loops The do while loo...

Explain The do while loops The do while loops is similar, but the test occurs after the loop body is executed. This ensures that the loop body is run at least once.

Message passing programme development environment, In a multicomputer syste...

In a multicomputer system the computational load amid different processors should be balanced. To pass information between different nodes message passing technique is used. The p

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages