Skip to content

Modern Matching #843

Open
Open
@Alex-Jordan

Description

@Alex-Jordan

Thanks to recent work, we now have most of the "classic" multiple choice styles of question covered using some MathObjects parser:

  1. Choose one from a list of short items with no math: DropDown() from parserPopUp.pl
  2. True or False: DropDownTF() from parserPopUp.pl
  3. Choose one from a list of long items or items containing math: RadioButtons() from parserRadioButtons.pl
  4. Choose some subset from a list: CheckboxList from parserCheckboxList.pl

I think that leaves one classic MC type question: matching exercises. One list of M items, and another list of N items, and some way to indicate each item from the first list "goes with" some item from the second list. Not necessarily injective or surjective.

Is there a "modern" (PGML + MathObjects) way to write such exercises? If you are familiar with parserCheckboxList.pl (maybe that is only @drgrice1) can you envision something working out for matching? Markup could be like:

$m = Matching(["fruit", "vegetable"], [["apple", "banana", "cauliflower", "date"]], [0, 0, 1, 0])

That's hard enough to sort out, but then how to lay out the two lists and what mechanism would be used to indicate connections...

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions