--- title: Count them: in binary, each switch is on or off. How many different… — Computers and screens · tree and pragmatics description: Count them: in binary, each switch is on or off. How many different patterns can 2 switches make? Test 7 · ★★ of lesson 36 «Computers and screens» of the technology course of Mova's primary school, with the dependency tree and pragmatics of the question and of each option; Mova's choice was wrong. --- [Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/corpora/questions/technology/36-computers-and-screens/t7/) [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/) / [Technology](https://md.mova.elamur.ai/free/en/corpora/questions/technology/) / [Computers and screens](https://md.mova.elamur.ai/free/en/corpora/questions/technology/36-computers-and-screens/) / t7 # Test 7 · ★★ · Computers and screens Count them: in binary, each switch is on or off. How many different patterns can 2 switches make? **Mova's choice:** option 1 · **The right answer:** option 2 · wrong ✗ · **Who acts:** you, switch, many different patterns · **What happens:** count, be, make · **To what, where:** them This is test 7 · ★★ of lesson 36 «Computers and screens» of the technology course of Mova's primary school. 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/technology/36-computers-and-screens/#t7). ## The question {#question} *Sentence 1:* Count them: in binary, each switch is on or off. ```conllu # sent_id = question:technology:36-computers-and-screens:t7:1 # text = Count them: in binary, each switch is on or off. 1 Count count VERB VB Mood=Imp|VerbForm=Fin 0 root _ _ 2 them they PRON PRP Case=Acc|Number=Plur|Person=3|PronType=Prs 1 obj _ SpaceAfter=No 3 : : PUNCT : _ 5 punct _ _ 4 in in ADP IN _ 5 case _ _ 5 binary binary NOUN NN Number=Sing 1 parataxis _ SpaceAfter=No 6 , , PUNCT , _ 10 punct _ _ 7 each each DET DT PronType=Tot 8 det _ _ 8 switch switch NOUN NN Number=Sing 10 nsubj _ _ 9 is be AUX VBZ Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin 10 cop _ _ 10 on on ADV RB _ 5 conj _ _ 11 or or CCONJ CC _ 12 cc _ _ 12 off off ADV RB _ 10 conj _ SpaceAfter=No 13 . . PUNCT . _ 1 punct _ _ ``` | # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by | | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | | 1 | **count** | imperative | you *not said here* | them *= they* | | | | | vn multiply-108 «NP V NP»: agent=Agent they=Theme | | 2 | **is** | present | each switch | | | | | on *property* | tree rules | 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. *Sentence 2:* How many different patterns can 2 switches make? ```conllu # sent_id = question:technology:36-computers-and-screens:t7:2 # text = How many different patterns can 2 switches make? 1 How how ADV WRB PronType=Int 2 advmod _ _ 2 many many ADJ JJ Degree=Pos 4 amod _ _ 3 different different ADJ JJ Degree=Pos 4 amod _ _ 4 patterns pattern NOUN NNS Number=Plur 8 nsubj _ _ 5 can can AUX MD VerbForm=Fin 8 aux _ _ 6 2 2 NUM CD NumForm=Digit|NumType=Card 7 nummod _ _ 7 switches switch NOUN NNS Number=Plur 8 nsubj _ _ 8 make make VERB VB VerbForm=Inf 0 root _ SpaceAfter=No 9 ? ? PUNCT . _ 8 punct _ _ ``` | # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by | | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | | 1 | **make** | can | many different patterns | | | | | | vn build-26.1-1 «NP.asset V NP»: agent=Asset | ## The options {#options} ### Option 1 · ← Mova's choice {#o1} 8 ```conllu # sent_id = question:technology:36-computers-and-screens:t7:o1:1 # text = 8 1 8 8 NUM CD NumForm=Digit|NumType=Card 0 root _ _ ``` The frames reader finds no event or fact in this sentence. ### Option 2 · ✓ the right answer {#o2} 4 ```conllu # sent_id = question:technology:36-computers-and-screens:t7:o2:1 # text = 4 1 4 4 NUM CD NumForm=Digit|NumType=Card 0 root _ _ ``` The frames reader finds no event or fact in this sentence. ### Option 3 {#o3} 3 ```conllu # sent_id = question:technology:36-computers-and-screens:t7:o3:1 # text = 3 1 3 3 NUM CD NumForm=Digit|NumType=Card 0 root _ _ ``` The frames reader finds no event or fact in this sentence. ### Option 4 {#o4} 2 ```conllu # sent_id = question:technology:36-computers-and-screens:t7:o4:1 # text = 2 1 2 2 NUM LS NumForm=Digit|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: [Computers and screens, test 6](https://md.mova.elamur.ai/free/en/corpora/questions/technology/36-computers-and-screens/t6/) - next →: [Computers and screens, test 8](https://md.mova.elamur.ai/free/en/corpora/questions/technology/36-computers-and-screens/t8/) - ↑ back to [Computers and screens](https://md.mova.elamur.ai/free/en/corpora/questions/technology/36-computers-and-screens/)