Schedule
A week-by-week breakdown of the material.
Week 1
- Day 1
- Introduction
- Day 2
- Graphs, Euler Circuits, Valence
- Day 3
- Hamiltonian Circuits, Complete Graphs
- Day 4
Traveling Salesman Problem
Minimum Cost Spanning Trees
- Day 5
Cut Property for MST’s and Shortest-Paths Algorithms
Directed Graphs, Critical Paths
Week 2
- Day 1
- Priority Lists, Scheduling, Independent Tasks
- Day 2
- Bin-packing, Vertex-Coloring
- Day 3
- MIDTERM 1
- Day 4
- Linear Programming, Mixture Problems
- Day 5
- Transportation Problems, Tableaux
Week 3
- Day 1
- Voting Systems, Majority Rules
- Day 2
- Voting with more than 3 candidates
- Day 3
- Manipulability
- Day 4
- MIDTERM 2
- Day 5
- Error-Correcting, Identification Numbers
Week 4
- Day 1
- Binary Codes, Parity Check
- Day 2
- Data Compression
- Day 3
- Cryptography
- Day 4
- Wrap-up
- Day 5
- MIDTERM 3