Boolean LogicDiagram

Expression Evaluation Example: NOT(A) AND (B OR C)

Part of Boolean ExpressionsGCSE Computer Science

This diagram covers Expression Evaluation Example: NOT(A) AND (B OR C) within Boolean Expressions for GCSE Computer Science. Revise Boolean Expressions in Boolean Logic for GCSE Computer Science with 15 exam-style questions and 22 flashcards. This topic appears less often, but it can still be a useful differentiator on mixed-topic papers. It is section 8 of 11 in this topic. Focus on the labels, the relationships between parts, and the explanation that turns the diagram into an exam-ready answer.

Topic position

Section 8 of 11

Practice

15 questions

Recall

22 flashcards

Expression Evaluation Example: NOT(A) AND (B OR C)

Given: A=1, B=0, C=1 Step 1: NOT(A) = NOT(1) = 0 Step 2: B OR C = 0 OR 1 = 1 Step 3: 0 AND 1 = 0 Final Answer: NOT(A) AND (B OR C) = 0
Always work inside brackets first, then apply NOT, then AND/OR

Keep building this topic

Read this section alongside the surrounding pages in Boolean Expressions. That gives you the full topic sequence instead of a single isolated revision point.

Practice Questions for Boolean Expressions

Which Boolean operator produces an output of 1 only when BOTH inputs are 1?

  • A. NOT
  • B. OR
  • C. AND
  • D. XOR
1 markfoundation

State De Morgan's first law and give an example to illustrate it.

2 marksstandard

Quick Recall Flashcards

Want to test your knowledge?

PrepWise has 15 exam-style questions and 22 flashcards for Boolean Expressions — with adaptive difficulty and instant feedback.

Join Alpha