All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

On The Problem of Generating a Large Number of Comparable Test Variants

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23510%2F18%3A43953551" target="_blank" >RIV/49777513:23510/18:43953551 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.eriesjournal.com/index.php/eries/article/view/220/169" target="_blank" >https://www.eriesjournal.com/index.php/eries/article/view/220/169</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.7160/eriesj.2018.110402" target="_blank" >10.7160/eriesj.2018.110402</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On The Problem of Generating a Large Number of Comparable Test Variants

  • Original language description

    The paper presents a possible way of solving the problem of creating more test variants for a large number of students divided into groups. The proposed solution may consist in introducing a parameterized automatic test generator. The principle of an automatic parameterized test generator is shown. The process of the question tree construction according to the increasing numbers of question in the banks of the particular subjects leads to a combinatorial explosion. This often results in excessive time of generation of the different variants of tests. To solve this problem, a heuristic method based on a preprocessing stage that precedes the construction of the searching tree is proposed. Further, the results of the experiments comparing the time of the test generation and the congruence of the test variants generated by the algorithm either using or non-using this heuristics are presented. According to these results the use of the generator with the proposed heuristics provides a considerably shorter time of generation, and the congruence of the generated test variants is even better in most cases.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2018

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Journal on Efficiency and Responsibility in Education and Science

  • ISSN

    2336-2375

  • e-ISSN

  • Volume of the periodical

    11

  • Issue of the periodical within the volume

    4

  • Country of publishing house

    CZ - CZECH REPUBLIC

  • Number of pages

    7

  • Pages from-to

    78-84

  • UT code for WoS article

    000455342400003

  • EID of the result in the Scopus database

    2-s2.0-85061395557