Mar 18, 2019  
Middlesex Community College Academic Catalog 2018-19 
    
Middlesex Community College Academic Catalog 2018-19

MAT 250 - Discrete Math

3

Course Description: An introductory course covering topics recommended for Computer Science: proof methods; formal logic and truth tables; sets and Boolean algebra; functions and relations; graphs; digraphs; trees; combinatorics; algorithms including recursion and induction.
Prerequisite(s): Placement above or completion of MAT 190, MAT 195, or MAT 196 with C or better.
General Education Elective(s): Math all programs
Note(s): N/A


Course Student Learning Outcomes:
  • Use statements, logic operations, laws of operations, and rules of inference to construct valid mathematical arguments.
  • Construct proofs, using a variety of methods and articulate the method used to the field of mathematics.
  • Apply rules, laws, and properties to perform operations involving discrete structures such as sets, functions, sequences, sums, permutations, matrices, relations, graphs, and trees.
  • Use discrete structures to create and/or analyze models for applications relating to Computer Science, Data Networking, Linguistic and many other diverse areas.


Click here for course schedule details, to register for this course, or to view required books for this course.