skillsetfinal.pdf

# skillsetfinal.pdf - CS 374 Algorithm and Models of...

• 3

This preview shows pages 1–2. Sign up to view the full content.

CS 374: Algorithm and Models of Computation (Spring 2017) Syllabus for Final Exam The final exam is cumulative and will test material covered in the entire course. However, a few topics will be omitted and they are highlighted below (basically we omit some advanced topics on regular languages and context free languages/grammars). Post midterm 2 skillset: Turing Machines and Complexity Classes Definition of a TM at a high-level and equivalence with programs. We will not ask you to design TMs for any concrete problem. Definition of decidable/recursive and recursively enumerable. Definition of P via TMs Knowledge of Universal TM and what it enables you to do - simulate a given TM on a given input. Undecidability Knowledge that the universal language and halting are undecidable. Ability to prove that problems on program behaviour are undecidable via reductions from L u and HALT . Rice’s theorem is not needed but it is useful to know what it says. You are free to use it. NP, NP-Completeness and Polynomial-time Reductions Definitions of NP, NP-Complete, NP-Hard Knowledge of standard NP-Complete problems: SAT, 3SAT, CircuitSAT, Indepensent Set, Clique, Vertex Cover, Hamiltonian Cycle/Path in directed/undirected graphs, 3Color, Color. Ability to prove that a given problem is in NP Ability to prove that a given problem is NP-Hard via a polynomial time reduction from an existing NP-Hard problem from the given list. Understand the definition of a polynomial-time reduction and its implications.

This preview has intentionally blurred sections. Sign up to view the full version.

This is the end of the preview. Sign up to access the rest of the document.
• Spring '15
• Pitt,L

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern