Descriptor
| Algorithms | 2 |
| Test Construction | 2 |
| Test Items | 2 |
| Test Theory | 2 |
| Computer Assisted Testing | 1 |
| Decision Making | 1 |
| Difficulty Level | 1 |
| Equations (Mathematics) | 1 |
| Item Banks | 1 |
| Mathematical Models | 1 |
| Microcomputers | 1 |
| More ▼ | |
Publication Type
| Journal Articles | 2 |
| Reports - Evaluative | 2 |
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewedArmstrong, Ronald D.; Jones, Douglas H. – Applied Psychological Measurement, 1992
Polynomial algorithms are presented that are used to solve selected problems in test theory, and computational results from sample problems with several hundred decision variables are provided that demonstrate the benefits of these algorithms. The algorithms are based on optimization theory in networks (graphs). (SLD)
Descriptors: Algorithms, Decision Making, Equations (Mathematics), Mathematical Models
Peer reviewedArmstrong, Ronald D.; And Others – Journal of Educational Statistics, 1994
A network-flow model is formulated for constructing parallel tests based on classical test theory while using test reliability as the criterion. Practitioners can specify a test-difficulty distribution for values of item difficulties as well as test-composition requirements. An empirical study illustrates the reliability of generated tests. (SLD)
Descriptors: Algorithms, Computer Assisted Testing, Difficulty Level, Item Banks
