Discrete Mathematics for Computer Science

3 credits · Undergraduate

This course is an introduction to formal reasoning and discrete mathematics with applications to computer science. Students will be introduced to formal notation and reasoning about problems and algorithms. Topics include: sets, sequences, and summations, simple proof techniques, elementary number theory, back-of-the-envelope approximations, combinatorial objects. Applications and relevance of these concepts in computer science will be emphasized. EXCLUSIONS: CSCI 1315.03, MATH 2112.03 FORMATS: Lecture