AMC ENGINEERING COLLEGE, BENGALURU – 560083
(Affiliated to VTU, Belagavi, ACITE Approved, NBA
Accredited)
Department of Computer Science and Engineering
QUESTION BANK
Sem/Subject/Code: 5th/ Theory of Computation /BCS503
Module-1 [CO1]
1. Define the following terms:
a. Alphabets
b. Strings
c. Empty Strings
d. Length of a string
e. Power of an alphabet
f. Concatenation of strings
g. Languages
2. Define DFA (5 tuples). How a DFA processes Strings.
3. Explain the applications of theory of computation
4. Define Transition diagram and Transition Tables with examples.
5. Extended Transition function of DFA and NFA.
6. Language of a DFA and NFA.
7. Practice problem on Construction of DFA
8. Define NFA (5 tuples).
9. Differentiate between DFA and NFA
10. Convert the following NFA to its equivalent DFA using subset construction:
Δ 0 1
->p {p,q} {p}
Q {r} {r}
R {s} Ф
*s {s} {s}
11. Convert the following NFA to its equivalent DFA using Lazy construction:
Δ 0 1
->q0 {q0, q1 } { q1}
*q1 { q2} { q2}
q2 φ { q2}
12. Convert the following NFA to its Equivalent DFA (Practice problem using subset and
Lazy methods )
13. Write the DFA’s for the following language over ∑=(a,b)
a. The set of all strings ending with abb
b. The set of all strings not containing the sub string aab
c. L={a W a|Wє(a+b)*}
14. Define a DFA which accepts odd number of 0’s & odd number of 1’s
15. Practice problems on Converting the following ε −NFA to its Equivalent DFA
16. Design the NFA and ε −NFA for the language.
*************************************************************************
Module-2 [CO2]
1. Define Regular expression. Explain the operators of RE.
2. Practice the problems on writing the RE for the given language. (Refer class
notes)
3. Practice the problems on converting the given FSM to RE using state elimination
method (refer class notes)
4. Practice the problems on converting the given RE to Automata (refer class notes)
5. Practice problems on showing that language is not-regular (pumping lemma)
Automata (refer class notes)
