MAT 215: Discrete Mathematics for Computer Science

Discrete mathematics concepts are studied that are foundational for further study in computer science. Topics include propositional logic and quantifiers, proofs with emphasis on induction, design and optimization of combinatorial circuits, Boolean algebra, solution of certain classes of recurrence and equivalence relations and modulo arithmetic with application to RSA cryptography. Prerequisites: COS 120 or 130; and MAT 146 or 151.

236 W. Reade Ave., Upland, IN 46989 · 765-998-5162 · cseinfo@cse.taylor.edu
Copyright © 2016 Taylor University Computer Science and Engineering