Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
