Cert-prep courses with hands-on practice for AWS, Azure, Kubernetes, security and AIModule 1 of every course free, no card →
CloudaQube

Development · generic · beginner

Discrete Mathematics for Computer Science

Master the mathematical foundations that underpin all of computer science. Covers logic, proof techniques, sets, combinatorics, and graph theory — modelled after MIT 6.042J and Stanford CS103.

  • 8 hours
  • 22 lessons
  • 5 modules
  • 50-question practice exam
  • updated May 2026
Module 1 freeNo credit cardFull course from $8.99/mo
try it

Try it before you sign up

Read a full lesson and answer 3 questions from the Module 1 quiz. No account needed.

free lesson · read · 25 min

Propositional Logic and Truth Tables

Propositional logic is the foundation of mathematical reasoning and the basis for how computers process boolean conditions. A proposition is any statement that is either true (T) or false (F) — never both, never…
question 1 of 3 · from the Module 1 quiz
Which row makes an implication p → q FALSE?
Pick an answer.
curriculum

5 modules, 22 lessons

Module 1 is free — lessons, hands-on walkthrough and quiz. The course ends with a 50-question practice exam.

  • readPropositional Logic and Truth Tables25 min
  • videoLogical Connectives — MIT OpenCourseWare30 min
  • readLogical Equivalence and Normal Forms20 min
  • quizLogic Quiz15 min
how it's built

Built by the CloudaQube team

No celebrity instructor — here is exactly what goes into the course instead.

  • 01 1 guided hands-on walkthroughs you run in a real environment.
  • 02 5 module quizzes and a 50-question practice exam — every answer comes with an explanation.
  • 03 Last updated May 2026.
  • 04 Any module can become a hands-on lab in Labs Studio.
outcomes

What you'll be able to do

  • 01 Construct and evaluate truth tables for propositional logic
  • 02 Write rigorous mathematical proofs using direct, contradiction, and induction methods
  • 03 Apply set theory and relations to model computational problems
  • 04 Count arrangements and selections using permutations, combinations, and inclusion-exclusion
  • 05 Represent and traverse graphs using BFS and DFS
before you start
  • — High-school algebra
  • — No prior proof experience required
questions

Before you start

How long does it take?

About 8 hours of lessons, videos and hands-on walkthroughs across 5 modules, plus a 50-question practice exam.

What’s free?

Module 1 in full — lessons, hands-on walkthrough and quiz — with no card required. Any paid plan (from $8.99/mo) unlocks all 5 modules and the practice exam, and starts with a 14-day free trial.

get started

Start the course with Module 1 free.

No card required. Unlock every module and the practice exam from $8.99/mo when you’re ready.

See pricing
      Discrete Mathematics for Computer Science — Online Course | CloudaQube