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

1878 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

What is the main difference between the Stack and the Queue abstract data types?

Express the number 208 as a) an 8-bit binary number b) an octal string c) a hexadecimal string

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

Write a function in pseudocode that determines if a given string is a palindrome

Popular Requests

Maths tutor Chemistry tutor Physics tutor Biology tutor English tutor GCSE tutors A level tutors IB tutors Physics & Maths tutors Chemistry & Maths tutors GCSE Maths tutors

CLICK CEOP

Internet Safety

Payment Security

Cyber

Essentials

MyTutor is part of the IXL family of brands:

IXL

Comprehensive K-12 personalized learning

Rosetta Stone

Immersive learning for 25 languages

Wyzant

Trusted tutors for 300 subjects

Education.com

35,000 worksheets, games, and lesson plans

Vocabulary.com

Adaptive learning for English vocabulary

Emmersion

Fast and accurate language certification

Thesaurus.com

Essential reference for synonyms and antonyms

Dictionary.com

Comprehensive resource for word definitions and usage

SpanishDictionary.com

Spanish-English dictionary, translator, and learning resources

FrenchDictionary.com

French-English dictionary, translator, and learning

Ingles.com

Diccionario ingles-espanol, traductor y sitio de apremdizaje

ABCya

Fun educational games for kids