praxis.ibLog in
A1.2 Data representation and computer logicA1.2.4

Construct and analyse truth tables

Construct and analyse truth tables

SL + HL≈ 55 minCommand term: ConstructPremium

In this lesson

  • Construct truth tables to predict the output of a circuit, a Boolean expression or a problem description
  • Relate a truth table to the Boolean expression it represents
  • Simplify expressions with Karnaugh maps and with the laws of Boolean algebra

This lesson is part of Premium

Every topic has one free lesson. Premium unlocks every interactive lesson, the exam-style questions at the end of each one, and the rest of Praxis IB.

Log in or sign upTry the free lesson: A1.2.1 Principal methods of representing data

What's inside

  1. LearnBuilding a truth table
  2. PracticeComplete the table: Q = (A AND B) OR NOT C
  3. PracticeFrom a logic diagram
  4. LearnFrom a problem description
  5. PracticeComplete the sprinkler table
  6. LearnTruth tables and Boolean expressions
  7. CheckQuick check
  8. LearnKarnaugh maps
  9. MethodSimplifying with a K-map
  10. LabBoolean expression lab
  11. ReferenceLaws of Boolean algebra
  12. MethodSimplifying with algebra
  13. CheckOrder the steps
  14. ReviewMistakes examiners see
  15. Exam practiceExam-style questions

Ends with 5 exam-style questions worth 15 marks, with a self-marking markscheme.