8/10/2019 TOA- Assignment Rubrics for Evaluation

1/2

DEPARTMENT OF INFORMATION TECHNOLOGYVASAVI COLLEGE OF ENGINEERING

COURSE: THEORY OF AUTOMATA

ASSIGNMENT RUBRIC FOR EVALUATION

Exemplary (E) Accomplished

(A)

Developing (D) Beginning (B)

Assignment1

Demonstrate

a thorough

understandingon (i) finite

state

automata, (ii)regular

expression

and regular

languages,and (iii)

equivalence

of NFA and

DFA

Demonstrate

a good

understandingon (i) finite

state

automata, (ii)regular

expression

and regular

languages,and (iii)

equivalence

of NFA and

DFA

Demonstrate

a

considerableunderstanding

on (i) finite

stateautomata, (ii)

regular

expression

and regularlanguages,

and (iii)

equivalence

of NFA andDFA

Demonstrate a minimal (or unable to de

understanding on (i) finite state automat

expression and regular languages, and (iNFA and DFA

Assignment

2

Demonstrate

a thorough

understanding

on (i)properties of

regular

languages (ii)context free

grammars

and (iii)equivalenceand

minimization

of finiteautomata.

Demonstrate

a good

understanding

on (i)properties of

regular

languages (ii)context free

grammars

and (iii)equivalenceand

minimization

of finiteautomata.

Demonstrate

a

considerable

understandingon (i)

properties of

regularlanguages (ii)

context free

grammarsand (iii)equivalence

and

minimizationof finite

automata.

Demonstrate a minimal (or unable to de

understanding on (i) properties of regula

context free grammars and (iii) equivale

minimization of finite automata.

Assignment3

Can describe

and explain

the concepts

of (i) push

downautomata, (ii)

properties ofCFL and (iii)

normal forms

for CFGs

Can describe

and explain

mostly the

concepts of

(i) push downautomata, (ii)

properties ofCFL and (iii)

normal forms

for CFGs

Can describe

and explain

considerable

concepts of

(i) push downautomata, (ii)

properties ofCFL and (iii)

normal forms

for CFGs

Can describe some concepts of (or cann

of )

(i) push down automata, (ii) properties o

normal forms for CFGs

Candescribe and

explain the

Candescribe

and explain

Candescribe and

explain

Can describe some concepts of (or canof )

Turing Machines

8/10/2019 TOA- Assignment Rubrics for Evaluation

2/2

Assignment4

concepts of

Turing

Machines

Caneffectively

and

correctlyapply

formal

methods tosolve a

given

problem

mostly the

concepts of

TuringMachines

Cancorrectly

applyformal

methods to

solve agiven

problem

considerable

concepts of

TuringMachines

Can applyformal

methods tosolve a

given

problemwith some

degree of

effectivenes

s

Can apply some formal methods (or canmethods) to solve a substantial part of a