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

www.vustudents.ning.com

 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

# SOLUTION OF GDB CS502 DUE DATE 13 AUG 2015

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

Views: 3201

.

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

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

### 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

plzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz share right solution as soon as possibal

## Latest Activity

Noor ijaz and M. Haris are now friends
6 minutes ago
51 minutes ago
Mani Siddiqui BS VIII posted a status
""___زندگی بڑی عجیب ہے کبھی گُلزار سی، کبھی بیزار سی"
55 minutes ago
Hina liked Muhammad Shahid Javed's profile
1 hour ago
مخلص posted a discussion

### Pixel 4A. Excellent Phone but not for Pakistan

1 hour ago
sabir khan posted a discussion

### please stand for unblocking of LMS accounts

1 hour ago
LILY replied to LILY's discussion HAPPY INDEPENDENCE DAY
1 hour ago
LILY replied to LILY's discussion HAPPY INDEPENDENCE DAY
1 hour ago
M. Haris liked Naaz Bajwa's profile
1 hour ago
M. Haris updated their profile
2 hours ago
Bilal joined +M.Tariq Malik's group

### MTH202 Discrete Mathematics

3 hours ago
9 hours ago
10 hours ago
10 hours ago
10 hours ago
zohaib iftikhar posted discussions
10 hours ago
Muhammad Bilal liked zohaib iftikhar's discussion ...* SUNO ...SUNO NA!...*
10 hours ago
10 hours ago
10 hours ago
10 hours ago

1

2

3