Discrete Structures


Sets and Relations, Functions, The Integers, The division algorithm Divisibility and Euclidian Algorithm, Prime Numbers Congruence with applications, Recursion, Principles of counting, Inclusion-Exclusion, The Addition and Multiplication Rules, The Pigeon-hole principle, Permutation and Combinations, Repetitions, The Binomial Theorem, Algorithm and complexity, Searching and sorting, Graphs and basic Properties Isomorphism, Paths and circuits with applications, Trees and properties, spanning Trees, Minimum spanning Tree Algorithms, Markov chains and algorithms.

Course Syllabus