For engineering students and anyone who needs discrete mathematics for programming applications.
Program of Study:
- Module Materials.
- Basic concepts of set theory
- Basic rules of enumerative combinatorics
- Dirichlet principle
- K-combinations of n-elements
- Combinatorics – part two
- Module Materials
- K permutations of n elements
- Urn schemes and drawer layouts.
- Counting mappings of finite sets
- Recurrence relations
- Graph Theory – Part One
- Module Materials
- Basic concepts and definitions
- Routes, paths, loops. The concept of connectivity. Bipartite graphs.
- Subgraphs. Basic operations on graphs.
- Graph Theory – Part Two
- Module materials
- Trees
- Eulerian Graphs
- Couples. Hall’s theorem
- Discrete Probability
- Module Materials
- Basic concepts of discrete probability.
- Conditional probability
- Random variables
- The main characteristics of random variables
- The final lesson
What you will learn and experience:
Become familiar with the basic sections of discrete mathematics.