In Boolean algebra, what is the simplified equivalent of the expression NOT(A AND B) according to De Morgan's laws?
Answer and explanation
Correct answer: A. NOT A OR NOT B
- Step 1: State De Morgan's first theorem: the negation of a conjunction is equivalent to the disjunction of the negations.
- Step 2: , which is `NOT A OR NOT B`.
Answer
NOT A OR NOT B.
Why not the others: `NOT A AND NOT B` is De Morgan's second law for ; `A OR B` drops negations; `A AND NOT B` is not equivalent.
Practise more Computer Systems, Networks and Cybersecurity.
Free questions with an explanation for every one, and full timed EmSAT Achieve (UAE) mock tests.
More Computer Systems, Networks and Cybersecurity questions
- What is the decimal equivalent of the hexadecimal number 2F₁₆?
- In computer architecture, which component of the central processing unit (CPU) directs system operations and manages the fetch-decode-execut…
- Which layer of the OSI reference model is responsible for end-to-end process-to-process communication, flow control, and error recovery usin…
- What is the 8-bit two's complement binary representation of the decimal integer -6?
- Which cryptographic algorithm is an asymmetric (public-key) cipher commonly used for secure key exchange and digital signatures?
- How many total usable host IP addresses are available in an IPv4 subnet configured with the subnet mask /28 (255.255.255.240)?