|
MODD / Mr. Hansen |
Name: _______________________ |
MODD Course Outline (Draft 3B)
|
W 9/7 |
Introduction, ground rules, planning the semester’s
topics |
|
|
Th 9/8 |
Unit
0x00: Logical Building Blocks |
|
|
F 9/9 |
|
|
|
M 9/12 |
|
01 rules for +, ·, Å, and ~ 02 truth tables 03 AND (Ù), OR (Ú), NOT (Ø) 04 digital circuit |
|
T 9/13 |
|
notation 05
Þ, Ü, Û, etc. 06 Boolean algebra 07 DeMorgan’s
laws, distributive laws |
|
W 9/14 |
|
08 " and $ 09
advanced negation 0A simplifying 0B proving conjectures 0C deduction vs. |
|
Th 9/15 |
|
induction 0D
automated theorem proving 0E
Gödel’s Theorem 0F fuzzy logic |
|
F 9/16 |
|
|
|
M 9/19 |
|
|
|
T 9/20 |
|
Unit Quiz |
|
|
|
|
|
W 9/21 |
Unit
0x10: Bits, Bytes, Hex, and Hertz |
|
|
Th 9/22 |
|
11 bit, nybble, byte, word, dword, qword 12
K, M, G, T 13 210 » 103 14
binary 15 octal |
|
F 9/23 |
|
16 hex (0x) 17
ASCII 18 the mysterious MZ 19 baud, kbps, mbps 1A Hz, KHz, MHz, GHz |
|
M 9/26 |
|
1B wavelength vs. frequency 1C aliasing 1D
bandwidth 1E muxing
1F time |
|
T 9/27 |
|
|
|
W 9/28 |
|
|
|
Th 9/29 |
|
Unit Quiz |
|
|
|
|
|
F 9/30 |
Unit
0x20: What’s So Great About Digital? |
|
|
M 10/3 |
|
21 analog defined 22
digital defined 23 digital design 24 Which is “natural”? 25 ADC |
|
T 10/4 |
|
26 DAC 27
noise as a concept 28 dodging
noise 29 endianness,
an unavoidable mess |
|
W 10/5 |
|
2A
advantages of analog 2B advantages
of digital 2C Why weren’t Bell and
Edison digital? |
|
Th 10/6 |
|
2D Philosophical issue: Does analog exist? 2E retro digital 2F binary future? Unit
Quiz |
|
F 10/7 |
No school |
|
|
M 10/10 |
No school |
|
|
|
|
|
|
T 10/11 |
Unit
0x30: Audio |
|
|
W 10/12 |
|
31 crash course in electronics: volts, amps, ohms,
R/C/L 32 crash course in
logarithms |
|
Th
10/13 |
|
33 bels and dB 34 noise revisited 35 S/N 36 AM 37 FM 38 companding
39 PCM, ASK, |
|
F 10/14 |
|
FSK, PSK 3A
sampling rate, Nyquist’s Theorem 3B signal processing 3C FFT 3D audio |
|
M 10/17 |
|
CD 3E
data CD, MP3 3F HDR |
|
T 10/18 |
|
Review (Form VI retreat day) |
|
W 10/19 |
|
Unit Quiz |
|
|
|
|
|
|
Unit
0x40: Compression |
|
|
Th
10/20 |
|
41 old term revisited: baud 42 motivation for compression 43 overview of CCITT (now |
|
F 10/21 |
|
ITU) fax protocols 44 SSTV simulation 45
RLE 46 MP3 47 JPEG (JPG) 48 MPEG |
|
M 10/24 |
|
49 lossy compression 4A lossless compression 4B legal implications 4C Huffman coding |
|
T 10/25 |
|
4D LZ, LZH, LZW, ZIP 4E fractal/predictive compression 4F redundancy and zippability |
|
W 10/26 |
|
Unit Quiz (last
graded item in first quarter) |
|
|
|
|
|
Th
10/27 |
Unit
0x50: Video |
|
|
F 10/28 |
|
51 engineering challenge: bandwidth 52 alternatives to full motion 53 still images |
|
M 10/31 |
|
54 bit depth 55
posterization 56
digital special effects using XOR 57
endianness revisited |
|
T 11/1 |
|
58 full motion codecs 59 digital cable 5A DVD 5B buffer underrun 5C
HDTV, multipath |
|
W 11/2 |
|
5D preview of Unit 0x80 5E animation 5F the
problem with picture phones |
|
Th 11/3 |
|
Unit Quiz |
|
F 11/4 |
No school |
|
|
|
|
|
|
M 11/7 |
Unit
0x60:Computation |
|
|
T 11/8 |
|
61 half adders 62
full adders 63 multipliers 64 registers and bit shifts 65 integer, longint, |
|
W 11/9 |
|
floating point 66
one’s complement 67 two’s complement
68 IEEE floating point |
|
Th
11/10 |
|
69 flops 6A
algorithmic efficiency (UCSMP p. 453) 6B
BCD 6C overflow, underflow |
|
F 11/11 |
|
6D machine e 6E
rounding and truncation errors 6F
error propagation |
|
M 11/14 |
|
Unit Quiz |
|
|
|
|
|
T 11/15 |
Unit
0x70: Cryptography |
|
|
W 11/16 |
|
71 codes vs. ciphers 72 hashing 73 hashing
vs. PNG output 74 importance of
good PNG |
|
Th
11/17 |
|
75 entropy sources 76 general concepts: one-way functions, asymmetry 77 hidden in plain |
|
F 11/18 |
|
sight: steganography 78 one-time pads 79 engineering challenges: key transmittal, identity |
|
M 11/21 |
|
verification 7A
overview of RSA, PKI 7B
introduction to combinatorics 7C mathematical |
|
T 11/22 |
|
defenses against hackers 7D other defenses against hackers 7E abstraction: search space |
|
W, Th, F |
No school |
|
|
M 11/28 |
|
7F Question: Should data be encrypted before or after compression? |
|
T 11/29 |
|
Unit Quiz |
|
W 11/30 |
Unit
0x80: Error Correction |
|
|
Th 12/1 |
|
81 noise 82
chaos 83 detection vs. correction 84 parity 85 XON/XOFF protocols 86
CRC |
|
F 12/2 |
House Tour (no class for Form IV; extra-help session
in Mr. Hansen’s office for Form VI) |
|
|
M 12/5 |
|
87 Levenshtein distance 88 Hamming distance 89 Hamming codes 8A other metrics |
|
T 12/6 |
|
8B bar codes 8C
VIN 8D RFID 8E protocol design 8F
the telephone game Unit Quiz |
|
W 12/7 |
Unit
0x90: Information Theory |
|
|
Th 12/8 |
|
91 Nyquist’s Theorem
revisited 92 redundancy revisited 93 entropy defined 94 Claude |
|
F 12/9 |
|
Shannon, “father of information theory” 95 information theory defined 96 full answer to |
|
M 12/12 |
|
question 0x7F |
|
T 12/13 |
|
Written
report and 10-minute oral presentation due today (no unit quiz) |
|
W 12/14 |
Unit
0xA0: Networking |
|
|
Th
12/15 |
|
A1 topology A2
probability of collisions A3 IP
addressing (dotted quad) A4 fault
tolerance |
|
F 12/16 |
|
A5 downtime A6
packet design A7 cascading errors A8 complexity (contrasted with chaos) |
|
M 1/1 |
No school |
|
|
T 1/2 |
|
Review |
|
W 1/3 |
|
Combined
Unit Quiz (Units 0x90 and 0xA0) |
|
Th 1/4 |
|
Review |
|
F 1/5 |
|
Review |
|
TBA |
Comprehensive
exam, Units 0x00 through 0x0A |
|