--- title: Determine the least number of coins by which change of two pounds ei… — Olympiad: best buys and change at the… · tree and pragmatics description: Determine the least number of coins by which change of two pounds eighty pence may be tendered. Exam question 2 of lesson 41 «Olympiad: best buys and change at the till ★★★» of the money course of Mova's primary school, with the dependency tree and pragmatics of the question and of each option; Mova --- [Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/corpora/questions/money/41-olympiad-best-buys-and-change-at-the-till/e2/) [home](https://md.mova.elamur.ai/free/en/) / [corpora](https://md.mova.elamur.ai/free/en/corpora/) / [questions](https://md.mova.elamur.ai/free/en/corpora/questions/) / [Money](https://md.mova.elamur.ai/free/en/corpora/questions/money/) / [Olympiad: best buys and change at the…](https://md.mova.elamur.ai/free/en/corpora/questions/money/41-olympiad-best-buys-and-change-at-the-till/) / e2 # Exam question 2 · Olympiad: best buys and change at the till ★★★ Determine the least number of coins by which change of two pounds eighty pence may be tendered. **Mova's choice:** option 1 · **The right answer:** option 4 · wrong ✗ · **Who acts:** you, change, two pounds · **What happens:** determine, tender, coin, change · **To what, where:** least number This is exam question 2 of lesson 41 «Olympiad: best buys and change at the till ★★★» of the money course of Mova's primary school, asked in stiff, formal language. The page gives the question's syntax tree — a dependency tree in the style of Universal Dependencies — and its pragmatics clause by clause, then the 4 options as the student saw them, each with its tree and pragmatics. Every text is parsed by Mova itself. How the student answered it, with the score of every option and why: [the test at school](https://md.mova.elamur.ai/free/en/school-run/money/41-olympiad-best-buys-and-change-at-the-till/#e2). ## The question {#question} ```conllu # sent_id = question:money:41-olympiad-best-buys-and-change-at-the-till:e2:1 # text = Determine the least number of coins by which change of two pounds eighty pence may be tendered. 1 Determine determine VERB VB Mood=Imp|VerbForm=Fin 0 root _ _ 2 the the DET DT Definite=Def|PronType=Art 4 det _ _ 3 least least ADJ JJS Degree=Sup 4 amod _ _ 4 number number NOUN NN Number=Sing 17 nsubj:pass _ _ 5 of of ADP IN _ 6 case _ _ 6 coins coin NOUN NNS Number=Plur 4 nmod _ _ 7 by by ADP IN _ 9 case _ _ 8 which which DET WDT PronType=Int 9 det _ _ 9 change change NOUN NN Number=Sing 6 nmod _ _ 10 of of ADP IN _ 12 case _ _ 11 two two NUM CD NumForm=Word|NumType=Card 12 nummod _ _ 12 pounds pound NOUN NNS Number=Plur 9 nmod _ _ 13 eighty eighty NUM CD NumForm=Word|NumType=Card 14 nummod _ _ 14 pence pence NOUN NNS Number=Plur 12 conj _ _ 15 may may AUX MD VerbForm=Fin 17 aux _ _ 16 be be AUX VB VerbForm=Inf 17 aux:pass _ _ 17 tendered tender VERB VBN Tense=Past|VerbForm=Part|Voice=Pass 1 ccomp _ SpaceAfter=No 18 . . PUNCT . _ 1 punct _ _ ``` | # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by | | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | | 1 | **determine** | imperative | you *not said here* | | | | | | vn conjecture-29.5 «NP V that S»: agent=Agent clause=Theme | | 2 | **tender** | may · passive | | the least number of coins by which change of two pounds and eighty pence | | | | | tree rules | | 3 | **coin** | | which change of two pounds and eighty pence | | | | | | nom coin «possession transitive»: by=agent | | 4 | **change** | | two pounds and eighty pence | | | | | | nom change «event intransitive»: of=agent | One row per clause the reader finds. «not said here»: a role filled from the clause above. «roles by»: a VerbNet class and frame when one fits the verb, else the reader's rules on the tree. ## The options {#options} ### Option 1 · ← Mova's choice {#o1} Five ```conllu # sent_id = question:money:41-olympiad-best-buys-and-change-at-the-till:e2:o1:1 # text = Five 1 Five five NUM CD NumForm=Word|NumType=Card 0 root _ _ ``` The frames reader finds no event or fact in this sentence. ### Option 2 {#o2} Six ```conllu # sent_id = question:money:41-olympiad-best-buys-and-change-at-the-till:e2:o2:1 # text = Six 1 Six six NUM CD NumForm=Word|NumType=Card 0 root _ _ ``` The frames reader finds no event or fact in this sentence. ### Option 3 {#o3} Three ```conllu # sent_id = question:money:41-olympiad-best-buys-and-change-at-the-till:e2:o3:1 # text = Three 1 Three three NUM CD NumForm=Word|NumType=Card 0 root _ _ ``` The frames reader finds no event or fact in this sentence. ### Option 4 · ✓ the right answer {#o4} Four ```conllu # sent_id = question:money:41-olympiad-best-buys-and-change-at-the-till:e2:o4:1 # text = Four 1 Four four NUM CD NumForm=Word|NumType=Card 0 root _ _ ``` The frames reader finds no event or fact in this sentence. **Text:** the tests of Mova's primary school, written for Mova (`world/data/school/`), as the course runner gave them to the student. **Trees:** Mova's own parse — the `en` model on the CPU, when the site is built — not checked by a teacher; they may be wrong. **Frames:** Mova's frames reader (`prag`), each text read on its own. Elamur Cosmic License. - ← previous: [Olympiad: best buys and change at the…, exam 1](https://md.mova.elamur.ai/free/en/corpora/questions/money/41-olympiad-best-buys-and-change-at-the-till/e1/) - next →: [Olympiad: best buys and change at the…, exam 3](https://md.mova.elamur.ai/free/en/corpora/questions/money/41-olympiad-best-buys-and-change-at-the-till/e3/) - ↑ back to [Olympiad: best buys and change at the till ★★★](https://md.mova.elamur.ai/free/en/corpora/questions/money/41-olympiad-best-buys-and-change-at-the-till/)