levo

Boolean Algebra

Logic Gates and Truth Tables

  • 3 things to know
  • Component 01

Overview

Recall questions on truth tables, the AND, OR, NOT, XOR, NAND and NOR gates with their symbols and tables, reading and drawing gate diagrams, writing expressions from circuits, and proving equivalence with a truth table.

What you need to know

Answer each one before you reveal it.

Your recallNot started
Key term

Describe the XOR gate and give its truth table.

Key term

Complete the truth table for Q = A.B + C'.

Key term

How do you use a truth table to prove that two Boolean expressions are equivalent?

Questions from this subtopic

Each one with the model answer underneath.

  1. 1

    What is a truth table, and how many rows does one need?

    Model answer

    A table listing every possible combination of the input values to a logic circuit or expression, with the resulting output for each. Because each input is either 0 or 1, a circuit with n inputs needs 2 to the power n rows: 4 rows for two inputs, 8 for three, 16 for four. The input columns are normally written in ascending binary order so that no combination is missed.

  2. 2

    Describe the AND gate: its symbol, its behaviour and how the operation is written.

    Model answer

    The symbol is a shape with a flat left edge and a semicircular right edge, like a capital D, with the inputs entering on the left and the single output leaving from the curved right side. The output is 1 only when every input is 1, and 0 otherwise. Common ways of writing it are A.B, AB, A AND B and A and B joined by a wedge; several notations are accepted, so use whichever you are comfortable with as long as it is unambiguous.

  3. 3

    Give the truth table for a two-input AND gate.

    Model answer

    With inputs A and B: 0 and 0 give 0; 0 and 1 give 0; 1 and 0 give 0; 1 and 1 give 1. Only the last row produces a 1.

  4. 4

    Describe the OR gate and give its truth table.

    Model answer

    The symbol is a shield or arrowhead shape: a curved left edge that the inputs pass through, with the two upper and lower edges sweeping to a point on the right where the output leaves. The output is 1 when at least one input is 1. Truth table: 0,0 gives 0; 0,1 gives 1; 1,0 gives 1; 1,1 gives 1. It is usually written A+B, A OR B, or with a vee between the terms.

  5. 5

    Describe the NOT gate and give its truth table.

    Model answer

    The symbol is a small triangle pointing right with a circle (a bubble) on its tip, with one input on the left and one output on the right. It inverts its single input: an input of 0 gives an output of 1, and an input of 1 gives an output of 0. It may be written as A with a bar over it, as A', or as a not-sign in front of A - all are accepted.

  6. 6

    Describe the XOR gate and give its truth table.

    Model answer

    The symbol is the OR shape with an additional curved line drawn just outside and parallel to its curved left edge. Exclusive OR gives an output of 1 when the inputs are different and 0 when they are the same. Truth table: 0,0 gives 0; 0,1 gives 1; 1,0 gives 1; 1,1 gives 0. It is written with a plus sign inside a circle, or as A XOR B.

Other ways to work this

The same content, four other ways.

What is inside Levo

Six ways to work the same material.

1Closed book
2Open book
3Closed book

The 3-step method, run for you

Answer cold, learn it, then prove it stuck. Levo tracks the jump between your first attempt and your last.

Processors: Structure, Performance and Types
Input, Output and Storage
Systems Software
Applications Generation

Cram a whole paper in one sitting

Sort every topic into what you know and what you do not, then drill only the weak ones.

If it matches, the search .
succeedsfailsrestarts

Blank Blitz makes facts automatic

Rapid timed gap-fills on the terms and numbers you need to recall without thinking.

A0 + 0 gives 0.
B0 + 1 gives 1.
C1 + 1 gives 0 carry 1.

Build It gets the exam shape right

Assemble a full-mark answer from its marking points, in the order an examiner wants them.

A global variable means a variable reachable from anywhere in the program.
TrueFalse

Test It catches misconceptions

Spot the fault in a statement. The traps are the mistakes students actually make.

721941163128510

Brain Breaks between sessions

Short focus games to reset attention, so the next set lands better than the last.

Every question in Boolean Algebra, on a schedule.

Attempt a question from memory, write the correct version, then attempt it again. Levo records the jump between your first attempt and your last, and brings each question back on the day you are due to forget it.

Or £46 a year, about £3.83 a month. Cancel anytime.