Discrete Mathematics
Bachelor of Science in Computer Science · University · Core Courses
In this unit you will: master logical connectives, truth values, and set operations; recognize properties of relations and functions; apply divisibility, modular arithmetic, and proof techniques; count, use the pigeonhole principle, and apply basic graph theory; calculate, prove, and classify as on an exam.
There are 50 exercises to practice: interaktive Aufgaben. Every answer gets instant feedback, free and without signing up.
What's included
- Master logical connectives · truth values · and set operations
- Recognize properties of relations and functions
- Apply divisibility · modular arithmetic · and proof techniques
- Count · use the pigeonhole principle · and apply basic graph theory
- Calculate · prove · and classify as on an exam
Example questions
- When is the conditional p → q false?
- True or false? “The proposition p ∨ ¬p is a tautology.”
- Let A = {1, 2, 3, 4} and B = {3, 4, 5}. What is A ∩ B?