You are on page 1of 2

# Computing Theory

Individual Assignment

Page 1 of 2

Assignment Marking Scheme

NAME :

ID :

Criteria (PART-A)

Excellent

Good

Marks
Average Poor

Very
Poor

1. Correctness of the application of
rules.

(5)

(4)

(3)

(2)

(1/0)

2. Representation of logic using State
Transition table

(9-10)

(7-8)

(5-6)

(3-4)

(0-2)

3. Conversion of State Transition table
to NFA Diagram

(5)

(4)

(3)

(2)

(1/0)

4. Discussion and Critical Appraisal by
applying acceptable inputs.

(5)

(4)

(3)

(2)

(1/0)

Marks
Average

Poor

Very
Poor

SUB-TOTAL (T1 out of 25 Marks)

Criteria (PART-B)

Excellent

5. Correctness of usage of rules present
in state elimination method.

Good

(9-10)

(7-8)

(5-6)

(3-4)

(0-2)

for

(5)

(4)

(3)

(2)

(1/0)

7. Explanation for the rules applied in
each step.

(5)

(4)

(3)

(2)

(1/0)

8. Discussion and Critical Appraisal

(5)

(4)

(3)

(2)

(1/0)

6. Step by Step elimination
obtaining regular expression.

SUB-TOTAL (T2 out of 25 Marks)
Total Marks = (T1 + T2) *2

Level 1

Asia Pacific University of Technology and Innovation

2016

Level 1 Asia Pacific University of Technology and Innovation 2016 .Computing Theory Individual Assignment Page 2 of 2 Comments: Performance Criteria The criteria used to evaluate the assignment are as follows: PART .  Representation of the Regular Expression with proper syntax.B  Degree of correctness of the rules applied.  Appropriateness for constructing NFA diagram  Depth of discussion and Critical Appraisal for acceptable inputs. PART .A  Degree of correctness of the rules applied.  Explanation of the state transition diagram.  Explanation of the rules used in state elimination method  Step by step description for obtaining the regular expression.