MATH121 Discrete Mathematics

Department of Science, Technology, Engineering & Mathematics: Mathematics

I. Course Number and Title
MATH121 Discrete Mathematics
II. Number of Credits
3 credits
III. Number of Instructional Minutes
2250
IV. Prerequisites
MATH140 (C or better) or Permission of the Department of Science, Technology, Engineering & Mathematics
Corequisites
None
V. Other Pertinent Information

Primary teaching methods are lecture, recitation, problem solving, and class discussion as appropriate.

A comprehensive departmental final is included in the course.

VI. Catalog Course Description
This course enables students to strengthen and increase the understanding of discrete mathematics with special emphasis on computer science applications. Topics include sets, number systems, the nature of proof, formal logic, functions and relations, combinatorics, recurrence relations, trees and Boolean algebra.
VII. Required Course Content and Direction
  1. Course Learning Goals

    Students will:
    1. demonstrate an understanding and apply the concepts and procedures for expressing mathematical ideas clearly, precisely and unambiguously;
    2. demonstrate a proficiency in analyzing an argument's form to determine whether the truth of the conclusion follows necessarily from the truth of the premises;
    3. apply the logic of quantified statements and the precision of thought and language to achieve a mathematical certainty;
    4. demonstrate a proficiency in discovering and characterizing regular patterns associated with repeated processes;
    5. apply the concepts of set theory, including Boolean logic and work with functions such as discrete sets, one-to-one and onto, existence of inverse functions, and the interaction of composition of functions and the properties of one-to-one and onto; and
    6. apply the concept of equivalence relations as used in modular arithmetic and cryptography.
  2. Planned Sequence of Topics and/or Learning Activities

    1. variables and the language of sets, relations and functions
    2. logic of compound statements
    3. logic of quantified statements
    4. elementary number theory and methods of proof
    5. sequences, mathematical induction and recursion
    6. set theory
    7. functions and relations
    8. counting and probability
  3. Assessment Methods for Course Learning Goals

    The assessment of course learning goals is based informally on participation in classroom discussions with other students and the teacher, and formally on written exams, assignments, papers and/or performance-based tasks and projects.
  4. Reference, Resource, or Learning Materials to be used by Student:

    There is a departmentally selected textbook and calculator. The instructor will provide specific details for each section. See course syllabus.

Revision/Approval Date: 5/2012; New Core 8/2015