Discrete Mathematics I (MATH 210)

Harrisburg University

This course provides the student with an understanding of multiple mathematical concepts and methods, which shape the foundation of modern information science in a form that is relevant and useful. Discrete mathematics plays a fundamental role for computer science, which is similar to that played by calculus for physics and engineering. Many concepts in computer science are best understood from a perspective that requires expertise with mathematical tools and certain reasoning skills associated with mathematical maturity. The topics covered draw on current material from several mathematical disciplines: graph theory, mathematical logic, and set theory.


Discrete Mathematics and its Applications by Rosen

Topic List

  • Naive Set Theory
  • Propositional Logic
  • Mathematical Proof Techniques (not including induction)
  • Number Theory
  • Advanced Counting
  • Functions and Relations
Douglas Rumbaugh
Douglas Rumbaugh
Lecturer of Computer Science