Business and technology qualifications, Levels 3-6, in Brussels. Explore qualifications
Portal login
Level 4 Diploma in Cyber Security

Propositional logic: Boolean operators and truth tables

CYB402 · Mathematics for Computer Science — Week 3 of 16

CourseCYB402
Week3 of 16
SemesterI
TutorOnline in the course chat

This week’s topics

Propositional logic: Boolean operators and truth tables

  1. The key principles of (Boolean) propositional logic
  2. Truth tables to detail the possible outcomes of binary logical operators

What you will be able to do

  • 2.3 Explain the key principles of (Boolean) propositional logic.
  • 2.4 Use truth tables to detail the possible outcomes of binary logical operators.

Activity

Start with this week’s 4 videos, then: Seminar, guided reading and a short written task: explain the key principles of (Boolean) propositional logic.

Study materials

Videos

  • Truth tables · Oak National Academy, Key Stage 4 (GCSE level) · for registered students
  • Logic statements and expressions · Oak National Academy, Key Stage 4 (GCSE level) · for registered students
  • LOGIC GATES, Truth tables, Boolean Algebra, AND, OR, NOT, NAND & NOR gates · YouTube · ADTW Study · 12 min · for registered students
  • Boolean Logic & Logic Gates: Crash Course Computer Science #3 · YouTube · CrashCourse · 10 min · for registered students

Further resources

  • Contemporary Mathematics, 2.1–2.2: Statements and compound statements · PDF · OpenStax Contemporary Mathematics (2023), 2.1–2.2: propositions, negation, and, or and conditional statements, pp. 60–77 · for registered students
  • Contemporary Mathematics, 2.3: Constructing Truth Tables · PDF · OpenStax Contemporary Mathematics (2023), 2.3: building truth tables for compound statements, pp. 78–86 · for registered students
  • On the unusual effectiveness of logic in computer science · Open-access article · Halpern et al. (2001), Bulletin of Symbolic Logic. Readable survey of why logic underpins computer science. · for registered students
Materials marked “for registered students” open in the student portal, which is set up as soon as you receive final acceptance.
Course chat

Admitted students ask questions on this week’s page in the student portal: an AI assistant trained on the course answers first, and during the course’s timetabled classes Connect to your tutor brings your tutor into the chat, who may start a call if needed.

Open this week in the portal
Course plan
  • Week 1: Number bases: binary, denary and hexadecimal, and convertin…
  • Week 2: Binary in computer science: binary addition and overflow, t…
  • Week 3: Propositional logic: Boolean operators and truth tables
  • Week 4: Set theory: Venn diagrams, notation, union, intersection an…
  • Week 5: Proof techniques: induction and strong induction, contradic…
  • Week 6: Finite fields and modular arithmetic: algebras, identities …
  • Week 7: Number-theoretic theorems (Fermat's little theorem, Euler's…
  • Midterm: Midterm evaluation
  • Week 9: Sequences and series: arithmetic, geometric and harmonic pr…
  • Week 10: Vectors and matrices: matrix multiplication, inverses and s…
  • Week 11: Matrix types and properties (trace, determinant), LU decomp…
  • Week 12: Applying Mathematics for Computer Science in practice: case…
  • Week 13: Assignment workshop: research, planning and referencing
  • Week 14: Assignment workshop: drafting, feedback and improvement
  • Week 15: Review and coursework completion
  • Final: Final assessment and submission
Back to the course
Scroll