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.
Related Computing A Level answers
All answers ▸What are higher order functions in functional programming? How does the 'map' function work and why is it a higher order function?
Give two types of management of either hardware or other resources that are performed by an operating system.
How do I solve a Karnaugh Map?
What is the range of denary numbers that can be represented using 8-bit two’s complement binary integers?