Track quiz
Before the questions, here is each idea in one line.
| Idea | The line to keep |
|---|---|
| One switch | A bit can be pictured as one switch with two states. A state means something only if both ends agreed first. |
| More switches | Each new switch doubles the list of patterns. One copy gets a down in front. The other gets an up. |
| A code | A code is an agreed table of pattern and meaning. Both ends hold the same copy. |
| Rows and columns | A row is one record, all the facts about one thing. A column is one field, one kind of fact. |
| Sort and filter | Sorting puts whole rows in order. Filtering hides rows that fail a test. Neither changes a fact in the table. |
A bit can be pictured as one switch with two states. What do we write for the two states?
You read one switch once. Can it carry three messages: now, later, not at all?
Three switches sit in a row. How many patterns can they make?
You want to label 12 months with switches. How many switches are enough?
Eight switches kept together are called a byte. How many patterns can a byte make?
A code table gives six of eight patterns a letter. Someone sends one of the other two. What comes out?
You send MANGO with one code table. The receiver reads it with a different table. What happens?
A table has three columns: Fruit, Day and Crates. What is one row?
A cell holds "Mango, Monday". What is wrong with it?
A table is sorted by Crates sold, largest first. What happens to each Price?
A table has 18 rows. You filter to Saturday and 3 rows show. How many rows does the table hold?
Which two steps find the fruit that sold most on Saturday?
You can now say how a saved word is written. Switches are set to a pattern. An agreed table gives the pattern its meaning. You can keep facts in rows and columns. Then you can sort and filter them to answer a question.
A table is rows of facts somebody wrote down. AI Literacy II: Training and Decision Trees takes that pile. It asks a program to find the pattern in it.