Math 3012: Applied Combinatorics
Tu - Th 8:05 - 9:25am
Tu - Th 12:05 - 1:25pm
Skiles 202
Spring 2009
Professor William T. Trotter
Contact Information
Course Syllabus
Syllabus, Course Outline and Grading Policy
Lecture Notes - Entire Book
Applied Combinatorics: Trotter and Keller
Test Questions and Solutions
Test 1 - 2009, Section B, 8:05am
Test 1 - 2009, Section F, 12:05pm
Test 2 - 2009, Section B, 8:05am
Test 2 - 2009, Section F, 12:05pm
Test 3 - 2009, Section B, 8:05am
Test 3 - 2009, Section F, 12:05pm
Homework Problems
Chapter 2 Problems with Solutions
Chapter 3 Problems with Solutions
Chapter 5 Problems with Solutions
Sample Tests
Test 1 - 2007
Test 2 - 2007
Test 3 - 2007
Final Exam - 2007
Test 1 - 2006
Test 2 - 2006
Test 3 - 2006
Final Exam - 2006
Test 1 - 2004
Test 2 - 2004
Test 3 - 2004
Final Exam - 2004
Test 1 - 2003
Test 2 - 2003
Test 3 - 2003
Final Exam - 2003
Lecture Notes - Individual Chapters
Chapter 1: An Introduction to Combinatorics
Chapter 2: Strings, Sets and Binomial Coefficients
Chapter 3: Induction and Recursion
Chapter 4: Basic Concepts of Graph Theory
Chapter 5: Partially Ordered Sets
Chapter 6: Inclusion-Exclusion
Chapter 7: Generating Functions
Chapter 8: Recurrence Equations
Chapter 9: Ramsey Theory
Chapter 10: Graph Algorithms
Chapter 11: Network Flows
Chapter 12: Applications of Network Flows
Appendix A: Set Theory for Combinatorics
Appendix B: Number Systems and Relations
Presentations
Graphs - Basic Concepts
Partially Ordered Sets - Basic Concepts
Euler Circuits in Graphs
Dijkstra's Algorithm
Spanning Tree Algorithms
Computer Programs, Header Files and Data Files
sum_recursive.c
sum_loop.c
collatz_sequence.c
gcd_lcm.c
combinatorics.h
mergesort.c
random_ints.txt
big_integer_addition.c
two_big_integers.txt
Sample Tests from 2007
Test 1: Problems and solutions
Test 2: Problems and solutions
Test 3: Problems and solutions
Final Exam - Problems only
Updated January 5, 2009.
