Scribd
Upload
3 views

page 3

Uploaded by

naacit2024
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
3 views

page 3

Uploaded by

naacit2024
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/ 1

Logo SKIT Teaching Process Rev No.: 1.

0
Doc Code: INST.Ph5b1.F02 Date: 3-08-2018
Title: Course Plan Page: 4 / 29
Copyright ©2017. cAAS. All rights reserved.
15CS54.2 Design,Translate, Differentiate 8 Abstract Problem Slip test L4
Between Different abstract state state solving Analyze
machine(e.g:deterministic,Non- machine
Deterministics),and give examples for
the different types of automata
15CS54.3 Build, convert Regular expression to 5 Pattern Lecture Seminar L3
Finite State machine to achieve Language Apply
pattern matching, to correlate the
different types of automata to real
world applications
15CS54.4 Construct, choose and design regular 5 Rule based Problem Assignment L4
grammar to accept regular language, system solving Analyze
appropriate automata for the different
requirements outlined by theoretical
computer science.
15CS54.5 Design ,simplify and Analyze context 5 Rule based Problem Slip test L4
free grammar for context free system solving Analyze
languages & explain the application of
machine models and descriptors to
compiler theory and parsing
15CS54.6 Analyze,construct Push down 5 Automata Discussio Viva L4
automata to accept context free for context n Analyze
grammar. free Problem Assignment
grammar solving
15CS54.7 Prove some languages are not 2 Pumping Lecture Seminar L3
context free languages using lemma Apply
pumping lemma.
15CS54.8 Analyze ,design turing machine . 8 Abstract Discussio Viva L4
machine n Analyze
Problem Assignment
solving
15CS54.9 Understand multitape turing machine 2 Multitape Lecture Assignment L2
to identify the different computational turing Understand
problems and their associated machine
complexity.
15CS54.10 Understand Linear bounded automata 8 State
Discussio Viva L3
machine n Apply
Problem Assignment
solving
- Total 50 - - - -
Note: Identify a max of 2 Concepts per Module. Write 1 CO per concept.

2. Course Applications
SNo Application Area CO Level
1 Acquire fundamental Understanding of the core concepts of automata theory. CO1 L2
2 commonly used to build software applications with finite state machines: CO2 L4
Automata-based programming.
3 Regular expressions are useful in a wide variety of text processing tasks,simple CO3 L3
parsing, useful on Internet search engines.
4 Design Grammar and Automata for different language classes and become CO4 L4
knowledgeable about restricted models of computation.
5 Used to describe the structure of programming languages,In most programming CO5 L4
languages opening and closing of braces, curly brackets is taken care
6 Online transaction process system , Deterministic top down parsing . CO6 L4
7 Develop skills in formal reasoning and reduction of a problem to a formal model. CO7 L3
8 Any computation that can be carried out by a mechanical means can be performed CO8 L4
CS
Prepared by Checked by Approved

You might also like