Register
Dark Mode

P NP completeness

in Theory of Computation
1,609 views
0 votes
0 votes
Problems related to P-NP completeness are covered in syllabus or not (either in TOC or ALGO)?
in Theory of Computation
by
1.6k views

2 Comments

by
Yes they are along with decision problems in TOC
1
1
by
Yes,it is removed from algo but it is in TOC
0
0

1 Answer

1 vote
1 vote
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.
by
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
Saiman asked in GATE Apr 24, 2018
1,179 views
Np completeness
Is np completeness in syllabus in the new gate CSE syllabus and is it really important for gate CSE examination ?
Saiman asked in GATE Apr 24, 2018
by Saiman
1.2k views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

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

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!