Math 3050: Applied Discrete Mathematics
Announcements
· Test 2 is on Tuesday, April 15
at class time. It will cover Graph Coloring, Efficiency of Algorithms, the
Maximum Flow and Minimum Cut Problems (applications of Max Flow are not covered
in this test). No books or notes are allowed.
·
Quiz
2 is on Tuesday, March 25 at class time. It will cover Chapter 10 of the
textbook (Graph Theory). Graph coloring is not covered in this quiz. No books
or notes are allowed.
·
Test
1 is on Thursday, February 27 at class time. It will cover Sections
9.1, 9.2, 9.3, 9.5, 9.6 (Counting Techniques) of the textbook
.
No books or notes are allowed.
·
Quiz 1 is on Tuesday, February 4 at class time. It
will cover Sections 4.1, 4.3, 4.4, 5.1, 5.2, 5.3 of the textbook
.
No books or notes are allowed.
Class Materials
Links to online rooms
Discrete
mathematics links
·
Discrete
Mathematics Resources
·
Discrete
Mathematics Tutorials
·
Discrete
Mathematics in Wikipedia
· Book
section on Graph Coloring Problem
· Traveling Salesman Problem
· Maximum
Flow Problem on Youtube
(Part 1, starts at 41:50)
· Maximum
Flow Problem on Youtube
(Part 2)
· Book
section on Maximum Flow Problem
· Operations
Research (includes Discrete Optimization) among best Technology jobs