menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
Recent Posts
Barc Interview Experience 2020- CSE stream
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
hi this pdf have gate prevoius year questions or...
Thanks, dude for sharing your experience !! It...
Congratulations, at least you made it to the...
seems like you really enjoyed the process.......
I wrote an email to IISC regarding JEST 2021 but...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
MadeEasy Test Series 2018: Theory of Computation - Non Determinism
1
vote
108
views
isn't the ans is 3 i.e p,q,r
theory-of-computation
non-determinism
made-easy-test-series
madeeasy-testseries-2018
asked
Jan 17, 2018
in
Theory of Computation
Sukhdip Singh
edited
Mar 5, 2019
by
ajaysoni1924
108
views
answer
comment
0
Yes ! Correct answer is $3$ i think they have omitted $'p'$ which should also be included.
0
thanks!!
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
2
votes
0
answers
1
101
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 language cannot be commutative until atleast one of them is ‘Φ’ or ‘∈’. Which of the following is correct?
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 language cannot be commutative until atleast one of them is ‘Φ’ or ‘∈’. Which of the following is correct?
asked
Jan 17, 2018
in
Theory of Computation
Sukhdip Singh
101
views
made-easy-test-series
theory-of-computation
decidability
madeeasy-testseries-2018
3
votes
0
answers
2
1.4k
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) Undecidable and RE (C) Undecidable and non RE (D) Decidable but RE
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) Undecidable and RE (C) Undecidable and non RE (D) Decidable but RE
asked
Jan 12, 2018
in
Theory of Computation
Bhavya Bhatia
1.4k
views
theory-of-computation
turing-machines
decidability
madeeasy-testseries-2018
3
votes
1
answer
3
655
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 may not be a distributive lattice. Which of the following is/are ... D as per the solution my doubt is a lattice can be semi bounded and not Bounded then why S1 is true.
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 may not be a distributive lattice. Which of the following is/are true? A.) S1 and S2 only B.)S2 and ... S2 and S3 Answer is D as per the solution my doubt is a lattice can be semi bounded and not Bounded then why S1 is true.
asked
Jan 12, 2018
in
Set Theory & Algebra
ashish pal
655
views
made-easy-test-series
set-theory&algebra
lattice
madeeasy-testseries-2018
6
votes
2
answers
4
291
views
MadeEasy Test Series 2018: Graph Theory - Graph Coloring
answer given is 4. Please provide a detailed solution.
answer given is 4. Please provide a detailed solution.
asked
Jan 11, 2018
in
Graph Theory
kapilbk1996
291
views
graph-theory
graph-coloring
made-easy-test-series
madeeasy-testseries-2018
...