An Algorithm Applied in Diagnostic Test
碩士 === 國立嘉義大學 === 資訊工程研究所 === 91 === Nowadays, it’s common to use computer to perform Diagnostic Test. In order to recognize all single and complex misconcepts in n concepts for a student, one would need to test 2^n-1 problems. We develop an algorithm to improve problem selection in Computer Diagnos...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/59128532493722151844 |
| Summary: | 碩士 === 國立嘉義大學 === 資訊工程研究所 === 91 === Nowadays, it’s common to use computer to perform Diagnostic Test. In order to recognize all single and complex misconcepts in n concepts for a student, one would need to test 2^n-1 problems. We develop an algorithm to improve problem selection in Computer Diagnostic Test by using tree data structure with concept mapping. If a teacher wants to know a student’s misconcepts in n given concepts, he can give Diagnostic Test to the student. Using our algorithm on the Diagnostic Test, he will be able to recognize both single misconcept and complex misconcept of the student within n^2 items in average case.
|
|---|