Code ch. 2 — counting Morse combinations, why two symbols of length n give 2ⁿ codes, and decoding with a binary tree.
Resource Cheatsheet
7 entries across collections.
Code ch. 2 — counting Morse combinations, why two symbols of length n give 2ⁿ codes, and decoding with a binary tree.
Resource Cheatsheet
Code ch. 10 — counting in other bases: octal, base 4 and binary, converting between them, and where octal still shows up in Linux permissions.
Resource Cheatsheet
Code ch. 11 — the bit as a yes/no answer, 2ⁿ possibilities, how many bits a choice needs, barcodes with check digits, and QR codes.
Resource Cheatsheet
Code ch. 12 — the 8-bit byte, nibbles, hexadecimal digits and conversion, hex notation, and where hex appears in everyday IT.
Resource Cheatsheet
Code ch. 14 — binary addition, XOR, the half adder and full adder, chaining them into an 8-bit ripple-carry adder, and overflow.
Resource Cheatsheet
Code ch. 16 — subtracting with an adder: nines' complement, ones' and two's complement, signed numbers, and overflow.
Resource Cheatsheet
TCM Practical Help Desk section 3 — binary, bits and bytes, character encoding, logic gates and how a CPU computes, compilers and abstraction.
Resource Cheatsheet