The goal of this course is to study advanced discrete mathematical concepts and useful techniques for working with them. The material to be covered has been carefully selected to provide an essential background for computer science students. At the end of the semester, the student will be able to:

Solve counting problems using the basic counting rules, the sum and product rules, inclusion-exclusion principle,

Be familiar with permutations and combinations with or without repetitions

Solve some problems using the Pigeonhole Principle

Master concepts in probability theory

Solve recurrence relations and use recurrence relations to solve some word problems

Understand the definition of relation and the properties of relations