Scribd
Upload
5 views3 pages

Syllabus

The document outlines the course structure for 'Theory of Computation' in the Bachelor of Technology (Computer Engineering) program, detailing objectives, outcomes, teaching methods, and evaluation schemes. Students will learn about algorithms, formal languages, automata theory, and Turing machines, with a focus on mathematical proofs and analysis. The course includes a combination of theoretical instruction and practical evaluation, with various supplementary resources available for enhanced learning.

Uploaded by

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

Syllabus

The document outlines the course structure for 'Theory of Computation' in the Bachelor of Technology (Computer Engineering) program, detailing objectives, outcomes, teaching methods, and evaluation schemes. Students will learn about algorithms, formal languages, automata theory, and Turing machines, with a focus on mathematical proofs and analysis. The course includes a combination of theoretical instruction and practical evaluation, with various supplementary resources available for enhanced learning.

Uploaded by

Dhruv Khant
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

INSTITUTE FACULTY OF TECHNOLOGY

PROGRAM BACHELOR OF TECHNOLOGY (COMPUTER


ENGINEERING)
SEMESTER 6
COURSE TITLE THEORY OF COMPUTATION
COURSE CODE 01CE0608
COURSE CREDITS 3

Objective:
1 This subject will introduce students to the algorithms, formal languages and grammars,
automata theory, decidability, complexity, and computability. It helps students to understand
and conduct mathematical proofs for computation and algorithms.

Course Outcomes: After completion of this course, student will be able to:
1 Apply mathematical concepts and analyse regular languages using regular expressions and
the pumping lemma.
2 Construct and convert between different types of finite automata and minimize them.
3 Analyse context free grammars and convert between context-free grammars and pushdown
automata.
4 Analyse pushdown automata and prove the equivalence between pushdown automata and
context free grammars.
5 Analyse Turing machines and their variations.

Pre-requisite of course:NA

Teaching and Examination Scheme


Theory Tutorial Practical ESE IA CSE Viva Term
Hours Hours Hours Work
3 0 0 50 30 20 0 0

Contents: Contact
Topics
Unit Hours
1 Mathematical Theory and Regular Languages 5
Set Theory, Predicate Logic, Relations, Functions, Principal of
Mathematical Induction, Regular Expression, Regular Languages,
Regular Languages – Pumping Lemma
2 Finite State Machine 10
Basics of Automata theory, Finite automata, Deterministic and Non
- Deterministic Automata, ^ - Transition Finite automata, Conversion
NFA - ^ to NFA, Conversion NFA to DFA, Conversion RE (Regular
Expression) to Non-Deterministic Finite Automata, Subset
Algorithm to convert Non DFA to DFA, Finite automata
minimization, Moore and Mealey machine and their Conversion.

MR. HARDIK AJAYBHAI DOSHI DR. RAJENDRASINH BAHADURSINH JADEJA


Digitally signed by (Name of HOD) Digitally signed by (Name of Dean/ Principal)
Contents: Contact
Topics
Unit Hours
3 Context Free Grammar (CFG) 10
Context free language, Chomsky normal forms, Derivation -
Derivation tree with their relation, Ambiguous and unambiguous
CFG, Closure properties of Context Free Language.
4 Push Down Automata (PDA) 9
Introduction about PDA, Equivalence between CFG and PDA,
Deterministic PDA- Acceptance of Empty and Final state, Pumping
Lemma for Context Free Language
5 Turing machine and REL 8
Basics of Turing machine, Language acceptor, Turing machine
variations, Church Turing thesis, Universal Turing machine,
Recursively and Enumerable Languages.
Total Hours 42

Textbook:
1 Introduction to Languages and the Theory of Computation, Martin, John C., Tata Mcgraw
Hill Education Private Limited, 2010

References:
1 Automata Theory, Languages, and Computation, Automata Theory, Languages, and
Computation, Hopcroft, Motwani, and Ullman, Pearson Education, 2008
2 Theory of Computation, 2nd edition, Theory of Computation, 2nd edition, Moret, Bernard
M, Pearson Education, 2018
3 Elements of The Theory of Computation, Elements of The Theory of Computation, Lewis,
Harry R, PHI Learning PVT. Ltd, 2013
4 Fundamentals of the Theory of Computation: Principles and Practice, Fundamentals of the
Theory of Computation: Principles and Practice, Greenlaw, Raymond Hoover, H. James,
Morgan Kaufmann Publishers 2nd edition, 2011
5 Theory of Computation, Cenagage Learning, Theory of Computation, Cenagage Learning,
Sipser, Michael, Cenagage Learning India Private Limited 3rd edition, 2013

Suggested Theory Distribution:


The suggested theory distribution as per Bloom’s taxonomy is as follows. This distribution
serves as guidelines for teachers and students to achieve effective teaching-learning process

Distribution of Theory for course delivery and evaluation

Remember / Understand Apply Analyze Evaluate Higher order


Knowledge Thinking
15.00 35.00 33.00 12.00 5.00 0.00

MR. HARDIK AJAYBHAI DOSHI DR. RAJENDRASINH BAHADURSINH JADEJA


Digitally signed by (Name of HOD) Digitally signed by (Name of Dean/ Principal)
Instructional Method:
1 The course delivery method will depend upon the requirement of content and need of
students. The teacher in addition to conventional teaching method by black board, may also
use any of tools such as role play, Quiz, brainstorming, MOOCs etc.
2 The internal evaluation will be done on the basis of continuous evaluation of students in the
class-room.
3 Students will use supplementary resources such as online videos, NPTEL videos, e courses.

Supplementary Resources:
1 http://nptel.ac.in

MR. HARDIK AJAYBHAI DOSHI DR. RAJENDRASINH BAHADURSINH JADEJA


Digitally signed by (Name of HOD) Digitally signed by (Name of Dean/ Principal)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy