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 →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental 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. Python Labs
  2. /A truth table maker
MathematicsEasyHigh School (11–12)Mathematical Reasoning

A truth table maker

You will write three small functions that build a truth table for any statement. A statement is a Python function such as lambda p, q: p and not q.

The idea. Each simple statement is True or False. With nnn statements there are 2n2^n2n rows, and itertools.product([True, False], repeat=n) lists them in the usual order.

Your tasks.

  1. Finish rows(n). Return the list of all rows for n statements.
  2. Finish column(f, n). Return the list of values of f, one for each row.
  3. Finish count_true(f, n). Return how many rows make f true.

Run it first, just as it is. The checker at the end prints FAIL for each task. Then do the tasks one at a time, and run the program again after each one. A Hint appears under every check that still fails.

When every line says PASS, count the rows in which lambda p, q, r: (p or q) and not r is true. Check your count by hand.

StemPy LabContributed by StemPy Lab
python
Loading Python runtime…

A worked solution

Run your code once to unlock the worked solution.

Have you tried it?

Do the tasks in the editor first, and run the checker after each one. Its hints help when a check fails. When you are ready, compare your code with this solution.

Log in to save
← All Labs
← Tracking an aircraftA tester for laws and circuits →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Connectives and truth tablesStatements, Connectives and Truth Tables

More labs on this topic

  1. A counterexample hunterEasy
  2. An argument checkerEasy
  3. A checker for for-all and there-existsEasy
  4. Four related conditionalsEasy
  5. A tester for laws and circuits
Easy
All labs on this topic →