MUH 211 - Discrete Mathematics

Course Objectives

To give the knowledge and the culture that are usefull for many problems of the mathematics and
science that can be solved only by reasoning. Help to gain the ability to use the models and the
similarities that lead to the solutions, find solitions , form algorithms and evaluate their performance
by using graphs and trees.

Course Description

Combinations, permutations, binomial theorem and applications, counting. Algorithms and their analysis, recursive algorithms. Representations of integers, Euclid algorithm, RSA cryptosystem. Recurrence relations, their solutions, application to analysis of algorithms. A basic introduction to graph theory. Boolean algebra, combinatorial circuits, finite state machines, finite state automata and Turing Machine