Home Previous Year GATE CSE

Menu

Home Previous Year

GATE CSE

All subjects Operating Systems132 DBMS122 Computer Networks142 Algorithms128 Programming & Data Structures195 Theory of Computation122 Compiler Design95 Computer Organization & Architecture131 Digital Logic91 Discrete Mathematics133 Engineering Mathematics139 General Aptitude260

Coming soon

BookmarksSoon

My progressSoon

PYQ Hub · Previous year questions, organised for practice.Every question lists its source.

NP-Completeness (Algorithms): GATE CSE PYQs | PYQ Hub

Operating Systems132

Computer Networks142

Programming & Data Structures195

Theory of Computation122

Compiler Design95

Computer Organization & Architecture131

Digital Logic91

Discrete Mathematics133

Engineering Mathematics139

General Aptitude260

Home
Previous Year
GATE
CSE
Algorithms
NP-Completeness

GATE CSE previous year questions · Algorithms

NP-Completeness

6 questions

Filters & sort1

FiltersClear all

Year

2015 2014 2013 2012

Set

Set 1 Set 2 Set 3

Marks

Question type

1

GATE CSE 2012 | Question 4

NP-Completeness

MCQ1 mark

Assuming

P \neq NP

, which of the following is TRUE?

Single correct

Answer key coming soon

Source: GATE CSE 2012. Official question paper (booklet code A).

Use ← → to move

Questions

1 total

Correct Wrong Answer seen

FiltersClear all

Year

2015 2014 2013 2012

Set

Set 1 Set 2 Set 3

Marks

Question type