CSE221: Theory of
Computing
Course Information:Course Code: CSE 221
Course Title: Theory of
Computing
Program: B.Sc in Computer Science and Engineering (CSE)
Faculty: Faculty of Science and Information Technology (FSIT)
Semester: Fall
Year: 2022
Credit: 3.0
Contact Hour: 6 Hours/ Week
Course Category: Core Engineering
Section: A+B
Course Teacher Information:
Rashidul Hasan Hridoy
Lecturer, Department of Computer Science and Engineering
Daffodil International University
Office: Academic Building 04, Room 739
Mobile: 01714969317
Email: rashidul.cse0394.c@diu.edu.bd
LinkedIn: https://www.linkedin.com/in/rashidulhasanhridoy
ResearchGate: https://www.researchgate.net/profile/Rashidul-Hasan-Hridoy
Google Scholar: https://scholar.google.com/citations?user=9o4uHPsAAAAJ&hl
Website: https://rashidulhasanhridoy.com
Course Rationale:
The course is intended to teach the students the basic techniques that underlie the practice of Compiler Construction. The course will introduce the theory and tools that can be standard employed in order to perform syntax-directed translation of a high-level programming language into an executable code.These techniques can also be employed in wider areas of application, whenever we need a syntax-directed analysis of symbolic expressions and languages and their translation into a lower-level description. They have multiple applications for man-machine interaction, including verification and program analysis.
Course Objective:
The main objective of this course is to introduce the major concept areas of language translation and compiler design and to develop an awareness of the function and complexity of modern compilers. This course is a study of the theory and practice required for the design and implementation of interpreters and compilers for programming languages.
Course Outcomes (CO’s):
After successful completion of this course, the students should be able to,
- CO1 :Able to learn variety of issues in the mathematical development of computer science theory, particularly finite representations for languages and machines.
- CO2 : Efficient problem can be solved on a model of computation.
- CO3 : Apply relation and function to solve a problem of NFA & DFA.
- CO4 : The model Turing Machine is implemented to analyse and use to prove result.
- CO5 : Be able to construct pushdown automata and the equivalent context free grammars.
Grading Scheme (Theory Class):
- Attendance: 7%
- Class Tests/Quizzes: 15%
- Assignment: 5%
- Presentation (using video/ppt): 8%
- Midterm Exam: 25%
- Final Exam: 40%