Register

NIELIT 2021 Dec Scientist B - Section B: 46

• recategorized by
4,700 views

2 Answers

0 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)

 

0 0 votes

 

@Kabir5454

 

(A) NP …

 

NP problems are called as non-deterministic polynomial problems...

They are a class of decision problems that can be solved using NP algorithms…

 

 

Voting & Accepting an answer helps improve the community
Answer:
← Previous · NIELIT 2021 Dec Scie...Next → · NIELIT 2021 Dec Scie...
← Previous in category · NIELIT 2021 Dec Scie...Next in category → · NPTEL Assignment Que...
Position:
Show:

Related questions

0 0 votes
1 1 answer
399
399 views
soujanyareddy13 asked Jan 9, 2022
399 views
NIELIT 2021 Dec Scientist A - Section B: 74
Assume that $\text{P}$ and $\text{NP}$ are different i.e. $\text{P! = NP}$ then for the expression $\text{NP-Complete} \cap \text{P} = ?$ Which among the following is cor...
0 0 votes
1 1 answer
933
933 views
soujanyareddy13 asked Dec 7, 2021
933 views
NIELIT 2021 Dec Scientist B - Section B: 52
A language $\text{L}$ is recognizable by a turing machine $\text{M}$ if and only if $\text{L}$ is a _____________ language.Type $0$Type $1$Type $2$Type $3$
0 0 votes
0 0 answers
529
529 views
soujanyareddy13 asked Dec 7, 2021
529 views
NIELIT 2021 Dec Scientist B - Section B: 80
The following grammer is an example of _____________ .$\text{A} \rightarrow \text{a A B C}$$\text{CB} \rightarrow \text{ B c}$$\text{A} \rightarrow \text{a b c}$$\text{ b...
0 0 votes
1 1 answer
514
514 views
soujanyareddy13 asked Dec 7, 2021
514 views
NIELIT 2021 Dec Scientist B - Section B: 112
$\text{(a+b)}^{2}$ corresponds to the language $:$$\text{ \{a+b, a+b\} }$$\text{ \{aa, ab, ba, bb\} }$$\text{ \{abab, baba\} }$$\text{ \{a+b}, \text{(a+b)}^{2}\} $