Two algorithms for estimating test complexity levels (Q2412968)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6856892
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two algorithms for estimating test complexity levels |
scientific article; zbMATH DE number 6856892 |
Statements
Two algorithms for estimating test complexity levels (English)
0 references
6 April 2018
0 references
maximal likelihood method
0 references
recurrent recomputation
0 references
test complexity levels
0 references
levels of preparation of the students
0 references
0.850512683391571
0 references
0.7114588618278503
0 references
0.6947664022445679
0 references
0.6927880048751831
0 references
