This deep dive supports UNISA COS1501 (Theoretical Computer Science I) —
covering the discrete mathematics of computer science: sets, propositional
and predicate logic, relations, functions, methods of proof, mathematical
induction and Boolean algebra. Sign in or create a free account to access the material.
Master the discrete mathematics behind computer science — sets, propositional and predicate logic, relations, functions, methods of proof, induction and Boolean algebra. 10 lessons, each with a reading, quiz gate, assessment gate, written practice and interactive visualizers.
No lessons match ""
📋
Full Assessment
25 questions across all topics · exam readiness report
Not attempted
→
📄
UNISA Past Paper Simulations
Practise with exam-style questions across all 4 parts
→
🗂️
Quiz Bank — discrete-maths practice questions
Multiple-choice questions across all 10 lessons with topic filters
→
🔭
Discrete-maths Visualizers
Step through Venn diagrams, relation digraphs and matrices, function maps, Hasse diagrams, truth tables and the induction ladder
→
🏗️
Capstone — Congruence mod 3
One theory thread across four gated stages: relation → equivalence proof → partition → order & Boolean model
→
📊
My Progress & Mastery Heatmap
See green/amber/red across all 10 lessons · run a 10-question diagnostic