Theory of Computation Remedial MCQs 1
Q: The trees which represent derivations in a CFG are called ________.
- A: Both b & c
- B: Parse tree
- C: Derivation tree
- D: None
Q: Context Free Grammars has ________tuples
Q: A grammar is said to be ambiguous grammar if it ________.
- A: produces more than one derivation tree
- B: All
- C: produces more than one left most derivation
- D: produces more than one right most derivation
Q: The regular expression of language which is starting and ending with different symbols is _____.
- A: a(a+b)*b + b(a+b)*a
- B: a(a+b)*b
- C: b(a+b)*a
- D: All
Q: L={ε, a, aa, aaa, aaaa,……..} is represented by ____ .
- A: Both a & b
- B: a+
- C: a*
- D: None
Q: The generators of languages are ______ .
- A: FSM
- B: Regular expression
- C: Grammars
- D: All
Q: Transition function of ε-NFA machine is given by.
- A: Q x Σ -> Σ
- B: Q x Σ U {ε} -> 2 power Q
- C: Σ x Q -> Σ
- D: Q x Σ U {ε} -> Q
Q: ε-closure of state is combination of self state and ______.
- A: ε-reachable state
- B: initial state
- C: Final state
- D: None
Q: Backtracking is allowed in
- A: DFA
- B: NDFA
- C: None
- D: Both a & b
Q: Transition function of NFA machine is given by.
- A: Q x Σ -> 2 power Q
- B: Q x Σ -> Q
- C: Σ x Q -> Σ
- D: Q x Σ -> Σ