MATH 207 Discrete Math

Catalog Description: 
An introduction to basic concepts and techniques of discrete mathematics. Topics include logic, sets, positional numeration systems, mathematical induction, elementary combinatorics, algorithms, matrices, recursion and the basic concepts of graphs and trees. The relationship to the computer will be stressed throughout.
Prerequisite: 
MATH 120 or Level III placement on the Basic Math Skills Inventory or permission of the instructor.
Credits: 
3
Offered: 
Both semesters - Offered by the Department of Mathematics
Required or Elective: 
Required for the BS in Computer Science
Level: 
Intermediate
Coordinator: 
Gwyneth Whieldon
Current Textbook: 
Discrete Mathematics with Applications, fourth edition, by Susanna S. Epp, 2011.
Topics covered: 
Topics include logic, sets, positional numeration systems, mathematical induction, elementary combinatorics, algorithms, matrices, recursion and the basic concepts of graphs and trees.
Student Learning Outcomes: 

On completing this course, the student will be able to:

  • develop proficiency in the techniques of discrete mathematics.
  • understand the abstract nature of theoretical mathematics.
  • learn applications of mathematics and use them to solve real-world problems.
  • understand mathematics in its historical context.
Relation of Course Outcomes to Program Outcomes: 
--
Role in Assessment: 
Go to top