👁️ 60 views
University of Barishal Logo

University of Barishal

Department of Computer Science and Engineering

1st Mid Exam

Course Title: Theory of Computation (CSE-3203)

Semester: 6th | Session: 19-20

Time: 50 minutes | Marks: 50.00

Course Teacher: Dr. Md Manjur Ahmed

1.


1) What is Automata Theory? Describe the applications of Finite Automata.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
6 Marks
2) Explain the work of lexical analyzer with an on/off switch.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
3 Marks
3) Analyze the terms: Theorems, Lemmas and Corollaries.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
6 Marks
4) Construct a NFA for the following: Strings where the first symbol is present somewhere later on at least once.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
5 Marks
5) Build an NFA for the following language: L = { w | w ends in 101}

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
10 Marks
6) Convert the NFA from Question 5, to DFA. Question-5: Build an NFA for the following language: L = { w | w ends in 101}

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
5 Marks
7) Build an ε-NFA for the following language: L = {w | w is empty, or if non-empty will end in 11}

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
5 Marks
8) Convert ε-NFA to DFA based on Question 7. Question-7: Build an ε-NFA for the following language: L = {w | w is empty, or if non-empty will end in 11}

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
10 Marks

... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ...

Contributors of this Question:

Role Name Date
Prepared By (Teacher): Dr. Md Manjur Ahmed N/A
Uploaded By: Onebyzero Edu (Test User) July 30, 2024, 6:35 p.m.
Converted By (Img/PDF to Text): Baishakhi Bir Nov. 19, 2025, 12:47 p.m.
Reviewed By: Obaydul Hasan Nayeem Nov. 19, 2025, 5:29 p.m.