Test your knowledge with free interactive questions on Seneca — used by over 10 million students.

Evaluating Expressions

Logic gates can be combined to form logic circuits that process complex logical statements such as A AND (B OR C).

Evaluating boolean expressions

Evaluating boolean expressions

  • To evaluate a boolean expression, you should substitute all of the values in for the variables and then use the definitions of the different boolean functions to simplify it one step at a time.
Order of evaluation

Order of evaluation

  • You should evaluate any expression in brackets first, for example:
    • NOT(True OR False).
    • NOT(True).
    • False.
Truth tables

Truth tables

  • Another method of evaluating an expression is using a truth table.
  • A truth table shows every possible combination of inputs and the resulting output.
  • The truth table shows the input and output state for each combination.
  • The table can then be used to look up the output.
Jump to other topics
1

Computer Systems

1.1

Systems Architecture

1.2

Memory & Storage

1.3

Computer Networks, Connections & Protocols

1.4

Network Security

1.5

Systems Software

1.6

Ethical, Legal, Cultural & Environmental Concern

2

Computational Thinking, Algorithms & Programming

2.1

Algorithms

2.2

Programming Fundamentals

2.3

Producing Robust Programs

2.4

Boolean Logic

2.5

Programming Languages & IDEs

Practice questions on Boolean Logic

Can you answer these? Test yourself with free interactive practice on Seneca — used by over 10 million students.

  1. 1
  2. 2
  3. 3
  4. 4
Answer all questions on Boolean Logic

Unlock your full potential with Seneca Premium

  • Unlimited access to 10,000+ open-ended exam questions

  • Mini-mock exams based on your study history

  • Unlock 800+ premium courses & e-books

Get started with Seneca Premium