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. Palindromes can
2. Consider a language L for which there exists a Turing machine
3. R1 and R2 are regular sets. Which of the following is not true?
4. Which of the following strings is not generated by the following grammar? S ? SaSbS|e
5. Which of the following denotes Chomskian hiearchy?
6. The concept of FSA is much used in this part of the compiler
7. Recursive languages are
8. Which of the following regular expression identity is true?
9. 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.
10. 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)?
11. baa*c denotes the set
12. Can a DFSA simulate a NFSA
13. Consider the following statements . Recursive languages are closed under complementation "I. Recursively enumerable languages are closed under union "II. Recursively enumerable languages are closed under complementation "hich of the above statement are TRUE?"
14. (a + b)(cd)*(a + b) denotes the following set
15. Which of the following is not primitive recursive but partially recursive?
16. The concept of grammar is much used in this part of the compiler
17. Recursively enumerable languages are not closed under
18. Which of the following statement is wrong?
19. A language L is accepted by a FSA iff it is
20. Which of the following problem is undecidable?
21. The set of all strings over the alphabet S = {a, b} (including e) is denoted by
22. Which of the following conversion is not possible (algorithmically)?
23. Which one of the following statement is FALSE?