0% found this document useful (0 votes)
29 views

CSF309 Course Description Document

This document provides information about an undergraduate course on Theory of Computation offered in the 6th semester. The course is taught by 5 instructors from the Computer Science department. It is a 3 credit course that will introduce fundamental concepts in formal languages and automata theory. The course objectives are to teach mathematical foundations of computation including automata theory, formal languages and grammars. Upon successful completion, students will be able to analyze automata and grammars, demonstrate understanding of computability and complexity notions, and apply automata theory to problems. The curriculum, evaluation scheme and course policies are also outlined.

Uploaded by

pratham
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
29 views

CSF309 Course Description Document

This document provides information about an undergraduate course on Theory of Computation offered in the 6th semester. The course is taught by 5 instructors from the Computer Science department. It is a 3 credit course that will introduce fundamental concepts in formal languages and automata theory. The course objectives are to teach mathematical foundations of computation including automata theory, formal languages and grammars. Upon successful completion, students will be able to analyze automata and grammars, demonstrate understanding of computability and complexity notions, and apply automata theory to problems. The curriculum, evaluation scheme and course policies are also outlined.

Uploaded by

pratham
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Underaduate Course Description Document

Semester: 6th Semester Year: 3rd

Course Instructor(s):
1. Prof. (Dr.) Rama Sushil- Section F
2. Prof. (Dr.) Madhu Kumari- Section G & H
3. Mr. Tarun Kumar (Course Coordinator)- Section A, B & C
4. Mr. Ankit Agarwal- Section D & E
5. Mr. Ishan Dawar (Tutorials only)- Section H & I

Department offering the course SoC- CSE


Course Code CSF309
Course Title Theory of Computation
Credits (L: T:P:C) 3:1:0:4
Contact Hours (L: T:P) 3:1:0
Prerequisites (if any) Discrete Mathematics
Course Basket Discipline Core

Course Summary
The course introduces some fundamental concepts in theory of computations and formal
languages, including language, their type, and related grammar, finite automaton, regular
expression, formal language, pushdown automaton and Turing machines. It also includes
introductory concepts of its applications into other area of computer science.

Course Objectives
This course will facilitate the students to learn the mathematical foundations of
computation includingautomata theory; the theory of formal languages and grammars; the
notions of algorithm, decidability, complexity, and computability.

Course Outcomes

On successful completion of the course, students will be able to achieve the following:
CO1. Analyze and design finite automata, pushdown automata, Turing machines, formal
languages, and grammars.
CO2. Demonstrate their understanding of key notions, such as algorithm, computability,
decidability, and complexity through problem solving.
CO3. Proof of the basic results of the Theory of Computation.
CO4. Use of Turing machine in computational mathematics
CO5. Use of automata theory in application problems

CSF309, Theory of Computation, Even Semester, 2022-23


Curriculum Content

CSF309, Theory of Computation, Even Semester, 2022-23


Evaluation Scheme

Course Policies
• Attendance is required. Please refer to the attendance rules of the University.
• There will be no makeup quizzes and exams, unless decided otherwise by the
competent authority in the University during the semester.
• Disciplinary action may be taken, and marks may be deducted if any student
disrupts class or found copying from other’s assignments, labs, projects or exams.
• Course Materials will be regularly posted in MS Teams.
• Make sure to adhere to the deadlines for evaluation instruments in MS Teams.
• Evaluation Instruments submitted after the due date will not be evaluated and a
score of zero will be awarded. Email or any other modes of submissions will not be
accepted.
• For mid-term and end-term exams, rules set by competent authority will be final.
• For any queries in the course, students should contact the faculty through MS
Teams.
• Students are strongly advised to be more interactive and ask queries to faculty
during lectures/labs/tutorials.

*---------------- *---------------- *---------------- *---------------- *---------------- *---------------- *-


--------------- *

CSF309, Theory of Computation, Even Semester, 2022-23

You might also like