NIELIT 2021 Dec Scientist B - Section B: 46
in Others edited by
133 views
0 votes
0 votes

  _________ is the class of decision problems that can be solved by non-deterministic polynomial algorithms.

  1. $\text{NP}$
  2. $\text{P}$
  3. Hard
  4. Complete
in Others edited by
133 views

1 comment

Answer:A
0
0

Subscribe to GO Classes for GATE CSE 2022

1 Answer

0 votes
0 votes

option C :- It is NP .

NP class deals with problems which can be solved in non deterministic polynomial algorithm.

Ref: https://en.wikipedia.org/wiki/NP_(complexity)

 

Related questions