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


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: 3214

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

+ ᴄᴏғғᴇᴇ updated their profile
2 minutes ago
Rizwan Mushtaq joined +M.Tariq Malik's group
18 minutes ago
Arooj Shahid liked 乇メ-丂イひり3刀イ.'s discussion *** My Drawing ***
38 minutes ago
Arooj Shahid liked 乇メ-丂イひり3刀イ.'s discussion *** الوداع اردو ***
39 minutes ago
Arooj Shahid liked Miss. Churhail's discussion LOVE YOUR LIFE!!!!!
39 minutes ago
Arooj Shahid liked Hafiza Tehreem Fatima's discussion BIRTHDAY CELEBRATION OUR BELOVED <MEMBER SARAH ABDUL
39 minutes ago
Arooj Shahid liked Omar's discussion Dua
39 minutes ago
+!!! ❤️ Shadow Girl❤️!!! liked 乇メ-丂イひり3刀イ.'s discussion *** الوداع اردو ***
1 hour ago
+!!! ❤️ Shadow Girl❤️!!! liked Hafiza Tehreem Fatima's discussion BIRTHDAY CELEBRATION OUR BELOVED <MEMBER SARAH ABDUL
1 hour ago
+M.Tariq Malik replied to +M.Tariq Malik's discussion MGT201 Financial Management GDB No 01 Fall 2020 Solution / Discussion in the group MGT201 Financial Management
1 hour ago
+M.Tariq Malik replied to +M.Tariq Malik's discussion MGT201 Financial Management GDB No 01 Fall 2020 Solution / Discussion in the group MGT201 Financial Management
1 hour ago
Profile IconSaba Shahzadi, waqar, Hammad Syed and 13 more joined Virtual University of Pakistan
1 hour ago
+M.Tariq Malik replied to +M.Tariq Malik's discussion ENG001 Elementary English GDB No 01 Fall 2020 Solution / Discussion Last Date: 04-12-2020 in the group ENG001 Elementary English
1 hour ago
Miss. Churhail liked Omar's discussion Dua
2 hours ago
+ "Տehɑr" liked Omar's discussion Dua
2 hours ago
+_iiffiiiiiii_+ updated their profile
2 hours ago
+_iiffiiiiiii_+ liked +_iiffiiiiiii_+'s profile
2 hours ago
HAFIZA AREESHA ASLAM replied to +M.Tariq Malik's discussion SOC101 Introduction to Sociology Assignment 01 Fall 2020 Solution / Discussion in the group SOC101 Introduction to Sociology
2 hours ago
Ifra Malik joined +M.Tariq Malik's group
3 hours ago
+M.Tariq Malik replied to +M.Tariq Malik's discussion MGT402 Solved MCQs Online Quiz No 01 Fall 2020 Solution / Discussion Last Date: 08-12-2020 in the group MGT402 Cost & Management Accounting
3 hours ago

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

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

.