Syllabus for Course of Instruction

 

I.              Basic Information of the Course

 

MAT 205, Discrete Mathematics

3 hours credit

Prerequisites: MAT 111 or its equivalent

 

II.            Course Instructor

 

Instructor:                            Mr. Dwayne Jennings, Associate Professor of Mathematics

Office:                                    C-51

Telephone Extension:      5273

 

III.           Primary Objectives of the Course

 

 

Students should be able to:

 

Identify logical forms and translate to and from symbolic notation.

Recognize the relation between switching circuits and Boolean expressions.

Apply logical principles to number systems and circuits for addition.

Apply the logic of quantified statements.

Write direct and indirect proofs in elementary number theory.

Write proofs using mathematical induction.

Recall and apply basic principles of set theory.

Apply functions to computer science applications.

Apply recursive definitions to a variety of applications.

Recall and apply the definition of an equivalence relation and a partial order.

Recall and apply basic definitions of graphs and trees.

 

IV.           Method of Instruction

 

The course will be taught by using a lecture-demonstration-

discussion method.

 

V.            Required Text and Supplies

 

Discrete Mathematics with Applications, Third Edition by Susanna S. Epp

 

VI.           Assigned Readings and Research:

 

Some Library reading will be required

 

VII.         Special Projects and / or Activities

               

Special projects and activities will vary depending upon the availability of appropriate computer software and hardware resources for the course.

 

VIII.        Method of Evaluation

 

A small number of homework checks will be performed.   A small number of daily quizzes will be given in addition to unit tests.   The final grade will be determined by the ratio of (points earned)/(points possible) and using the published grading scale at Union University. 

 

IX.           Attendance Policy

 

Regular and successive attendance is expected of all students.  This will be especially important for the computer component of the course.  In order to promote regular class attendance, quizzes will be given and attendance will be checked daily.  An unexcused absence on a day where homework is checked, a quiz or unit test is given or an assignment is due will result in a score of zero on that particular days grade.  Please note that all students are expected to be on time for class.  Any student who misses an excessive number of times will be reported to the Academic Center.

 

 X.            Statement on Cheating and Plagiarism

 

Cheating of any type will not be tolerated.  If a professor observes cheating by a student, the student will receive a zero and will be reported to the Office of the Vice President for Academic Affairs.

 

XI.           The Last Day to Drop the Course without the special permission of the Registrar is Tuesday, October 2, 2007.

 

 XII.         Special Graduate Requirements: (Not Applicable)

 

XIII.        Other

Outline of the Course

 

Topics selected from the following will be covered:

 

I.              The Logic of Compound Statements

II.            The Logic of Quantified Statements

III.           Elementary Number Theory and Methods of Proof

IV.           Sequences and Mathematical Induction

V.            Set Theory

VI.           Counting

VII.         Functions

VIII.        Recursion

IX.           Efficiency of Algorithms

X.            Relations

XI.           Graphs and Trees

XII.         Regular Expressions and Finite–State Automata

 

General

 

This syllabus is intended to serve as a general student guide to study this course, and to give general information relative to the "mechanics" of the course.  It is not a contract.