levo

Boolean Logic

  • 2 subtopics
  • 8 things to know
  • J277/02

What Boolean Logic covers

Boolean Logic is examined in J277/02, Computational thinking, algorithms and programming. It covers logic gates and truth tables and Combining gates in logic diagrams.

Where it is assessed

J277/02

Computational thinking, algorithms and programming, 1 hour 30 minutes and 50% of the GCSE.

Check the OCR specification ↗

The 2 subtopics

Each one has its own page.

What you need to know

Answer each one before you reveal it.

Your recallNot started
Key term

Which gates are needed to build the circuit P = (NOT A) OR (B AND C)?

Key term

What is the output of NOT ((A OR B) AND C) when A = 0, B = 1 and C = 1?

Numbers

In the truth table for P = (A AND B) OR C, how many of the eight rows give P = 1?

Key term

What is a logic gate?

Key term

What does an AND gate do?

Key term

What does an OR gate do?

Key term

Describe what a NOT gate does.

Key term

What is a logic diagram?

Take Boolean Logic further

The same content, four other ways.

Commonly confused

Pairs that lose marks when they are blurred together.

  • AND gate vs OR gate

    AND gate: a component whose output is 1 only when every input is 1. OR gate: a component whose output is 1 when at least one input is 1.

  • Conjunction vs Disjunction

    Conjunction: the logical operation written as AND. Disjunction: the logical operation written as OR.

  • Truth table vs Logic diagram

    Truth table: a grid listing every combination of inputs with the output each gives. Logic diagram: a drawing of connected gate symbols showing how inputs pass to an output.

Questions from this topic

Each one with the model answer underneath.

  1. 1

    What is a logic gate?

    Model answer

    A logic gate is a component that applies a Boolean operation to one or more binary inputs. A gate gives a single output of 1 or 0.

  2. 2

    What does an AND gate do?

    Model answer

    An AND gate outputs 1 only when both of its inputs are 1. Every other combination of inputs gives 0.

  3. 3

    What does an OR gate do?

    Model answer

    An OR gate outputs 1 when at least one of its inputs is 1. The output is 0 only when both inputs are 0.

  4. 4

    Describe what a NOT gate does.

    Model answer

    A NOT gate takes a single input and outputs the opposite value. An input of 1 gives 0, and an input of 0 gives 1.

  5. 5

    How many of the four rows in the truth table for A OR B have an output of 1?

    Model answer

    Three of the four rows output 1. Only the row where A and B are both 0 outputs 0.

  6. 6

    What are conjunction, disjunction and negation?

    Model answer

    Conjunction is another name for AND, and disjunction is another name for OR. Negation is another name for NOT.

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.

Systems Architecture
Memory and Storage
Computer Networks, Connections and Protocols
Network Security

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.

A bit is the unit of data.
smallestlargestmain

Blank Blitz makes facts automatic

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

AThe sum 0 + 0 is 0, and 0 + 1 is 1.
BThe sum 1 + 1 is 0 carry 1.
CThe sum 1 + 1 + 1 is 1 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.

Integer means a whole number with no fractional part.
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.

Boolean Logic revision questions

What does Boolean Logic cover in OCR GCSE Computer Science?
2 subtopics: logic gates and truth tables and combining gates in logic diagrams. Each one has its own page with questions and model answers.
How is Boolean Logic organised?
By the OCR J277 specification, subtopic by subtopic, so it matches the order you are taught it in.

Every question in Boolean Logic, 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.