## Math 3050: Discrete Mathematics

## Announcements

## · Test 2 is on Friday, 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 Wednesday, October 28 at class time. It will cover
Sections 10.1, 10.2, 10.5, 10.7 (Graph Theory) of the
textbook (Graph Coloring in not included in the quiz). No books or notes
are allowed.

## · Test 1 is on Wednesday, October 7 at class time. It will cover Sections
9.1, 9.2, 9.3, 9.5 (Counting Techniques) of the textbook.
No books or notes are allowed.

## ·
Quiz 1 is on Monday, Sept. 14 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.

##

##

**Discrete
mathematics links**

·
Discrete math tutorials, lessons
and instructions

·
Discrete mathematics
in Wikipedia, the free encyclopedia

·
The Math Forum - Math
Library - Discrete Math

·
Discrete Mathematics
Applets

·
Graph Theory lessons

· Traveling Salesman Problem

· Mathematical contest in
modeling

·
Maximum
Flow Problem on Youtube (Part 1, starts at 41:50)

· Maximum
Flow Problem on Youtube (Part 2)

· Maximum
flow and minimum cut (book chapter)