4CS4-06.1

Define and   discuss the   concept   of   formal grammar, formal language, regular expression and automata machine.

4CS4-06.2

Design finite automata and push down automata (PDA) machines for given formal languages or computational real-world problem statements.

4CS4-06.3

Understand the capability of Turing machine and design Turing Machine   for   context-sensitive languages or computational real-world problem statements.

4CS4-06.4

Choose and design appropriate automata for modeling the solution for various computational engineering problems.

4CS4-06.5

Understand   the   concepts   of   tractable   & untractable problems and able to decide a given problem is tractable or not.

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

PO12

PSO1

PSO2

PSO3

CO1

2

-

-

-

-

-

-

-

-

-

-

-

2

-

-

CO2

-

2

2

-

3

-

-

-

-

-

-

-

2

-

-

CO3

-

1

2

-

3

-

-

-

-

-

-

-

2

-

-

CO4

2

1

2

-

3

-

-

-

-

-

-

-

2

-

-

CO5

-

1

1

-

-

-

-

-

-

-

-

-

2

-

-

Avg

2

1.3

1.8

-

3

-

-

-

-

-

-

-

2

-

-