Publication Date
In 2025 | 0 |
Since 2024 | 0 |
Since 2021 (last 5 years) | 1 |
Since 2016 (last 10 years) | 1 |
Since 2006 (last 20 years) | 1 |
Descriptor
Algorithms | 10 |
Difficulty Level | 10 |
Test Items | 7 |
Computer Assisted Testing | 6 |
Item Response Theory | 5 |
Item Banks | 4 |
Simulation | 4 |
Test Construction | 4 |
Adaptive Testing | 3 |
Estimation (Mathematics) | 3 |
Computer Simulation | 2 |
More ▼ |
Author
Publication Type
Reports - Evaluative | 10 |
Journal Articles | 3 |
Speeches/Meeting Papers | 3 |
Education Level
Higher Education | 1 |
Postsecondary Education | 1 |
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
National Assessment of… | 1 |
Test of English as a Foreign… | 1 |
What Works Clearinghouse Rating
Beena Joseph; Sajimon Abraham – Knowledge Management & E-Learning, 2023
Currently, the majority of e-learning lessons created and disseminated advocate a "one-size-fits-all" teaching philosophy. The e-learning environment, however, includes slow learners in a noticeable way, just like in traditional classroom settings. Learning analytics of educational data from a learning management system (LMS) have been…
Descriptors: Electronic Learning, Learning Management Systems, Slow Learners, Educational Environment
Lau, C. Allen; Wang, Tianyou – 1999
A study was conducted to extend the sequential probability ratio testing (SPRT) procedure with the polytomous model under some practical constraints in computerized classification testing (CCT), such as methods to control item exposure rate, and to study the effects of other variables, including item information algorithms, test difficulties, item…
Descriptors: Algorithms, Computer Assisted Testing, Difficulty Level, Item Banks
Gershon, Richard; Bergstrom, Betty – 1995
When examinees are allowed to review responses on an adaptive test, can they "cheat" the adaptive algorithm in order to take an easier test and improve their performance? Theoretically, deliberately answering items incorrectly will lower the examinee ability estimate and easy test items will be administered. If review is then allowed,…
Descriptors: Adaptive Testing, Algorithms, Cheating, Computer Assisted Testing
A Zero-One Programming Approach to Gulliksen's Matched Random Subtests Method. Research Report 86-4.
van der Linden, Wim J.; Boekkooi-Timminga, Ellen – 1986
In order to estimate the classical coefficient of test reliability, parallel measurements are needed. H. Gulliksen's matched random subtests method, which is a graphical method for splitting a test into parallel test halves, has practical relevance because it maximizes the alpha coefficient as a lower bound of the classical test reliability…
Descriptors: Algorithms, Computer Assisted Testing, Computer Software, Difficulty Level
Zeng, Lingjia; Bashaw, Wilbur L. – 1990
A joint maximum likelihood estimation algorithm, based on the partial compensatory multidimensional logistic model (PCML) proposed by L. Zeng (1989), is presented. The algorithm simultaneously estimates item difficulty parameters, the strength of each dimension, and individuals' abilities on each of the dimensions involved in arriving at a correct…
Descriptors: Ability Identification, Algorithms, Computer Simulation, Difficulty Level

Armstrong, 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

Liou, Michelle; Chang, Chih-Hsin – Psychometrika, 1992
An extension is proposed for the network algorithm introduced by C.R. Mehta and N.R. Patel to construct exact tail probabilities for testing the general hypothesis that item responses are distributed according to the Rasch model. A simulation study indicates the efficiency of the algorithm. (SLD)
Descriptors: Algorithms, Computer Simulation, Difficulty Level, Equations (Mathematics)
Dimitrov, Dimiter M. – 1994
An approach is described that reveals the hierarchical test structure (HTS) based on the cognitive demands of the test items, and conducts a linear trait modeling by using the HST elements as item difficulty components. This approach, referred to as the Hierarchical Latent Trait Approach (HLTA), employs an algorithm that allows all test items to…
Descriptors: Algorithms, Cognitive Processes, Difficulty Level, Higher Education
Veerkamp, Wim J. J.; Berger, Martijn P. F. – 1994
Items with the highest discrimination parameter values in a logistic item response theory (IRT) model do not necessarily give maximum information. This paper shows which discrimination parameter values (as a function of the guessing parameter and the distance between person ability and item difficulty) give maximum information for the…
Descriptors: Ability, Adaptive Testing, Algorithms, Computer Assisted Testing
Hicks, Marilyn M. – 1989
Methods of computerized adaptive testing using conventional scoring methods in order to develop a computerized placement test for the Test of English as a Foreign Language (TOEFL) were studied. As a consequence of simulation studies during the first phase of the study, the multilevel testing paradigm was adopted to produce three test levels…
Descriptors: Adaptive Testing, Adults, Algorithms, Computer Assisted Testing