1 / 14

For Wednesday

For Wednesday. Read 10.1 No homework. Program 4. Any questions?. Exam 1. In-class portion on Friday Take-home due Monday Questions?. Paper 2. Any questions? Topic paragraph due Wednesday, Nov 8. Graph Searching. Depth-first Breadth-first Best-first. Applications of Searching.

orellana
Download Presentation

For Wednesday

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. For Wednesday • Read 10.1 • No homework

  2. Program 4 • Any questions?

  3. Exam 1 • In-class portion on Friday • Take-home due Monday • Questions?

  4. Paper 2 • Any questions? • Topic paragraph due Wednesday, Nov 8

  5. Graph Searching • Depth-first • Breadth-first • Best-first

  6. Applications of Searching • Connectivity in an undirected graph

  7. Bi-Connectivity • What’s the problem? • How can it be solved using DFS?

  8. Euler Circuits • What’s the problem? • How can it be solved using DFS?

  9. Difficulty Levels • Undecidable • Example is halting problem • Intractable • Example is ? • Exponential problems are considered intractable. Why?

  10. Another Class of Intractable Problems • Polynomial problems are considered tractable. • What does NP mean?

  11. Non-deterministic Polynomial • A deterministic machine must always make a single choice. • Suppose you had a non-deterministic computer. • Then you could “pick” all of the different choices at once (or automatically pick the best solution).

  12. The Class NP • Can determine that a solution is the correct solution in polynomial time. • All problems with polynomial time solutions fit into this class. • Some decidable problems do not. Consider problems for which the solution is of exponential length.

  13. The Big Question • Are there problem in NP that are not in P? • Brings us to the class of NP-complete and NP-hard problems. • NP-complete problems are reducible to one another.

  14. Examples • Traveling Salesman • Hamiltonian Cycle • Satisfiability (technically, 3Sat) • Graph coloring • Knapsack • Bin packing

More Related