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

2199 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

Why would you use Assembly Language instead of a normal programming language?


Write pseudocode for the binary search algorithm and state, with an explanation, it's worst case complexity in big-O notation


Write a small program, in pseudocode or otherwise, that demonstrates a recursive algorithm. Write a small explanation of how recursion is used in your program.


What is Reverse Polish Notation?


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