1,605 views
0 votes
0 votes
Problems related to P-NP completeness are covered in syllabus or not (either in TOC or ALGO)?

1 Answer

1 votes
1 votes
Complexity classes is not present in gate syllabus from year 2016. Better not to leave this topic because tir,isro,and other exams this topic is in syllabus. Sometimes it is possible to ask in gate if they assume implicit topic in algorithms and toc.

Related questions

0 votes
0 votes
2 answers
1
Saiman asked Apr 24, 2018
1,169 views
Is np completeness in syllabus in the new gate CSE syllabus and is it really important for gate CSE examination ?
0 votes
0 votes
0 answers
2
1 votes
1 votes
1 answer
3
Rhythm asked Apr 20, 2019
1,087 views
What will be the answer to this question? L’ is the complement of language L belongs to NP does not always imply thatL’ belongs to NPL’ belongs to P both a and b
0 votes
0 votes
2 answers
4
Rhythm asked Apr 18, 2019
1,175 views
Are p and np languages all recursive? Because p and np both correspond to languages which have algorithms and algorithms means that there is a halting turning machine(eit...