Course Description
 |
Discrete mathematics is a beautiful subject that looks at finite collections of objects and how to manipulate, count and generate them. Patterns and algorithms play an important role. How to solve problems, think logically, reason clearly and prove results are also fundamental to the course. Some of the kinds of collections and applications that are examined are number systems, relations, functions, |
sets, boolean algebras, combinations, permutations, graphs and trees. Many of the topics in discrete mathematics are applicable to computer science. In exploring these topics basic mathematical tools such as logic, rules of inference, properties of numbers, induction and recursion are used.