4IT4-06.1

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

4IT4-06.2

Apply finite automata and push down automata (PDA) machines for computational real-world problem statements.

4IT4-06.3

Model the capability of Turing machine for context-sensitive languages or computational real-world problem statements.

4IT4-06.4

Select appropriate automata for modeling the solution for various computational engineering problems.

4IT4-06.5

Understand the concepts of tractable & untractable problems.

COs

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

PO12

PSO1

PSO2

PSO3

CO1

2

3

-

-

3

-

-

-

-

-

-

-

2

-

-

CO2

2

2

2

-

3

-

-

-

-

-

-

-

2

-

-

CO3

2

1

2

-

3

-

-

-

-

-

-

-

2

-

-

CO4

2

1

2

-

3

-

-

-

-

-

-

-

2

-

-

CO5

3

1

1

2

-

-

-

-

-

-

-

-

2

-

-

Avg

3

2

2

2

3

-

-

-

-

-

-

-

2

-

-