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) Jan 2013 Feb 2013 Mar 2013 Apr 2013 May 2013 Jun 2013
     Online Courses (MAT-270-OL) Jan 2013 Feb 2013 Mar 2013 Apr 2013 May 2013 Jun 2013

Semester Hours: 3

Preview the Online Syllabus (Please note that the contents of the actual online syllabus may differ from the preview due to updates or revisions.)