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. /A student must draw the circuit for X = NOT ((A AND B) OR C)…
HardComputer ScienceHigh School (9–10)Computer Science › Boolean LogicConceptualNumericalIGCSE

A student must draw the circuit for X = NOT ((A AND B) OR C)…

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.

A student must draw the circuit for X = NOT ((A AND B) OR C). The student notices that an OR gate followed by a NOT gate is a NOR gate, and draws only two gates: an AND gate and a NOR gate.

  1. How many gates should the circuit have if it is drawn exactly as the expression is written?
  1. In how many of the 8 rows is X = 1?
  1. Is the student's circuit allowed in the examination? Give 1 for yes and 0 for no.

Check your answer

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

Need a reminder? The key ideaShowHide

A logic expression and a logic circuit say the same thing. Draw one gate for each operator (NOT included), brackets first, the last operator as the output gate, exactly as written and without simplification. Every gate except NOT has two inputs. Read a circuit from the output back to the inputs.

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 gates. AND, OR and NOT: 333 gates.

Step 2. The rows. X = 1 when (A AND B) OR C is 0. That needs C = 0, and A and B not both 1. The rows are 0 0 0, 0 1 0 and 1 0 0: 333 rows.

Step 3. The student's circuit. It gives the same outputs, but the syllabus says circuits must be drawn for the statement given, without simplification. So it is not allowed: 000.

Watch out. Draw what the question gives. Simplify only when the question asks you to.

Answer: (a) 333. (b) 333. (c) 000.

Log in to save this for later
← All Problems
← Mo copies a circuit from a textbook page and describes it in words: A goes into a NOT gate; B and C…A garage door opens only if the master switch A is on and at least one of two remote controls, B or… →
More onComputer Science › Boolean Logic

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. From a logic expression to a circuit and backLogic 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 →