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

Design issues related to interrupt-driven input - output, Q. Design issues ...

Q. Design issues related to interrupt-driven Input - output? So interrupt handling includes interruption of currently executing program, execution of interrupt servicing progra

Explain non-pre-emptive algorithms, Explain non-pre-emptive algorithms? ...

Explain non-pre-emptive algorithms? Non preemptive algorithms: In this algorithm a job is provided to CPU for execution as long as the job is non-completed the CPU cannot

Cache memories - computer architecture, Cache Memories - computer architect...

Cache Memories - computer architecture: Speed of the primary memory is very low in comparison with the speed of processor For well performance, the processor can't spend

Parallelism conditions, Parallelism Conditions As discussed earlier, pa...

Parallelism Conditions As discussed earlier, parallel computing needs that the segments to be implemented in parallel must be free of each other. Thus, before implementing para

Implementing protection with virtual memory, Implementing Protection with V...

Implementing Protection with Virtual Memory - computer architecture: To enable the operating system to implement protection in the VM system, the HW have to: I. Support at

Adding layers to the timeline, ADDING LAYERS TO THE TIMELINE AND GIVING MOT...

ADDING LAYERS TO THE TIMELINE AND GIVING MOTION TO THE LAYER Step 1: Choose Layer from Common toolbar after that draw a layer. Step 2: Write the text inside Layer. Step

Explain pre-emptive scheduling, Explain Pre-emptive scheduling? Pre-em...

Explain Pre-emptive scheduling? Pre-emptive scheduling: in its approach, center processing unit can be taken away from a process if there is a require while in a non-pre-empt

Describe target processor arrangements, Q. Describe target processor arrang...

Q. Describe target processor arrangements? Having seen how to describe one or more target processor arrangements we need to initiate mechanisms for distributing data arrays ove

What is ale and explain the functions of ale in 8085, ALE-> Address latch e...

ALE-> Address latch enable...In the case of microcontroller (8051)& microprocessor 8085 the data line and low order 8 bit address lines are multiplexed. In order to getting address

Explain the working of broad band isdn, Explain the working of broad band I...

Explain the working of broad band ISDN. BISDN Configuration: Figure shows how access to the BISDN network is accomplished. All peripheral devices are interfaced to the acces

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages