Errata
The errata list is a list of errors and their corrections that were found after the product was released. If the error was corrected in a later version or reprint the date of the correction will be displayed in the column titled "Date Corrected".
The following errata were submitted by our customers and approved as valid errors by the author or editor.
Color key: Serious technical mistake Minor technical mistake Language or formatting error Typo Question Note Update
Version | Location | Description | Submitted By | Date submitted | Date corrected |
---|---|---|---|---|---|
paragraph after example 8-2 |
after example 8-2 , there is an unnumbered example using "futures" Note from the Author or Editor: |
Nethanel Elzas | Jul 27, 2015 | ||
All of the minus signs in the calculus formulas are plus signs. The second formula should read: Note from the Author or Editor: |
Anonymous | Aug 06, 2015 | |||
ePub |
Memory Fragmentation |
def norm_squared_generator_comprehension(vector): Note from the Author or Editor: |
Ahmed Sharif | May 22, 2016 | |
I chapter 1 |
"unit" -> "units" |
Zachary Kneupper | Jan 06, 2020 | ||
Printed | Page 32 2nd paragraph |
"julia1_cprofile.py" should probably be "julia1_nopil.py". Otherwise, there is no other reference to "julia1_cprofile.py" in the rest of the book Note from the Author or Editor: |
Sean Law | Jul 18, 2015 | |
Printed | Page 36 pip install runsnake |
pip install runsnakerun Note from the Author or Editor: |
colin dick | Jun 10, 2015 | |
Page 73 last paragraph |
I may be misguided by my mind but... Note from the Author or Editor: |
Jan Pipek | Aug 31, 2014 | ||
Printed, PDF, ePub | Page 73 last paragraph |
In the sentence Note from the Author or Editor: |
Lauran | Jul 23, 2015 | |
Page 76 last several paragraph |
I'm pretty sure that the time complexity analysis about list_unique_names() on the previous page (Page 75) is wrong. It's not O(nlogn) but O(n^2). And that's why the set algorithm give a drastic 267x speedup - because it's O(n^2) vs O(n), not O(nlogn) vs O(n). Note from the Author or Editor: |
Liang He | Dec 20, 2014 | ||
Page 101 equation |
The derivative was approximated to a sum instead of a subtraction. Note from the Author or Editor: |
Bruno | Nov 02, 2017 | ||
Printed | Page 102 1 |
the upper part of the fraction is u(x+dx,t) + u(x+dx,t) + 2.u(x,t) where it should be u(x+dx,t)+u(x-dx,t)+2.u(x,t) ? The 2nd term should be u(x-dx,t) (note the sign - instead of +) ? Note from the Author or Editor: |
Louis Storme | Oct 14, 2014 | |
Printed | Page 104 Pseudocode for example 6-2 |
On the fourth line: u[j][(j-1)%M] should be u[i][(j-1)%M] Note from the Author or Editor: |
James Scott | May 17, 2019 | |
Printed | Page 143 3rd paragraph |
"opimize" --> "optimize" Note from the Author or Editor: |
Patrick | Jul 10, 2017 | |
Page 211 Example 9-2 |
In the Example 9-2 in the book, the pool uses calculate_pi: Note from the Author or Editor: |
Sajjad | Sep 16, 2019 | ||
Printed | Page 211 Example 9-2 |
In example 9-2, the pool.map calls a function "calculate_pi". But in example 9-1 it's called estimate_nbr_points_in_quarter_circle. Note from the Author or Editor: |
William Smith | Oct 19, 2019 | |
Printed | Page 251 Last paragraph |
The text says "example 9-28 shows the important steps taken to share this array". But the code to do that is in example 9-30. Note from the Author or Editor: |
William Smith | Oct 19, 2019 | |
Printed | Page 253 2nd paragraph |
--Syou'll see that at the top ... Note from the Author or Editor: |
Sajjad | Sep 24, 2019 | |
Printed | Page 321 1st non-code paragraph |
"Also, there are some imperially derived constants..." Note from the Author or Editor: |
Kjell Swedin | Jun 01, 2015 |