Register

MadeEasy Test Series 2018: Theory of Computation - Non Determinism

• edited by
705 views
1 1 vote

isn't the ans is 3 i.e p,q,r

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · False Essential Prim...Next → · Test series
← Previous in category · #test_seriesNext in category → · Closure property
Position:
Show:

Related questions

3 3 votes
0 0 answers
1.2k
1.2k views
Sukhdip Singh asked Jan 16, 2018
1,160 views
MadeEasy Test Series 2018: Theory of Computation - Decidability
Consider the following statements:S1 : Let L be language, reversal of language L cannot contain any string present in ‘L’ except ‘∈’.S2 : Concatenation of two different l...
4 4 votes
0 0 answers
3.8k
3.8k views
Bhavya Bhatia asked Jan 11, 2018
3,849 views
MadeEasy Test Series 2018: Theory of Computation - Turing Machine
Consider the following language over Σ = {0, 1}:L = {<M>|M is TM that accept all strings of length at most 5}Which of the following is true?(A) Decidable and REC(B) Undec...
3 3 votes
1 1 answer
2.3k
2.3k views
ashish pal asked Jan 12, 2018
2,269 views
MadeEasy Test Series 2018: Set Theory & Algebra- Lattice
Consider statements:S1 : A finite lattice is always bounded.S2 : Complemented lattice is a proper subset of bounded lattice.S3 : A bounded and complemented lattice may or...
8 8 votes
2 2 answers
1.2k
1.2k views
kapilbk1996 asked Jan 11, 2018
1,163 views
MadeEasy Test Series 2018: Graph Theory - Graph Coloring
Consider the following graph: Which of the following will represents the chromatic number of the graph?answer given is 4.Please provide a detailed solution.