MATH320 - Discrete Mathematics

Description:
This course introduces students to fundamental algebraic, logical, and combinational concepts in mathematics that are needed in upper-division computer science courses. Topics include sets, mappings, and relations; elementary counting principles; proof techniques with an emphasis on mathematical induction; graphs and directed graphs; Boolean algebras; recursion; and applications to computer science.

Outcomes:

• Demonstrate various methods of proof, including direct and indirect proof and proof by induction
• Solve basic counting problems, including some involving permutations and combinations
• Apply the concepts of recurrence to algorithms and counting problems
• Apply the concept of growth of functions to compute the complexity of simple algorithms
• Identify specific types of graphs and trees
• Apply several classic algorithms related to applications of graphs and trees

Required Text(s):

Rosen, K. (2019). Discrete mathematics and its applications. (8th ed.). New York, NY: McGraw-Hill.ISBN: 9781259676512.