HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Boolean Logic
  2. /Computer Science
  3. /Logic Circuits, Logic Expressions and Truth Tables
Chapter 10 · Part 3 of 3Boolean Logic
← Previous part: NAND, NOR and XOR Gates and Truth Tables
High School (9–10)Computer Science › Boolean LogicFree course

Logic Circuits, Logic Expressions and Truth Tables

A greenhouse fan should switch on when it is hot and the window is shut, or when the air is too damp.

  • A rule like that can be written three ways: as a logic expression, as a circuit of gates and as a truth table.
  • You learn to go from any one of them to the others, for circuits with up to three inputs and one output.
  • It covers the circuits, expressions and truth tables of the Boolean logic topic of Cambridge IGCSE Computer Science.

3 lessons, about 1 h 15 min3 simulations10 problems3 practice questionsPython in every lesson

StemPy LabCreated by StemPy Lab

Free

Every lesson is open to read. Enroll to keep your place in the course. No payment needed.

This course includes

  • 3 lessons, about 1 h 15 min
  • 3 simulations with sliders
  • 3 practice questions with new numbers each time
  • 3 Python programs to run
  • 10 problems with worked solutions
  • 2 Python labs
1 question set
  • 1 revision note
  • 1 test
  • Log in to save

    Course outline (3 lessons)

    1. 1
      Lesson 1about 25 min

      From a logic expression to a circuit and back

      A logic expression and a logic circuit say the same thing in two ways. You learn to draw the circuit for an expression, one gate for each operator, exactly as it is written. Then you read a circuit back into an expression, starting from the output.

      1 simulation1 practice question1 Python program3 problems
      Read the lesson
    2. 2
      Lesson 2about 25 min

      Truth tables for three inputs

      With three inputs a truth table has eight rows. You fill them in binary order, add working columns for the gates inside the circuit, and check the output column. This is the most common logic question on the examination paper.

      1 simulation1 practice question1 Python program3 problems1 Python lab
      Read the lesson
    3. 3
      Lesson 3about 25 min

      From a problem statement or a truth table to a circuit

      A problem in words can be turned into a logic expression, a circuit and a truth table. You learn which words point to which gate and how to place the brackets. Then you write an expression from a truth table, with one AND term for each row whose output is 1.

      1 simulation1 practice question1 Python program4 problems1 Python lab1 question set1 note
      Read the lesson

    Test Your Learning

    Logic Circuits and Truth Tables: Chapter Test
    IGCSE format20 questions · 25 min
    Not started

    Your teacher

    StemPy LabStemPy Lab

    1 follower

    Loading…

    ← All Courses
    ← NAND, NOR and XOR Gates and Truth TablesNext →
    More onComputer Science › Boolean Logic

    Discussion (0)

    Log in to join the discussion.

    Loading…