• Mathematics for Computer Science | Electrical Engineering and Computer Science | MIT OpenCourseWare
  This course covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.
  in ATHIS 2016 SEP16 > ONLINE COURSES with computer courses covers discrete elementary mathematics online science

elementary from all users