Tip: Choose Save as PDF in the print dialog to download. Use A4 paper size.
Shade in the A or B circle for each question.
Draw a line connecting each item on the left to its match on the right.
| Left column | Right column | |
|---|---|---|
| 1000, 001, 010, 011, 100, 101, 110, 111 | AC: 0 1 0 1 0 1 0 1 | |
| 22 x 2 x 2 = 8 | BA: 0 0 0 0 1 1 1 1 | |
| 3A changes slowest: the A column is four 0s and then four 1s | CThe table stops at 101, so rows 110 and 111 are missing. A three-input truth table needs all 8 rows, ending at 111. | |
| 4C changes fastest: the C column alternates 0 and 1 on every row | DThe eight input rows of a three-input truth table, written in binary counting order | |
| 5A B C rows: 000, 001, 010, 011, 100, 101 (6 rows) | EThe number of rows needed for a truth table with three inputs | |
| 6A B C rows: 000, 010, 001, 011, 100, 110, 101, 111 | FThe rows are not in binary counting order: 010 comes before 001, and 110 comes before 101. C should change fastest. |
Complete each line of code by filling in the missing parts.
Shade in the letter of the line that contains an error.
000 to 111 — A three-input truth table has 8 rows (2 x 2 x 2) in binary counting order from 000 to 111, with A changing slowest and C changing fastest.rows = 2 ^ 3 = 8000
001
010First row: 000
Last row: 111A is 0 for the first 4 rows
A is 1 for the last 4 rowsFastest changing column: C
Slowest changing column: A