Register
Dark Mode

Are questions on computational complexity completely out of Gate 2016 syllabus?
[closed]

in Others closed by
366 views
0 votes
0 votes
closed with the note: Solved via comment
I want to know whether the problems on NP, P, NP-Hard, NP-complete are completely out of Gate 2016 syllabus?
in Others closed by
by
366 views

1 comment

by
Shouldn't really matter- once you study decidability for TOC, this area is already covered. Meanwhile problems using known NPC problems wouldn't be there.
1
1
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4 votes
4 votes
1 answer
1
shikharV asked in Digital Logic Dec 5, 2015
665 views
Is this question part of syllabus?
Given answer: B
shikharV asked in Digital Logic Dec 5, 2015
by shikharV
665 views
0 votes
0 votes
0 answers
2
Kathleen asked in Others Oct 8, 2014
327 views
GATE CSE 1995 | Question: 10
Kathleen asked in Others Oct 8, 2014
by Kathleen
327 views
0 votes
0 votes
0 answers
3
Kathleen asked in Others Oct 8, 2014
428 views
GATE CSE 1995 | Question: 2.11
Kathleen asked in Others Oct 8, 2014
by Kathleen
428 views
2 votes
2 votes
0 answers
4
Kathleen asked in Others Oct 8, 2014
1,151 views
GATE CSE 1995 | Question: 1.13
Kathleen asked in Others Oct 8, 2014
by Kathleen
1.2k views

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

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

Developed by Chun
Link Copied!