Theoretical Computer Science MCQ : Context Free Grammar and Languages- Grammar, Derivation-Reduction : Link1
Theoretical Computer Science MCQ & Answers
Are you worried about the answers to Theoretical Computer Science questions :Context Free Grammar and Languages- Grammar, Derivation-Reduction? We have arranged the Show Answer button under the each question. Candidates can click on it to know the right option among the given alternatives. Furthermore, the applicants can check our web portal @ www.totalmcq.com to take part in more MCQ on various subject. Wish, the given information about the Theoretical Computer Science MCQ will helpful to the advance and can learn the various types of questions and answers.
Q.1. The entity which generate Language is termed as-----
A. Automata
B. Grammar
C. Tokens
D. Data
Q.2. Production Rule: aAb->agb belongs to which of the following category?
A. Regular Language
B. Context free Language
C. Context Sensitive Language D. Recursively Ennumerable Language
Q.3. The Grammar can be defined as: G=(V, ∑, p, S)
In the given definition, what does S represents?
A. Accepting State
B. Starting Variable
C. Sensitive Grammar D. None of the above
Q.4. Which of the following statement is false?
A. Context free language is the subset of context sensitive language
B. Regular language is the subset of context sensitive language
C. Recursively ennumerable language is the super set of regular language
D. Context sensitive language is a subset of context free language
Q.5. ====Which of the following operation can be applied on regular expressions?
A. Union
B. Concatenation
C. Closure
D. All of the above
Q.6. Regular expressions are used to represent which language?
A. Recursive language
B. Regular language
C. Context free language
D. All of the above.
Q.7. The set of all strings over ∑ = {0,1} in which all strings that beings and ends with 0 is--------
A. 0(0+1)0
B. 00
C. 00(0+1)0
D. 00(0+1)11
Q.8. The set of all strings over ∑ = {a,b} in which all strings that starts with and ends with same letter is--------
A.[a(a+b)*b + b(a+b)*a]
B. [a(a+b)*a + b(a+b)*b]
C. a(a+b)*a
D. b(a+b)*b
Q.9. Which of the following does the given Mealy machine represents?
A. 1’s Complement
B. 2’s Complement
C. 10’s Complement
D. 9’s Complement
Q.10. The number of elements present in the ε-closure(A) in the given diagram.
A. 1
B. 2
C. 3
D. 4
Q.11. Which of the following will not be accepted by the following DFA?
A. ababaabaa
B. abbbaa
C. abbbaabb D. abbaabbaa
Q.12. Which among the following is the missing transition in the given DFA?
L= {xϵ∑= {a, b} | x starts with a and ends with b}
A. δ (q0, a) =q0
B. δ (F, a) =D
C. δ (F, a) =q1
D. δ (q1, a) =D
Q.13. Reverse of a DFA can be formed by----
A. using PDA
B. making final state as non-final
C. making final as starting state and starting state as final state
D. None of the above.
Q.14. The language accepted by this DFA is---
A. b*ab*ab*ab*
B. (a+b)*
C. b*a(a+b)*
D. b*ab*ab*
Q.15. The minimum state automaton equivalent to the below FSA has the following number of states----
A. 1
B. 2
C. 3 D. 4