Discrete mathematics encompasses a broad range of mathematical fields centered on discrete (non-continuous) mathematical structures with an eye toward applications in applied and theoretical computer science. Topics include number theory, set theory, logic, graph theory, and combinatorics. Problems encountered in this field range from easy to very difficult, so this course provides an opportunity to hone mathematical problem-solving skills. Additionally, the course will help students develop proof-writing skills, and it will enable them to build a strong mathematical background for future study in computer science. The course will include applications in the analysis of computer algorithms.
Applications are Closed
at the time of application
on the first day of session
Participants must have completed math courses through pre-calculus.