Course: MAT 309 Discrete Mathematics
Text: Discrete Mathematical Structures, 6th Edition, Kolman, Busby and Ross (ISBN: 0132297515)
MAT 309 Discrete Mathematics Credit, 3 sem. hrs.
Prerequisites: MAT 122 or instructor’s consent
An introduction to discrete mathematics including induction and recursion, algorithms, relations, partial ordering, graphs, directed graphs and trees. Applications will include Euler and Hamilton paths and minimal spanning trees.
Rationale for Course: This course is an introduction to discrete mathematics including fundamental tools (sets, equivalence relations, partial orders, sequences, functions), the Euclidean Algorithm, induction, recurrence relations, counting principles, graphs, directed graphs (digraphs), trees, optimization algorithms and networks. The course also includes applications of these topics. It is an appropriate course for mathematics majors and minors.
Learning Objectives: At the conclusion of the course, the successful student should be able to:
-understand and use a variety of fundamental tools (sets, equivalence relations, partial orders, sequences, functions)
-apply the Euclidean Algorithm to solve congruences
-use mathematical induction
-solve recurrence relations
-use a variety of counting techniques
-give examples of graphs with various properties
-identify Euler and Hamiltonian paths
-apply graph theory to solve a broad class of problems
-identify and apply trees
-perform optimizing algorithms
-understand and apply the Max Flow – Min Cut Theorem
Academic Integrity: Honesty and integrity are basic virtues
expected of all students at
http://www.mc.edu/publications/policies/ and following the link to Policy 2.19.
Learning Environment: The method of instruction will include lecture, group problem solving, individual problem solving, quizzes and examinations. Each student is expected to have a copy of the text, writing materials, a calculator and an open mind. On tests, quizzes, and individual out-of-class projects, the work is assumed to be the student's own and no cheating will be tolerated.
Disability Accommodation: If you need special accommodations due to
learning, physical, psychological, or other disabilities, please contact Dr.
Buddy Wagner in the Counseling and
Assessment: Assessment of the student's progress will be made through quizzes and examinations as well as through classroom feedback. There will be three unit examinations (worth 100 points each), daily work (quizzes and other projects worth a total of 150 points) and a comprehensive final examination (worth 150 points). The final grade will be determined by the following scale:
540-600 points A
480-539 points B
420-479 points C
360-419 points D
Below 360 points F
Makeup work is the responsibility of the student and should be cleared with the instructor in advance whenever possible. The college stipulates that the grade for the course is automatically an F in the event of 8 or more absences.
TENTATIVE ASSIGNMENT SCHEDULE (TR)
Preliminary Tools (Induction, sets, functions) 3 class periods
Relations 2 class periods
Algorithms 2 class periods
Introduction to Number Theory 3 class periods
Principles of Counting 4 class periods
Recurrence Relations 2 class periods
Graph Theory 4 class periods
Trees 3 class periods
Networks 2 class periods
Tests 3 class periods
MISSISSIPPI COLLEGE ACADEMIC POLICIES:
Students should consult the Mississippi College policy manual located at http://www.mc.edu/resources/publications/policies/ for official information regarding:
Students who may require accomodation due to a documented handicap should follow the procedures located at http://www.mc.edu/about/offices/counseling/disabilities/
The Generic Grading Scale for this course is A = 90-100, B = 80-89, C = 70-79, D = 60-69. Individual instructors are free to choose a different grading scheme so students should consult their section's particular syllabus for the official grading scale to be utilized.
Hours and location for the departmental tutoring center are posted at http://www.mc.edu/academics/academic-tutoring/ .