Discrete Mathematics

Learning Outcomes

Upon successful completion of this course, students are expected to be able to explain basic principles of mathematical reasoning and proof techniques; explain concepts of sets, functions, relations, and recurrence relation; describe the use of number theory and counting methods; describe basic concepts of the graph theory and trees as a representation of discrete objects; explain concepts of Boolean algebra, combinatorial and sequential circuits.

Topics

This course is designed for students taking Computer Science program. It introduces students to basic concepts of discrete mathematics in order to develop a mathematical maturity and ability to deal with abstraction. The course materials serve the interests of the students in relation to further study in pure and applied mathematics, computer science and engineering. Topics covered in this course include concepts of logic and proof; concepts of the language of mathematics including sets, sequences, number systems, relations; algorithms; concepts of counting methods such as permutations and combinations, and discrete probability; concepts of graphs and trees; and Boolean algebra.