1. Linear Feedback Shift Register
| Printed: | Use taps 3 and 10 |
| Fixed: | For maximum period LFSR use taps 1 and 10 or 8 and 10 |
2.12 Primitive Types
| Printed: | multiply (in int row) |
| Fixed: | divide |
2.26 If-Else
| Printed: | false true (in diagram) |
| Fixed: | true false |
2.28 Oblivious Sorting
| Printed: | > (three places) |
| Fixed: | < |
2.28 Gambler's Ruin
| Printed: | Math.random() > 0.5 |
| Fixed: | Math.random() < 0.5 |
6.21 Euler's Method
| Printed: | dx/dt dx/dt, dx/dt |
| Fixed: | dx/dt dy/dt, dz/dt |
8.18 Using the TOY Machine: Run
| Printed: | Set 8 memory addresses to address of first instruction |
| Fixed: | Set 8 memory addresses to address of first instruction and press LOOK |
9.11 Standard Output
| Printed: | RA <- mem[01] |
| Fixed: | RB <- mem[01] |
9.11 Standard Output
| Printed: | RA <- mem[00] |
| Fixed: | RA <- mem[01] or change Java comments to do-while loop |
9.15 TOY Arrays
| Printed: | Load Indirect (opcode B), Store Indirect (opcode A) |
| Fixed: | Load Indirect (opcode A), Store Indirect (opcode B) |
13.3 Defining Data Types
| Printed: | characterized |
| Fixed: | characterized by |
13.26 Complex Number Data Type
| Printed: | public Complex multiply |
| Fixed: | public static Complex multiply |
14.18, 14.19 A Bridge Experiment
| Printed: | public int rank and public int suit |
| Fixed: | public int getRank and public int getSuit |
14.7 Sample Client
| Printed: | System.out.println(c1) |
| Fixed: | System.out.println(c2) |
14.11
| Printed: | Math.random() * i |
| Fixed: | Math.random() * (i+1) |
14.21
| Printed: | int freq[] |
| Fixed: | int[] freq is better Java style |
15.32 List Implementation
| Printed: | return value of head = x |
| Fixed: | first = x |
16.14 Class Object
| Printed: | return value of remove |
| Fixed: | return value of get |
16.15 Linked List Implementation: Performance
| Printed: | java Dedup |
| Fixed: | java DeDup |
16.18 Hash Table Implementation
| Printed: | int i = hash(k, M) |
| Fixed: | int i = hash(k) |
16.18 Hash Table Implementation
| Printed: | void put and void get |
| Fixed: | better style: public void put and public void get |
17.22 Analysis
| Printed: | Iranaian |
| Fixed: | Iranian |
18
| Printed: | java RE "..oo.oo." bloodroot |
| Fixed: | java RE "..oo..oo." bloodroot |
20.3 Overview
| Printed: | Jon |
| Fixed: | John |
20.25 Computational Complexity of Problems
| Printed: | log2N |
| Fixed: | log2N |
20.6 Extended Church-Turing Thesis
| Printed: | T(N)k |
| Fixed: | T(N)k |
21.6 Intractability
| Printed: | Peter Schor |
| Fixed: | Peter Shor |
22 Security through Obscurity
| Printed: | Kerchoff |
| Fixed: | Kerckhoffs |
Barnes Hut Assignment
| Printed: | in the 5 body picture, c is drawn in the wrong place |
| Fixed: |