Include a brief summary of the course topics and requirements, the general format of the course, and the methods of evaluation.

CIS 2130 is an online course in Discrete Mathematics intended for students planning to transfer from college to the University of Guelph.  It combines *most* of the material taught in CIS 1910 and CIS 2910.  The course is evaluated based on weekly assignments, bi-weekly quizzes, and a final exam.

This course provides a foundation in finite mathematics which is required for further computer science courses. Topics which will be studied include abstract representation of structures and algorithms, graph theory, logic, and set theory.


== Skills and knowledge students should have prior to beginning the course: ==


  * High School Math


== Course Topics: ==

  * Sets and Functions
    Relations and Integer Representations
    Propositional Logic
    Boolean Algebra
    Proof Methods
    Sequences and Summations
    Induction and Well Ordering
    Basics of Counting
    Advanced Counting and Basic Probability
    Graph Theory
    Graph Applications and Trees


== Course Format: ==

  * Lecture format:  No lectures.  All notes online.
  * Online materials location and format:  All course notes are online using CoureLink in PDF format.
  * Lab or tutorial format and expectations: None


== Method of evaluation: ==

  * Number of Assignments:  11, one a week
  * Number of Graded Labs:  0
  * Number of Quizzes: 5 (one every two weeks)
  * Formal Midterm?  No.
  * Course project?  No.
  * Final Exam?  Yes.
  * Group work?  No.
  * mostly programming assignments?  No.
  * Written documents? Yes - just the assignments.