We have been working very hard since 2009 to facilitate in your learning Read More. We can't keep up without your support. Donate Now.

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More

Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

GDB_CS502 Dated: Aug 06, 15

Dear students CS502 course instructor has announced a GDB for you having following  details:

 

Topic:

“NP, NP-Complete and NP-Hard problems have always efficient Verifiers/Deciders “

 You are required to support or contradict or other logical comments upon  above statement by giving solid reasoning; your comments should not be more than 100 words.

                         

Instructions:

1. Short and to the point comments are required. Marks can be deducted on exceeding 100 Words.

2. Use normal font size.

3. In case of plagiarism you will be marked as ‘Poor’ so don’t copy from internet; write in your own words.

4. Don’t post any comment related to Graded MDB on regular MDBs’

5. Don’t send comments via email, it will not be accepted in any case.

6. You can post your comments on 12-08-2015 and 13-08-2015.

Note:This topic has been selected for your better preparations in  this course and for all testing systems even for your professional life.


+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)


Views: 3212

Replies to This Discussion

In Simple Words,

 

  • NP-Class--- It is a set of decision problems that are not solvable but are verifiable in polynomial time

 

  • NP Complete--- It is one of the decision problem that belong to NP Class and all the problems in NP Class can be reduced to this problem..
  • Implies that if this problem is solvable in polynomial time then all other NP Problems can be solved in Polynomial time..

 

  • NP Hard--- NP Hard Contains those problems which may or may not belong to NP-Class but are all reducible to NP Class problem..
  • It Simply means that there are some problems like set of optimization problem that are harder to solve then NP class.. All those problems which are not decision problems and are not solvable in Polynomial Time Belong the This Set...
  • Implies that if this kind of a problem is solvable in polynomial time then all other NP class problems will be solved in Polynomial Time...

good efert

Some problems can be translated into one another in such a way that a fast solution to one problem would automatically give us a fast solution to the other. There are some problems that every single problem in NP can be translated into, and a fast solution to such a problem would automatically give us a fast solution to every problem in NP. This group of problems are known as NP-Hard. Some problems in NP-Hard are actually not themselves in NP; the group of problems that are in both NP and NP-Hard is called NP-Complete.

well don bro . keep it up

krna kia hy.... NP, NP-compelete ...... in sab koexplain krna hy ya in ka relation btanan hy ya phir defference smj nai arha some one please help

I think, we just need to explain, as it is mentioned that, words should not be more than 100 words.

The question is --> You are required to support or contradict or other logical comments upon  above statement by giving solid reasoning;
The statement is -->
“NP, NP-Complete and NP-Hard problems have always efficient Verifiers/Deciders “
So, we have to explain whether the NP, NP-Complete and NP-Hard problems have always efficient Verifiers/Deciders or not, with solid reason.

koi samaj nai a rahi plzzzzzzzzz help krain time bohat kam ha 

could anyone please upload final solution . 

plzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz share right solution as soon as possibal 

RSS

Latest Activity

+M.Tariq Malik replied to +M.Tariq Malik's discussion CS508 Assignment 01 Fall 2020 Solution / Discussion in the group CS508 Modern Programming Languages
15 minutes ago
+M.Tariq Malik replied to +M.Tariq Malik's discussion CS508 Assignment 01 Fall 2020 Solution / Discussion in the group CS508 Modern Programming Languages
16 minutes ago
Profile IconDaNeRouS SiDdO and Shan Babar joined +M.Tariq Malik's group
24 minutes ago
+M.Tariq Malik replied to Waseem Aziz's discussion MGMT617 - Production Planning and Inventory Control GDB No. 1 Monday, November 30, 2020
40 minutes ago
+M.Tariq Malik replied to Waseem Aziz's discussion MGMT617 - Production Planning and Inventory Control GDB No. 1 Monday, November 30, 2020 in the group MGMT617 Production Planning and Inventory Control
40 minutes ago
+M.Tariq Malik liked Waseem Aziz's discussion MGMT617 - Production Planning and Inventory Control GDB No. 1 Monday, November 30, 2020
41 minutes ago
+M.Tariq Malik liked Waseem Aziz's discussion MGMT617 - Production Planning and Inventory Control GDB No. 1 Monday, November 30, 2020
41 minutes ago
+M.Tariq Malik liked shifa arshad's discussion BOOKS FOR SALE IN HALF PRICE
41 minutes ago
иαвєєℓ αнмє∂ joined +M.Tariq Malik's group
48 minutes ago
Profile IconL00seRr, Arslan haider saddiqi, Sheraz Munir and 14 more joined Virtual University of Pakistan
53 minutes ago
+M.Tariq Malik replied to Imtiaz Waqar's discussion COST AND MANAGEMENT ACCOUNTING (MGT402) ASSIGNMENT NO. 01 in the group MGT402 Cost & Management Accounting
54 minutes ago
+M.Tariq Malik replied to +M.Tariq Malik's discussion CS402 Assignment 01 Fall 2020 Solution / Discussion in the group CS402 Theory of Automata
1 hour ago

Looking For Something? Search Here

© 2020   Created by +M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.