Simplify the boolean expression ¬(A.B)+A.

¬(A.B)+A -- given in question. =(¬A+¬B)+A -- using De Morgan's Law. =¬A+¬B+A -- can remove the brackets. =1+¬B -- using identity ¬A+A = 1.=1 -- using identity 1 + anything = 1.

Answered by Computing tutor

1778 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

Describe two's complement.


A common construct found in many algorithms is a loop. Using pseudocode, write a pre-condition loop to output all of the even numbers between 99 and 201.


Explain a bubble sort. You may use pseudocode and/or diagrams to help demonstrate your answer.


What are the benefits of Reverse Polish Notation and what is it?


We're here to help

contact us iconContact ustelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

MyTutor is part of the IXL family of brands:

© 2025 by IXL Learning