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

2044 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

Explain how a stack could be used in the process of evaluating an expression in Reverse Polish notation.


What are the benefits of using thin clients.


Some problems are intractable. What does it mean for a problem to be described as intractable?


What is the difference between a high level language and a low level language?


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:

© 2026 by IXL Learning