Home > BCA > Quizzes > Theory Of Computation
Theory Of Computation
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 26% Most missed: “Consider the following right-linear grammar G = (N, T, P, S) N = {S} P : S ?”
Theory Of Computation
Time left 00:00
23 Questions

1. Which of the following statement is wrong?
2. R1 and R2 are regular sets. Which of the following is not true?
3. Which of the following denotes Chomskian hiearchy?
4. Recursively enumerable languages are not closed under
5. baa*c denotes the set
6. Recursively enumerable languages are not closed under
7. Which one of the following statement is FALSE?
8. (a + b)(cd)*(a + b) denotes the following set
9. (a + b)(cd)*(a + b) denotes the following set
10. Which of the following strings is not generated by the following grammar? S ? SaSbS|e
11. Which of the following problem is undecidable?
12. Consider the following right-linear grammar G = (N, T, P, S) N = {S} P : S ? aS|aA T = {a, b}A? bA|b Which of the following regular expression denotes L(G)?
13. R1 and R2 are regular sets. Which of the following is not true?
14. Which of the following regular expressions denotes a language comprising of all possible strings over S = {a, b} of length n where n is a multiple of 3.
15. The concept of FSA is much used in this part of the compiler
16. Palindromes can
17. The concept of grammar is much used in this part of the compiler
18. Which of the following denotes Chomskian hiearchy?
19. Which of the following statement is wrong?
20. Which one of the following statement is FALSE?
21. A language L is accepted by a FSA iff it is
22. Consider a language L for which there exists a Turing machine
23. Which of the following is not primitive recursive but partially recursive?