Errata
Corrections
Summer 2004 Corrections
- 6.21.04 In Signed Int:
Overview , I wrote "...for example, if 75% of the
representations are positive values, then you won't be able to negate
50% of the positive values." when it should have been "if 75%
of the representations are positive values, then you won't be able to
negate 2/3 of the positive values (assuming 25% of the representations
are negations of the positive values)."
(B. L. Narayan, Indian Statistical Institute)
Spring 2004 Corrections
Fall 2003 Corrections
Summer 2003 Corrections
- 6.11.03 In Bits, Bytes,
and Nybbles, the new section at the end where you determine
the minimum K bits for N items, I had K and
N swapped.
- 6.24.03 In Case Study:
Implementing Subroutines with Arrays, I computed the return value
using the instruction move $v0, $t1. It should have been
move $v0, $t0 (Renie).
- 6.24.03 In Half Adders, Full
Adders, Ripple Carry Adders, I summed 110 + 011 incorrectly
near the beginning of the tutorial. This now sums correctly.
I also mention in the beginning that we're adding UB numbers.
In the conclusion, I saw full adders add 2 bits. They add 3 bits.
(Black).
- 6.28.03 In Implementing Boolean
Functions, I had "disjunctive normal form" and "conjunctive normal
form" backwards. If you do a websearch, and find the "Wikipedia",
it defines "disjunctive normal form" the same way we define
sum of products. I've also added a new section on product terms,
and explained how they differ from minterms.
(Renie).
- 6.29.03 In Case Study:
Implementing a 5-1 MUX , Row 4 lists c2 = 0.
It should be c2 = 1. (A. Kim)
- 7.8.03 In Fully Associative
Caches , the tag bits are listed as B31-25.
It should be B31-5. (McCall)
Spring 2003 Corrections
- 43=81 should be 34=81
(Neha)
- 1.14.03 In Converting From
Base 10 to Base K, I convert a number to 11. It should have been 13.
(Reed)
- 3.05.03 In Signed Integers, the charts for
signed magnitude, one's complement, and two's complement have been
corrected. They had the incorrect minimum and maximum values.
(Gustavo)
- 3.05.03 In Sign Extension, more text was added
about "zero extension".
- 3.05.03 Corrected, the conclusion of
Signed Int: Two's Complement
so it has the correct conclusion. Added a paragraph about errors
made in 2C. (Young)
- 3.07.03 Corrected errors regarding maximum value in
excess notation in Signed Int:
Excess/Bias Representation. Also, cleaned up some of the text,
and added some more sentences.
- 3.10.03 Cleaned up a little of the explanation for
the last few paragraphs about Big and Little
Endian. Added a section about character data. (Svetlana)
- 3.15.03 In the example from Signed Int:
Excess/Bias Representation, in excess 5, the representation 111
maps to the value 2, not 3. (Unknown)
- 3.15.03 In Converting from Base
10 to Base K, it says that 1011 maps to 13. That's incorrect.
1101 maps to 13. (Jon)
- 3.16.03 In Is Any Bit Set
Within a Range?, it says that to create n - numOnes zeroes
and numOnes zeroes, you should do mask >> numOnes.
That's incorrect. It should be mask >> (numBits - numOnes).
(Jon)
Web Accessibility