|
| 1 | +# Review and Logistics |
| 2 | + |
| 3 | +## Checker action |
| 4 | + |
| 5 | +I created a branch `checkaction`; merge it into your main branch to be able to run the action form the actions tab. |
| 6 | + |
| 7 | +## IDEA |
| 8 | + |
| 9 | +You get a small number of free corrections if 75% of the students respond to the survey. |
| 10 | + |
| 11 | +## Final Due Date |
| 12 | + |
| 13 | +11/19 is the last time to submit any work. |
| 14 | + |
| 15 | +## Review Questions |
| 16 | + |
| 17 | +### How are number systems chosen ? |
| 18 | + |
| 19 | +- [ ] the optimal one for each scenario is evaluated |
| 20 | +- [ ] they are cultural artifacts |
| 21 | +- [ ] the only systems are decimal (10 fingers) and binary (on/off) |
| 22 | + |
| 23 | + |
| 24 | + |
| 25 | +### What happens in linking? |
| 26 | + |
| 27 | +- [ ] code from includes is copied into the file |
| 28 | +- [ ] binaries for compiled libraries is combined with the compiled program code |
| 29 | +- [ ] code is translated from assembly to machine code |
| 30 | +- [ ] code is translated from a high level language to assembly |
| 31 | + |
| 32 | + |
| 33 | +### How can we figure out what gates to use to a calculation? |
| 34 | + |
| 35 | +- [ ] memorize them |
| 36 | +- [ ] experiment |
| 37 | +- [ ] compare logic tables |
| 38 | + |
| 39 | + |
| 40 | + |
| 41 | + |
| 42 | +### What are three factors that you could use to choose the right langague for a project? |
| 43 | + |
| 44 | +_assuming you know or have time and motivation to learn many languages_ |
| 45 | + |
| 46 | +### What types of problems would you look for if you got a linking error? |
| 47 | + |
| 48 | + |
| 49 | + |
| 50 | +### What is the relationship between a half adder and a full adder? |
| 51 | + |
| 52 | +- [ ] a half adder adds half of the bits in the register and the full adds all |
| 53 | +- [ ] a half adder adds two one bit numbers into a two bit number; a full adder adds two one bit numbers and a carry bit into a one bit output and a carry bit |
| 54 | +- [ ] a half adder adds two one bit numbers into 1 bit; a full adder adds two one bit numbers into two bits |
| 55 | +## Review today's class |
| 56 | + |
| 57 | +```{include} ../_review/2022-12-07.md |
| 58 | +``` |
| 59 | + |
| 60 | + |
| 61 | + |
| 62 | +## Prepare for Next Class |
| 63 | + |
| 64 | +```{include} ../_prepare/2022-12-07.md |
| 65 | +``` |
| 66 | + |
| 67 | + |
| 68 | + |
| 69 | +## More Practice |
| 70 | + |
| 71 | +```{include} ../_practice/2022-12-07.md |
| 72 | +``` |
| 73 | + |
0 commit comments