Scribd
Upload
42 views2 pages

2b Course and Program Outcome CD

The document outlines the course details for 'Theory of Computation' taught by Prof Avijeet Vyas in the Computer Science and Engineering department for the July-Dec 2024 session. It includes course objectives and outcomes for five units covering topics such as automata theory, finite automata, grammar, push down automata, and Turing machines. The course aims to provide a comprehensive understanding of these fundamental concepts in computation.

Uploaded by

avyas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
42 views2 pages

2b Course and Program Outcome CD

The document outlines the course details for 'Theory of Computation' taught by Prof Avijeet Vyas in the Computer Science and Engineering department for the July-Dec 2024 session. It includes course objectives and outcomes for five units covering topics such as automata theory, finite automata, grammar, push down automata, and Turing machines. The course aims to provide a comprehensive understanding of these fundamental concepts in computation.

Uploaded by

avyas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Course Details

Department : Computer Science and Engineering Session: July-Dec 2024

Name of Faculty: Prof Avijeet Vyas Semester 5

Subject: Theory of Computation Subject Code: CS-501

Course Objective

Unit Title Course Objective


Understand basic automata concepts, Mealy
1 Introduction of Automata Theory
and Moore machines, and their interconversion.
Learn types of finite automata, regular
2 Types of Finite Automata expressions, and machine minimization
techniques.
Understand grammar types, parse trees,
3 Grammar ambiguity, and grammar-to-automata
conversions.
Explore Push Down Automata and its relation
4 Push Down Automata
to context-free grammars.
Study Turing machines, decidability, NP-
5 Turing Machine
completeness, and unsolvable problems.

Course Outcome

Unit Title Course Outcome


Illustrate the concepts of finite automata,
Moore and Mealy machines, and conversion
1 Introduction of Automata Theory
techniques to recognize their roles as language
acceptors.
Illustrate various finite automata and their
2 Types of Finite Automata conversions, minimization, and concepts of
regular expressions.
Represent different grammars and their
3 Grammar simplifications, including derivation trees,
ambiguity, and normal forms.
Describe pushdown automata concepts for
4 Push Down Automata context free languages and their conversions to
context-free grammar.
Illustrate Turing machines and its variants and
5 Turing Machine
decidability

You might also like