MATH 3370. Combinatorial Mathematics

Instructor : Dr. Peh Ng --

Time : 11am - 11:50 MTThF

Venue : Social Science 236

OFFICE: Sci 241

OFFICE HOURS: Monday - Friday : 10:00 - 10:50am or by appointment

PHONE: 589-6318

E-MAIL: pehng@cda.morris.umn.edu

COURSE MATERIALS:
Class notes, handouts & textbook: Discrete and Combinatorial Mathematics (4th Edition) by Richard Grimmaldi. To facilitate in-class discussions, it is recommended that you do some reading of the text.

PRE-REQUISITES FOR THIS COURSE: Willingness to work hard, to spend at least 2 hours daily on this course outside class, & to think analytically.

COURSE OBJECTIVES/PURPOSES: to help students to:

• learn the concepts of logic and proofs
• learn the language of Mathematics
• understand the notions of discrete functions, sets, counting process
• learn the concepts of discrete graph and its structures & properties
• be aware of the connections between discrete mathematics and other math-related courses
• be aware of the plethora of applications of discrete and combinatorial mathematics within and beyond the scope of academia.

MATERIAL COVERED:

• Classical Combinatorics
  
  • Basic & Intermediate Combinatorics .
    Introduction to combinatorics; permutations and combinations; logic and proofs; finite mathematical induction.
    
• Applied and Modern Combinatorics
  
  • Graph Theory .
    Introduction; directed and undirected graphs ; structures of the aforementioned graphs; representations of graphs; isomorphisms of graphs; planar graphs.
    
  • Cycles and Trees
    Hamiltonian cycles and the Traveling Salesman Problem ; eulerian graphs ; minimum cost spanning tree problem.
    
  • Applications of graph theory
    Network Models; Shortest path problems & algorithms; maximal flow problem; Max-Flow-Min-Cut Theorem ; minimum cost flow problem; Matching theory; Petri Nets.
    

GRADING:

1. Two exams - 100 points each. 200 points

2. Final exam (see UMM bulletin) 150 points

3. Course Project (with Service Learning Component) 100 points
(See Service Leanring Project Handout )

4. Homework - (written and computer). 150 points

(Late assignments are NOT accepted; only legible and neatly written assignments will be graded. There will be NO make-up exams unless arrangements are made with the instructor PRIOR to the exams.)

Course Grades

GUARANTEED GRADE	IF TOTAL PERCENTAGE x is
A	93 <= x <= 100
A-	90 <= x <= 92
B+	87 <= x <= 89
B	83 <= x <= 86
B-	80 <= x <= 82
C+	77 <= x <= 79
C	73 <= x <= 76
C-	70 <= x <= 72
D+	67 <= x <= 69
D	60 <= x <= 66

PLEASE FEEL WELCOME TO SEE ME OUTSIDE OF THE CLASS, ANY TIME, IF YOU HAVE QUESTIONS, PROBLEMS, OR COMMENTS PERTAINING THE COURSE WORK.

This page's URL is http://www.morris.umn.edu/~pehng/Quarters/Ma3370/syllabus.html

Back to Combinatorial Math's Page ; back to Peh's Teaching Page .