Mathematics for Computer Science

revised Monday 5th June, 2017, 19:42

Eric Lehman

更多

Google Inc.

F Thomson Leighton

Department of Mathematics

and the Computer Science and AI Laboratory,

Massachussetts Institute of Technology;

Akamai Technologies

Albert R Meyer

Department of Electrical Engineering and Computer Science and the Computer Science and AI Laboratory,

Massachussetts Institute of Technology

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.

收起