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. Problems
  2. /An irrigation valve opens on the rule X = (A XOR B) OR (NOT C), where C = 1 means it is raining…
MediumComputer ScienceHigh School (9–10)Computer Science › Boolean LogicConceptualNumericalIGCSE

An irrigation valve opens on the rule X = (A XOR B) OR (NOT C), where C = 1 means it is raining…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

An irrigation valve opens on the rule X = (A XOR B) OR (NOT C), where C = 1 means it is raining.

  1. Lay out the eight patterns with columns for P = A XOR B and Q = NOT C, and count how often the valve opens.
  1. Give X when every input is 1.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

Three inputs give 8 rows, from 0 0 0 to 1 1 1 in binary order. Add a working column for each inner gate, then the output column. Check a row or two by hand.

The worked solution

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Step 1. The table.

A B CP QX
0 0 00 11
0 0 10 00
0 1 01 11
0 1 11 01
1 0 01 11
1 0 11 01
1 1 00 11
1 1 10 00

Step 2. Count. The 4 rows with C = 0 give 1. Of the rows with C = 1, two have A different from B. That is 666 rows.

Step 3. All inputs 1. P = 1 XOR 1 = 0 and Q = 0, so X = 000.

Answer: (a) 666. (b) 000.

Log in to save this for later
← All Problems
← A garage door opens only if the master switch A is on and at least one of two remote controls, B or…A traffic-light controller contains the circuit drawn below… →
More onComputer Science › Boolean Logic

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Truth tables for three inputsLogic Circuits, Logic Expressions and Truth Tables

More on this topic

  1. A truth table with inputs A, B and C has the output column 0, 1, 0, 1, 0, 1, 0, 0 in the usual row…Hard
  2. A water heater has a safety cut-out. The cut-out switches the heater off (X = 1) when the water is…Hard
  3. A logic analyser records X for every input pattern of A, B and C, from 0 0 0 up to 1 1 1: 0, 0, 0…Medium
A lift moves (X = 1) when its door is shut (S = 1) and a button is pressed…Easy
  • A traffic-light controller contains the circuit drawn below…Hard
  • All problems on this topic →