AMCS 162 Discrete Mathematics

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 congruence's; asymptotic notation and growth of functions; permutations and combinations, and counting principles.