Distance - Discrete Mathematics (04-BS-16) 2012

Topics

• Algorithms: the integers and division, complexity of algorithms and matrices
• Logic: predicates and quantifiers, propositional equivalences, set operations, sets, sequences and summations, functions and the growth of functions
• Basics of counting: permutations and combinations, pigeonhole principle and discrete probability
• Methods of proof: mathematical induction, recursive definition
• Relations and their properties: representing relations, equivalence relations
• Recurrence relations: inclusion-exclusion
• Introduction to graphs: representing graphs and graph isomorphism, graph terminology, Euler, connectivity and Hamilton paths. Introduction to sorting