MAT-270 Discrete Mathematics

Provides tools for formal reasoning with a particular focus on applications in computer science, although no knowledge of programming is required. Topics include counting rules, propositional and first-order logic, set theory, functions (with an emphasis on recursive functions), partial order and equivalence relations, Boolean algebra, switching circuits, and graphs and trees.

Advisory: It is advisable to have knowledge in a course equivalent to MAT-121 College Algebra with a grade of C or better to succeed in this course. Students are responsible for making sure that they have the necessary knowledge.

Study Methods:

     Guided Study (MAT-270-GS) Oct 2013 Nov 2013 Dec 2013 Jan 2014 Feb 2014 Mar 2014 Apr 2014 May 2014 Jun 2014
     Online Courses (MAT-270-OL) Oct 2013 Nov 2013 Dec 2013 Jan 2014 Feb 2014 Mar 2014 Apr 2014 May 2014 Jun 2014

Semester Hours: 3

Preview the Online Syllabus new window
(Please go to our bookstore, MBS Direct new window in order to view the correct materials for each course by semester as the contents of the actual online syllabus may differ from the preview due to updates or revisions)