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. Learning Paths
  2. /Computer Science · IGCSE (9–10)
  3. /Boolean Logic
Computer Science
High School (9–10)
Computer Science › Boolean LogicChapter 10

Boolean Logic

A lift door closes only when nobody stands in the doorway and a button is pressed.

  • A car beeps when a door is open or a seat belt is loose.
  • Each rule is a small piece of logic, and a computer makes these decisions with logic gates that work on 0 and 1.
  • You meet the six gates, draw their symbols, and complete truth tables.
  • Then you build circuits of up to three inputs from a problem, an expression or a table, and turn each one into the others.
  • It covers topic 10 of Cambridge IGCSE Computer Science.

Part of Computer Science · IGCSE (9–10) (chapter 10)

StemPy LabStemPy Lab
Log in to save

Following adds this path to your dashboard and enrolls you in the 3 courses you can open, so you can start right away.

Courses in This Path (3)

1.
NOT, AND and OR Gates
A torch shines when its switch is on, and a hand dryer runs when your hands are under it and the power is on. These are decisions with two answers, yes or no, written as 1 and 0. You learn the symbols of the logic gates, and what NOT, AND and OR do with every possible input. Then you join two gates and work out what comes out. It covers the first part of the Boolean logic topic of Cambridge IGCSE Computer Science.
Not started
2.
NAND, NOR and XOR Gates and Truth Tables
A stair light can be switched from the top or the bottom of the stairs, and either switch changes it. That needs a gate that asks whether two inputs are different. You meet NAND, NOR and XOR, the other three gates of the syllabus, and you set out truth tables in the order the examination uses. Then you name an unknown gate from its table. It covers the gates and truth tables of the Boolean logic topic of Cambridge IGCSE Computer Science.
← All Learning Paths
More onComputer Science › Boolean Logic

Computer Science · IGCSE (9–10)

  1. 1Data Representation
  2. 2Data Transmission and Encryption
  3. 3Computer Hardware
  4. 4Software and Programming Languages
  5. 5The Internet and Cyber Security
Not started
3.
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.
Not started
6
Automated and Emerging Technologies
  • 7Algorithms and Problem-Solving
  • 8Programming in Pseudocode and Python
  • 9Databases and SQL
  • 10Boolean LogicYou are here
  • The whole book →
    Computer Science
    Computer Science
    Computer Science