CSC 3113: THEORY OF COMPUTATION

AMERICAN INTERNATIONAL UNIVERSITY-BANGLADESH

(AIUB)
Faculty of Science and Technology (FST)
Department of Computer Science (CS)
Undergraduate Program

COURSE PLAN SEMESTER: Fall 2024-2025

I. Course Code and Title: V. Vision:
CSC 3113 Theory of Computation Our vision is to be the preeminent Department of Computer Science
II. Credit: through creating recognized professionals who will provide innovative
solutions by leveraging contemporary research methods and development
3 Hour Theory per week
techniques of computing that is in line with the national and global
III. Nature context.
Core Course for CSE
IV. Prerequisite VI. Mission:
CSC 2211 Algorithms The mission of the Department of Computer Science of AIUB is to
educate students in a student-centric dynamic learning environment; to
provide advanced facilities for conducting innovative research and
development to meet the challenges of the modern era of computing, and
to motivate them towards a life-long learning process.

VII - Course Description:

 Understanding the notations used in computer science literature.

 Understanding the mathematical model of Computation.
 Use of Computational models to solve problems.
 Understanding Computability
 Determining Complexity of problems

VIII - Course outcomes (CO) Matrix:

By the end of this course, students should be able to:

COs* CO Description Level of PO
Domain*** Assessed
C P A ****
CO1 Demonstrate different computational model and mathematical notations 3 PO-a-2
CO2 Use original example of different computational model and mathematical
3 PO-a-2
notations
CO3 Illustrate a solution for a complex problem using the principles of
** 4 PO-c-3
existing computational models
CO4 Explain the principles of existing computational model and use it to find
** 4 PO-l-2
a new solution.
C: Cognitive; P: Psychomotor; A: Affective Domain
* CO assessment method and rubric of COs assessment is provided in later section
** COs will be mapped with the Program Outcomes (POs) for PO attainment
*** The numbers under the ‘Level of Domain’ columns represent the level of Bloom’s Taxonomy each
CO corresponds to.
**** The numbers under ‘PO Assessed’ column represent the POs each CO corresponds to.

© Dept. of Computer Science, FST, AMERICAN INTERNATIONAL UNIVERSITY-BANGLADESH (AIUB) Page 1 of 7

CSC 3113: THEORY OF COMPUTATION

IX - Topics to be covered in the class and/or lab *

Time CO Topics Teaching Assessment

Frame Mapped Activities Strategy(s)
Week 1 CO1, CO2 Mission & Vision of AIUB, Discussion on Mission & Vision
OBE Guidelines and of AIUB, Introduction to Theory
assessment policies, of Computation Review of Pre-
Basic Mathematical Concepts requisite study materials,
Finite Automaton, perform of exercises
Deterministic Finite
Automaton (DFA)
Week 2 CO3, Discussion, Group study and Group study,
CO4 DFA perform of exercises, PPT slides, Homework, Quiz
board work.
Week 3 Discussion, Group study and
Non-determinism and non-
CO4 perform of exercises, PPT slides,
regular languages
board work.
Week 4 CO1, CO2 Discussion, Group study and Pop Quiz, Class
perform of exercises discussion, question
Regular Expression
answer session,
Homework
Week 5 CO1, CO2 Discussion, Group study and Pop Quiz, Class
perform of exercises discussion, question
Regular Expression
answer session,
Homework
Week 6 CO3 Context Free Grammer Discussion, Group study and Quiz, Class
perform of exercises, PPT slides, discussion, question
board work answer session
Week 7 Context Free Grammer, Discussion, Group study and
Ambiguity perform of exercises, PPT slides,
board work
Midterm (Week 8
Ambiguous Grammar,
Week 9 Discussion, Group study and Pop Quiz, Class
Chomsky Normal Form,
perform of exercises, PPT slides, discussion, question
board work answer session
Week 10 Discussion, Group study and Pop Quiz, Class
Push Down Automata,
perform of exercises, PPT slides, discussion, question
Review
board work answer session
Week 11 Discussion, Group study and Pop Quiz, Class
Turing Machine perform of exercises, PPT slides, discussion, question
board work answer session
Week 12 Turing Machine Discussion, Group study and Pop Quiz, Class
perform of exercises, PPT slides, discussion, question
board work answer session
Week 13 Turing Machine Discussion, Group study and Quiz, Class
perform of exercises, PPT slides, discussion, question
board work answer session
Week 14 Turing Machine Discussion, Group study and Quiz, Class
perform of exercises, PPT slides, discussion, question
board work answer session
Week 15 Decidability and Discussion, Group study and Quiz, Class
Undecidability perform of exercises, PPT slides, discussion, question
© Dept. of Computer Science, FST, AMERICAN INTERNATIONAL UNIVERSITY-BANGLADESH (AIUB) Page 2 of 7
CSC 3113: THEORY OF COMPUTATION

board work answer session

Final term (Week 16)
* The faculty reserves the right to change, amend, add, or delete any of the contents.

X - Mapping of PO to Courses and K, P, A

PO
PO Indicators Definition
Indicator Domain K P A
(As per the requirement of WKs)
ID
Apply information and concepts of mathematics with the Cognitive Level 3
PO-a-2 K2
familiarity of issues. (Applying)
Develop computer science and engineering solutions that P1
Cognitive Level 4
PO-c-3 meet specified needs with appropriate environmental K5 P2
(Analyzing)
considerations. P6
Seek and use resources in solving computer science and Affective Level 4
PO-l-2
engineering problems. (Organizing)

XI – K, P, A Definitions

Indicator Title Description

K2 Conceptual based Conceptually based mathematics, numerical analysis, statistics and the formal
mathematics aspects of computer and information science to support analysis and modeling
applicable to the discipline
K5 Engineering Design Knowledge that supports engineering design in a practice area
P1 Depth of knowledge Cannot be resolved without in-depth engineering knowledge at the level of one
required or more of K3, K4, K5, K6 or K8 which allows a fundamentals-based, first
principles analytical approach
P2 Range of conflicting Involve wide-ranging or conflicting technical, engineering, and other issues
requirements
P6 Extent of stakeholder Involve diverse groups of stakeholders with widely varying needs
involvement and
conflicting requirements

XII – Mapping of CO Assessment Method and Rubric

The mapping between Course Outcome(s) (COs) and The Selected Assessment method(s) and the mapping between
Assessment method(s) and Evaluation Rubric(s) is shown below:

Mapped Assessment Assessment

COs Description
POs Method Rubric
CO1 Demonstrate different computational model and Quiz Rubric for Quiz
PO-a-2
mathematical notations
CO2 Use original example of different computational model Quiz Rubric for Quiz
PO-a-2
and mathematical notations
CO3 Illustrate a solution for a complex problem using the Midterm Rubric for Term
PO-c-3 Exam exam
principles of existing computational models
CO4 Explain the principles of existing computational model Midterm Rubric for Term
PO-l-2 Exam exam
and use it to find a new solution.

© Dept. of Computer Science, FST, AMERICAN INTERNATIONAL UNIVERSITY-BANGLADESH (AIUB) Page 3 of 7

CSC 3113: THEORY OF COMPUTATION

XIII – Evaluation and Assessment Criteria

CO1 [PO-a2]: Demonstrate different computational model and mathematical notations

Assessment
Missing Inadequate Not enough Moderate Satisfactory Excellent
Attribute/
(0) (1) (2) (3) (4) (5)
Criteria

While While While

While While
providing the providing the providing the
providing the providing the
Not definitions, definitions, definitions,
definitions, definitions,
Definition Attended/ the student the student the student
the student the student
Incorrect Described Described Described
Described Described
two Element three Element four Element
one Element five Element

Not Described
Logical Described Described Described Described
Attended/ four
Argument one Elements two Elements three Elements five Elements
Incorrect Elements

Not Showed one Showed two Showed three Showed four Showed five
Relevant
Attended/ element in elements in elements in elements in elements in
Example
Incorrect the example the example the example the example the example

CO2 [PO-a2]: Use original example of different computational model and mathematical notations

Assessment
Missing Inadequate Not enough Moderate Satisfactory Excellent
Attribute/
(0) (1) (2) (3) (4) (5)
Criteria

While While While

While While
providing the providing the providing the
providing the providing the
Not example, the example, the example, the
example, the example, the
Definition Attended/ student student student
student student
Incorrect Described Described Described
Described Described
two Element three Element four Element
one Element five Element

Not Described
Logical Described Described Described Described
Attended/ four
Argument one Elements two Elements three Elements five Elements
Incorrect Elements

Not Showed one Showed two Showed three Showed four Showed five
Relevant
Attended/ element in elements in elements in elements in elements in
Example
Incorrect the example the example the example the example the example

© Dept. of Computer Science, FST, AMERICAN INTERNATIONAL UNIVERSITY-BANGLADESH (AIUB) Page 4 of 7

CSC 3113: THEORY OF COMPUTATION

CO3 [PO-c-3]: Illustrate a solution for a complex problem using the principles of existing computational
models
Assessment
Missing Inadequate Not enough Moderate Satisfactory Excellent
Attribute/
(0) (1) (2) (3) (4) (5)
Criteria

While
While While While While
designing the
designing the designing the designing the designing the
Not solution, the
solution, the solution, the solution, the solution, the
Design Attended/ student used
student used student used student used student used
Incorrect four
one element two elements three elements five elements
elements
correctly correctly correctly correctly
correctly

While While While

While While
designing the designing the designing the
designing the designing the
solution, the solution, the solution, the
solution, the solution, the
Not student student student
Design student student
Attended/ followed the followed the followed the
Conventions followed the followed the
Incorrect convention convention convention
convention convention
and used one and used two and used five
and used three and used four
element elements elements
elements elements
correctly correctly correctly
correctly correctly
While While
While analyzing the analyzing the While While
analyzing the solution, the solution, the analyzing the analyzing the
Not
Result solution, the student student solution, the solution, the
Attended/
Analysis student knows the applied the student student made
Incorrect
identified the formal formal reached the the final
initial setting definition of definition of final setup decision
computation computation

CO4 [PO-l-4]: Explain the principles of existing computational model and use it to find a new solution.

Assessment
Missing Inadequate Not enough Moderate Satisfactory Excellent
Attribute/
(0) (1) (2) (3) (4) (5)
Criteria
While
While While While While
modification
modification modification modification modification
the solution,
Not the solution, the solution, the solution, the solution,
the student
Modification Attended/ the student the student the student the student
calculated
Incorrect calculated calculated calculated calculated
four
one Element two elements three elements five elements
elements
correctly correctly correctly correctly
correctly
While
While While While While
modification,
modification, modification, modification, modification,
the student
the student the student the student the student
Not followed the
Conventions followed the followed the followed the followed the
Attended/ convention
Followed convention to convention to convention to convention to
Incorrect to calculate
calculate one calculate two calculate three calculate five
four
element elements elements elements
elements
correctly correctly correctly. correctly.
correctly.
© Dept. of Computer Science, FST, AMERICAN INTERNATIONAL UNIVERSITY-BANGLADESH (AIUB) Page 5 of 7
CSC 3113: THEORY OF COMPUTATION

While While
While While While
analyzing the analyzing the
analyzing the analyzing the analyzing the
Not solution, the solution, the
Result solution, the solution, the solution, the
Attended/ student student
Analysis student student student made
Incorrect knows the applied the
identified the reached the the final
formal formal
initial state final setup decision
procedure procedure

XIV- Course Requirements

 Students are expected to attend at least 80% of the class.

 Students are expected to participate actively in the class.
 For both terms, there will be at least 2 quizzes based on the theoretical knowledge and conceptual understanding
of the topic covered discussed in the classes.
 Submit report based on the given course related problems.
 Submission of assignments and projects should be in due time.

XV – Evaluation & Grading System*

The following grading system will be strictly followed in this class.

MID TERM FINAL TERM

Attendance 10% Attendance 10%
Quiz 40% Quiz 40%
Midterm written exam 50% Final term written exam 50%
Total 100% Total 100%

Grand Total 100% = 40% of Midterm + 60% of Final Term

Letter Grade Point Numerical %

A+ 4.00 90-100
A 3.75 85 - < 90
B+ 3.50 80 - < 85
B 3.25 75 - < 80
C+ 3.00 70 - < 75
C 2.75 65 - < 70
D+ 2.50 60 - < 65
D 2.25 50 - < 60
F 0.00 < 50
I Incomplete
W Withdrawal
UW Unofficially Withdrawal
* The evaluation system will be strictly followed as par with the AIUB grading policy.
* CO attainment will be achieved with 60% of the evaluation marks.

© Dept. of Computer Science, FST, AMERICAN INTERNATIONAL UNIVERSITY-BANGLADESH (AIUB) Page 6 of 7

CSC 3113: THEORY OF COMPUTATION

XVI – Textbook/ References

1. Introduction to the Theory of Computation (Latest Edition)

by Michael Sipser
2. Introduction to Automata Theory, Languages, and Computation (Latest Edition)
by John E. Hopcroft, et al
3. Elements of the Theory of Computation (Latest Edition)
by Harry R. Lewis, Christos H. Papadimitriou

© Dept. of Computer Science, FST, AMERICAN INTERNATIONAL UNIVERSITY-BANGLADESH (AIUB) Page 7 of 7