Mar 29, 2024  
2020-2021 Undergraduate Academic Catalog 
    
2020-2021 Undergraduate Academic Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

MA 2310 - Discrete Mathematics I

3 lecture hours 0 lab hours 3 credits
Course Description
This course provides an introduction to discrete mathematics as it applies to computer science. Topics include sets, logic, relations, functions, recursion, Boolean algebra, and graph theory. A student cannot receive credit for both MA 2310 and MA 1830 . (prereq: sophomore standing)
Course Learning Outcomes
Upon successful completion of this course, the student will be able to:
  • Illustrate by examples the basic terminology of functions, relations, and sets
  • Illustrate by examples, both discrete and continuous, the operations associated with sets, functions, and relations
  • Apply functions and relations to problems in computer science
  • Manipulate formal methods of symbolic propositional and predicate logic
  • Demonstrate knowledge of formal logic proofs and logical reasoning through solving problems
  • Illustrate by example the basic terminology of graph theory
  • Apply logic to determine the validity of a formal argument
  • Identify a relation; specifically, a partial order, equivalence relation, or total order
  • Identify a function; specifically, surjective, injective, and bijective functions
  • Illustrate by examples tracing Euler and Hamiltonian paths
  • Construct minimum spanning trees and adjacency matrices for graphs

Prerequisites by Topic
  • Basic concepts of college algebra
  • Basic concepts of set theory

Coordinator
Dr. Chunping Xie



Add to Portfolio (opens a new window)