CPSC 201: Introduction to Computer Science
Instructor: Carsten Schürmann
Department of Computer Science
Yale University
Time: MWF 11:30-12:20
Room: AKW200
|
|
Home |
|
|
Schedule |
|
|
Handouts |
|
|
Assignments |
|
|
Projects |
|
|
Links |
Lecture 36
In this class we will meet three problems that have become quite famous in computer science. They are also tremendously important in the real world. The problems are satisfiability of a Boolean sentences, the traveling salesman problem, and the Hamiltonian path problem. Reading: Algorithmics, Chapter 7.