| Excellent | Good | Acceptable | Not acceptable |
Achievement 1 | The students understand basic concept of set, and can execute set operation and calculate cardinality of set using inclusion-exclusion principle. | The students understand basic concept of set, and can execute set operation and calculate cardinality of set. | The students understand basic concept of set and can execute set operation. | The students do not understand basic concept of set, nor can execute set operation. |
Achievement 2 | The students can explain correspondence and basic concept of function and prove some theorems using these concepts. | The students can explain correspondence and basic concept of function and prove bijection of set using these notion. | For given function, the students can judge whether the function is surjective or injective or neither. | For given function, the students cannot judge whether the function is surjective or injective or neither. |
Achievement 3 | The students can explain basic notion of information theory and prove simple theorems. | The students can explain basic notion of information theory. | The students can explain entropy. | The students can not explain entropy. |
Achievement 4 | The student can explain basic notion of logical algebra and predicate logic and use them daily life. | The student can explain basic notion of logical algebra and predicate logic. | The student can explain basic notion of logical algebra. | The student can not explain basic notion of logical algebra. |
Achievement 5 | The student can explain basic notion of graph theory and prove simple theorem. They can also model problem on graph. | The student can explain basic notion of graph theory and prove simple theorem. | The student can explain basic notion of graph theory. | The student can not explain basic notion of graph theory. |
Achievement 6 | The student can explain basic notion of automata and formal language and prove simple theorem. | The student can explain basic notion of automata and formal language and make state transition diagram. | The student can explain basic notion of automata and formal language. | The student can not explain basic notion of automata and formal language |