The Gateway to Computer Science Excellence
0 votes
337 views
in Algorithms by | 337 views

2 Answers

+4 votes
Best answer

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.

by
selected by
+2 votes
Yes you need to study P, NP computational problems
by
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,345 questions
60,472 answers
201,800 comments
95,278 users