MAT 230  Discrete Mathematics


George Boole



    This course is an introduction to "abstract, pure mathematics."  It is the foundation for most upper level courses in mathematics.  However, its methods and subject matter are also critical for many areas of computer science, such as Digital Logic, Analysis of Algorithms, and Theory of Computability and Automata.  For example, truth tables define rules of logic for a mathematician while, at the same time, providing a necessary roadmap for the design of digital circuits; induction gives a mathematician a method for proving a statement is true for the set of positive integers while, concurrently, giving an algorithm defining a recursive process for the computer scientist.

Text:  Discrete Mathematics, Second Edition by Seymour Lipschutz

Subjects:  material from chapters 1-4 of the text, and related topics (such as using truth tables to design unsimplified digital logic circuits).

Grading:


Cooperation:  You are encouraged to form study/homework groups.  A seating chart, with phone numbers(optional) will be distributed.  Grading is not done on a curve; it is in your best learning and grade interest to work cooperatively with your classmates.

Assignments:  ordinarily given in class.  If you miss class, your are still responsible for the day's assignment.  Please get that from a classmate, me, or my web page.



Success in this course is not simply earning a good grade. The following suggestions may help you through the semester: