100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
CS6515 EXAM 3 STUDY GUIDE QUESTIONS AND ANSWERS 2024 $16.49   Add to cart

Exam (elaborations)

CS6515 EXAM 3 STUDY GUIDE QUESTIONS AND ANSWERS 2024

 5 views  0 purchase
  • Course
  • CS6515
  • Institution
  • CS6515

CS6515 EXAM 3 STUDY GUIDE QUESTIONS AND ANSWERS 2024

Preview 2 out of 5  pages

  • August 18, 2024
  • 5
  • 2024/2025
  • Exam (elaborations)
  • Questions & answers
  • CS6515
  • CS6515
avatar-seller
Teacher101
CS6515 EXAM 3 STUDY GUIDE

What problems are known NP-Complete? - ANSWERS-1. Max-Independent-Set

2. Clique

3. Vertex Cover

4. SAT

5. 3SAT

6. Independent Set



What problems are known NP? - ANSWERS-



What problems are known P? - ANSWERS-



What is Vertex Cover? - ANSWERS-A set of vertices where every edge is
"covered".

-For every edge, at least one vertex is in the VC



How to prove a problem is NP-Complete? - ANSWERS-1. Prove the problem is in
NP

-Given problem and solution, Verify solution in Polynomial Time.

2. Prove problem is as hard as any NP-Complete problem. (K nown → New)

-Show reduction from known NP-Complete problem to this problem.

, -Use a problem similar to this one.

-Prove forward and backward implication.



What is Euler Path Problem? - ANSWERS-Find a PATH that contains each EDGE
exactly once.

-Can be solved in Polynomial Time



What is Rudrata Cycle problem? - ANSWERS-Find a CYCLE that visits each VERTEX
exactly once.

-No Known Polynomial Time algorithm



What is Rudrata Path problem? - ANSWERS-Same as Rudrata cycle except find a
PATH.



What is a P problem? - ANSWERS-P = Polynomial

-A problem that can be solved in Polynomial time.

-There is a Polynomial time algorithm to solve it.



What is a NP problem? - ANSWERS-NP = Non-Deterministically Polynomial

-A problem where the Solution can be VERIFIED in Polynomial-Time



What are differences in P and NP? - ANSWERS-All P problems are in NP but all NP
problems are not in P. P is a subset of NP.

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller Teacher101. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $16.49. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

76462 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
$16.49
  • (0)
  Add to cart