This course is the second half of a two-semester course in discrete mathematics and is intended for computer science majors. Topics in the course include rules of inference, proof methods, sequences and summation, growth of functions, complexity of algorithms, prime numbers and their application to cryptography, proof by induction, recursion, recurrence relations, and properties of relations. There will be an emphasis on applications to computer science. Prerequisite(s): MTH 260