We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

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.

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 3157

.

+ 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)

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

Taiba Rajput joined + M.Tariq Malik's group
37 minutes ago
+"Mission Impossible"++ replied to + "αяsαℓ " Ќąƶµяɨ •"'s discussion The World's most expensive Proposal
38 minutes ago
+"Mission Impossible"++ liked + "αяsαℓ " Ќąƶµяɨ •"'s discussion The World's most expensive Proposal
39 minutes ago
+"Mission Impossible"++ liked +Umar Amin+'s discussion Happy Birthday to my sweet and lovely friend mmm
39 minutes ago
Taiba Rajput liked + M.Tariq Malik's group IT430 E-Commerce
44 minutes ago
Taiba Rajput joined + M.Tariq Malik's group
46 minutes ago
M. Umair Shahid left a comment for Sami
49 minutes ago
+ Iuuoɔǝut + posted videos
1 hour ago
Profile IconTalha Asad, MUHAMMAD SALMAN, FIDA MUHAMMAD KHAN and 9 more joined Virtual University of Pakistan
1 hour ago
MUHAMMAD SALMAN liked Noorfatima's profile
1 hour ago
+ ! ❤️ ░S░I░N░G░E░R liked + ! ! ! ! ! MySterIouS's discussion ~ Khoobsorat Ahsaas ~
3 hours ago
+ ! ! ! ! ! MySterIouS posted a discussion
3 hours ago
+ ! ! ! ! ! MySterIouS replied to + Iuuoɔǝut +'s discussion Phly Dosti phir mohabbat ......
3 hours ago
+ ! ! ! ! ! ! BLaiRe ! !+ replied to +Umar Amin+'s discussion Happy Birthday to my sweet and lovely friend mmm
4 hours ago
+ ! ! ! ! ! ! BLaiRe ! !+ liked +Umar Amin+'s discussion Happy Birthday to my sweet and lovely friend mmm
4 hours ago
彡Tweety彡 ❤️ replied to + "αяsαℓ " Ќąƶµяɨ •"'s discussion The World's most expensive Proposal
6 hours ago
彡Tweety彡 ❤️ replied to + Iuuoɔǝut +'s discussion Phly Dosti phir mohabbat ......
7 hours ago
KAMRAN replied to + M.Tariq Malik's discussion MGT611 Assignment No 01 Fall 2019 Solution & Discussion Due Date: 14-11-2019 in the group MGT611 Business & Labor Law
7 hours ago
+ Abb@s replied to + Iuuoɔǝut +'s discussion Phly Dosti phir mohabbat ......
7 hours ago
Profile IconKAMRAN and kiran ashraf joined + M.Tariq Malik's group
7 hours ago

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

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