Math 3050: Applied Discrete Mathematics
Announcements
·
The Final Exam is on Tuesday, Dec. 9 at 10:10 am. The exam is
comprehensive. Closed book, closed notes, one sheet of reminders is allowed.
·
Test 2 is on Thursday, Nov. 20 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, October 28 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, October 9 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, Sept. 16 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
·
Links to student
projects in Discrete Optimization
· Operations
Research (includes Discrete Optimization) among best Technology jobs