Ben Gurion University of the Negev

Mathematics Department


Discrete Math for Computer Engineering

Fall Semester 2015


  • Shakhar Smorodinsky (lecturer)
  • Classes: Tuesday 12-14 (building 28 room 301) Wednesday 12-14 (building 97 room 201)

    Office hours: Wednesday 14-16 (please make an email apptointment before arriving)

    Grade: 95% final exam 5% homework

    Syllabus: Logic and Set theory: propositional calculus, boolean operators and their truth tables, truth values of formulae, logical equivalence, De Morgan formulae. Sets: inclusion, union, intersection, difference, cartesian product, relations, equivalence relations, partial orders, and functions. Basic Combinatorics: induction, basic counting arguments, binomial coefficients, inclusion-exclusion, recursion and, generating functions. Graphs: general notions and examples, connectivity, Euler graphs, trees, chromatic number.