Time Left - 06:00 mins
BARC CS 2018 Nuclear Quiz -1 (TOC)
Attempt now to get your rank among 807 students!
Question 1
No, Recursively enumerable languages are closed under intersection, Please check the following link. Recently, there is also a question based on that in Gate CSE 2018 Paper.
Given the following two statements:
If 
and 
are recursively enumerable languages over 
then 
and 
are also recursively enumerable.
The set of recursively enumerable languages is countable.
Which of the following is correct?
If and are recursively enumerable languages over then and are also recursively enumerable. The set of recursively enumerable languages is countable. Which of the following is correct?
Question 2
Which of the following regular expression identities are true?
Question 3
Given the following statements:
(i) Recursive enumerable sets are closed under complementation.
(ii) Recursive sets are closed under complementation.
Which is/are the correct statements?
(i) Recursive enumerable sets are closed under complementation.
(ii) Recursive sets are closed under complementation.
Which is/are the correct statements?
Question 4
Consider the following statements:
1. Turing machine is more powerful than finite automata
2. Turing machine is more powerful than push down automata
Which one of the above statement is true?
1. Turing machine is more powerful than finite automata
2. Turing machine is more powerful than push down automata
Which one of the above statement is true?
Question 5
A is recursively enumerable and Complement of A is also recursively enumerable iff A is ____
- 807 attempts
- 6 upvotes
- 16 comments
Mar 31GATE & PSU CS
