Answers>Computing>A Level>Article

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

2389 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

Define resolution in regards to images and how it differs from colour depth

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.

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

Related Computing A Level answers

Define resolution in regards to images and how it differs from colour depth

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.

One member of a chess club sends a text file saved in Unicode. What meant by the term "Unicode" and why might this be necessary?

What is the time complexity of Bubble Sort?