 Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2022/digital-systems-linear-algebra-introduction-to-formal-proof/1/a/solution

For bits

a, b

L = (\neg a) \land b, G = a \land (\neg b) .

The two unequal bit pairs activate their respective output; the equal pairs activate neither. In particular, a digital comparator never produces

L = G = 1

 New to topics? Read the docs here!