Register

Do i need to study P, NP computational problems like vertex cover problem also for gate 2015 or only the basic definitions?

1,204 views

2 Answers

Best answer
4 4 votes

You would need to know some examples (not all) of NP Complete problems and why they are NP Complete. For example 3SAT problem is NPC and in GATE they have asked about 2SAT. So, just learning some examples won't be enough.

• selected by
Voting & Accepting an answer helps improve the community
← Previous · If anybody have some...Next → · GATE CSE 2003 | Ques...
Next in category → · What could be the re...
Position:
Show:

Related questions

0 0 votes
1 1 answer
913
913 views
Prashant Sharma asked Jan 18, 2016
913 views
What sub-topics do I need to study to cover Turing machines and Undecidability ?
Do I need to study basic concepts of complexity classes (P, NP , NP-Hard...reduction etc.) ?
0 0 votes
1 1 answer
731
731 views
Priyansh_Srivastava asked Jul 31, 2025
731 views
From where to start study for free ?
I am final year btech cse student. i want to do GATE prep from free resources but i am not able to find the best platform or any best youtube channel who is providing bes...