A Level Computer Science OCR Practice Exam

De Morgan's Law is a fundamental principle in Boolean algebra that describes how negation interacts with conjunctions (AND) and disjunctions (OR). The correct statement from De Morgan's Law is that the negation of a disjunction is equivalent to the conjunction of the negations. Specifically, it states that ¬(X OR Y) is equivalent to ¬X AND ¬Y. This means that if either X or Y is false, then both ¬X and ¬Y must be true; thus, the negation of the OR operation results in an AND operation.

This law helps in simplifying logical expressions and is particularly useful in various fields, including computer science, mathematics, and digital circuit design.

While the other statements present variations of the laws, they do not reflect the accurate formulations of De Morgan's Laws. Understanding these laws is crucial for translating logical expressions and programming logical conditions effectively.