7a. Prerequisite(s): (Course and/or other preparation/experience that is REQUIRED to be completed previous to enrollment in this course.)

Two years of high school algebra or Math. D or equivalent with a grade of "C" or better, or placement by matriculation assessment process

7b. Co-requisite(s):  (Courses and/or other preparation that is REQUIRED to be taken concurrently with this course.)

7c. Advisory: (Minimum preparation RECOMMENDED in order to be successful in this course.  Also known as “Course Advisory”.)

9b. Catalog Description:

Introduction to sets and functions; study of logic; principles of counting and probability; study of matrix algebra; and introduction to relations, graph theory, and tables. Discussion of mathematical proof, including proof by induction.

10. Student Performance Outcomes: (Outcomes for all credit courses must indicate that students will learn critical thinking and will be able to apply concepts at college level.  Outcomes must be related to items listed in Section 11.)

1. create and understand basic mathematical proofs;
2. apply matrices in applications to other areas of study,
including computer science;
3. apply basic counting principles to problems occurring in many
areas of study especially computer science, statistics and
finite math;
4. recognize opportunities to apply principles of probability and
graph theory to diverse problems; and
5. understand and use recurrence relations.

11. Course Content Outline: (Provides a comprehensive, sequential outline of the course content, including all major subject matter and the specific body of knowledge covered.)

I. Basic Notions of Sets and Set Operations Including Union,
Intersection, and Complements
II. Introduction to Logic and the Nature of Proofs Including
Direct and Indirect Proofs and The Use of Counter
Examples
III. Relations and Functions
IV. Principle of Proof by Mathematical Induction and Its
Application to a Variety of Formulas Including the
Binomial Formula
V. Basic Counting Techniques Including Permutations,
Combinations, and the Use of Generating Functions
VI. Discrete Probability
VII. Matrix Theory
VIII. Recurrence Equations
IX. Trees and Graphs

12. Typical Assignments: (Credit courses require two hours of independent work outside of class per unit of credit for each lecture hour. List types of assignments, including library assignments.)

a. Reading Assignments: (Submit at least 2 examples)

b. Writing, Problem Solving or Performance: (Submit at least 2 examples)

c. Other (Terms projects, research papers, portfolios, etc.)

SECTION D

SECTION E

SECTION F

SECTION G