Time Left - 06:00 mins
BARC CS 2018 Nuclear Quiz -2 (TOC)
Attempt now to get your rank among 583 students!
Question 1
Given the following grammars:
Which of the following is correct?
Which of the following is correct?
Question 2
The regular grammar for the language 
is given by:
(Assume, p, q, r and s are non-terminals)
is given by: (Assume, p, q, r and s are non-terminals)
Question 3
Consider the following statements:
I. Recursive languages are closed under complementation.
II. Recursively enumerable languages are closed under union.
III. Recursively enumerable languages are closed under complementation.
Which of the above statements are true?
I. Recursive languages are closed under complementation.
II. Recursively enumerable languages are closed under union.
III. Recursively enumerable languages are closed under complementation.
Which of the above statements are true?
Question 4
Let L1 be a recursive language and L2 be a recursive enumerable language. Then L2 – L1 is?
Question 5
Find the solution for the following instance of post correspondence problem. Let ∑ = {0, 1}. Let X and Y be lists of three strings as follows:
- 583 attempts
- 1 upvote
- 8 comments
Jul 14GATE & PSU CS
