University Computer Science
Discrete Mathematics
Examination of the discrete (non-continuous) mathematical structures and logical arguments behind computer science.
Curriculum / Syllabus
- Propositional and Predicate Logic
- Proof Techniques (Direct, Contradiction, Induction)
- Set Theory, Functions, and Relations
- Combinatorics (Counting, Permutations, Combinations)
- Graph Theory and Trees
- Boolean Algebra
Exam & Course Strategy
Serves as a preparation for algorithm courses; induction proofs and combinatorial problem-solving skills are the main focus of exams.