Math 3050: Discrete Mathematics

Announcements

·     The Final Exam is on Wednesday, April 30 at 10:10 am. The exam is comprehensive. The exam is closed book, closed notes, one sheet of reminders is allowed.

·      Test 2 is on Wednesday, April 16 at class time. It will cover Minimum Spanning Tree, Graph Coloring, Efficiency of Algorithms, and Maximum Flow Problem. No books or notes are allowed.

·      Quiz 2 is on Wednesday, March 26 at class time. It will cover Sections 9.6, 9.7 (Counting) and Sections 10.1, 10.2, 10.5 (Graph Theory) of the textbook. No books or notes are allowed.

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

·      Quiz 1 is on Wednesday, February 5 at class time. It will cover Chapters 4 and 5 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

·      Video lectures in Discrete Mathematics

·      Graph coloring (starts at page 748)

·      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)

·       Linear Optimization with Applications

·      AMPL (software for solving linear and integer programming problems)

·      Doing the Math to Find the Good Jobs (Wall Street Journal Article)

·      Mathematical contest in modeling