Algorithms for ranking and unranking the combinatorial set of closed questionnaire answers

In this paper, we study the combinatorial set of closed questionnaire answers with a specified minimum number of correct answers. For this combinatorial set, we obtain an explicit formula for its cardinality function. Using the obtained cardinality function, we construct the corresponding AND/OR tre...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1611; no. 1; pp. 12069 - 12074
Main Authors Shcheglov, P P, Filippov, G A, Shablya, Y V, Kruchinin, D V
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.08.2020
Subjects
Algorithms
Combinatorial analysis
Physics
Questionnaires
Ranking
Online AccessGet full text

Cover

More Information
Summary:In this paper, we study the combinatorial set of closed questionnaire answers with a specified minimum number of correct answers. For this combinatorial set, we obtain an explicit formula for its cardinality function. Using the obtained cardinality function, we construct the corresponding AND/OR tree structure and determine the bijecion rules for this AND/OR tree and the considered combinatorial set. In addition, we develop ranking and unranking algorithms for the combinatorial set.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1611/1/012069