Curtis Northcutt
| Jan/16 | Thu | 07:00PM-09:00PM | 32-124 |
Enrollment: Unlimited: Advance sign-up required
Sign-up by 01/13
Prereq: none
Discrete Mathematics Proof Methods. We will cover Induction, Deduction, Contradiction; examples therein; and applications to Graph Theory and how are they used by Google Maps. Regarding Graph Theory, we will cover introductory definitions, proofs about different graph classes and types, graph algorithms (breadth first search, depth first search, Dijkstra's algorithm, heuristic search, A* search). If time, we will conclude with a discussion of the four-color theorem, and prove a looser bound of 6-color theorem (5-color theorem if time) and other interesting examples as time permits.
Please sign up by registering at https://docs.google.com/forms/d/106QXdo0rALA2q5dQKek_sUVBemmdXcr7rYRMCqn4VCo/viewform
Sponsor(s): Electrical Engineering and Computer Science
Contact: Curtis Northcutt, cgn@mit.edu