Combining Boolean Operators (Edexcel GCSE Computer Science)

Revision Note

James Woodhouse

Expertise

Computer Science

Combining Boolean Operators

  • Boolean operators can be combined to produce more complex expressions

  • The combination of two or more Boolean operators forms a logic expression

  • Brackets are used to clarify the order of operations

  • A logic diagram is a visual representation of combinations of Boolean operators within a logic circuit

  • An example would be Q = NOT(A OR B)

logic circuit1
  • In the diagram above, the inputs are represented by A and B

  • P is the output of the OR gate on the left and becomes the input of the NOT gate

  • Q is the final output of the logic circuit

  • This is a logic diagram for the Boolean expression Q = NOT(A OR B)

Exam Tip

You may be asked to draw a logic circuit from a logic statement or a Boolean expression OR write the logical expression that is expressed in the logic diagram

Logic circuits will be limited to a maximum of three inputs and one output

Example of combining Boolean operators

10-boolean-logic
  • P = (A OR B) AND NOT C

You've read 0 of your 0 free revision notes

Get unlimited access

to absolutely everything:

  • Downloadable PDFs
  • Unlimited Revision Notes
  • Topic Questions
  • Past Papers
  • Model Answers
  • Videos (Maths and Science)

Join the 100,000+ Students that ❤️ Save My Exams

the (exam) results speak for themselves:

Did this page help you?

James Woodhouse

Author: James Woodhouse

James graduated from the University of Sunderland with a degree in ICT and Computing education. He has over 14 years of experience both teaching and leading in Computer Science, specialising in teaching GCSE and A-level. James has held various leadership roles, including Head of Computer Science and coordinator positions for Key Stage 3 and Key Stage 4. James has a keen interest in networking security and technologies aimed at preventing security breaches.