Difference between revisions of "Touch of class typos"
(→PART IV: OBJECT-ORIENTED TECHNIQUES 533) |
|||
| Line 15: | Line 15: | ||
(Indeed Luchin Doblies reported this error -- thanks! BM.) The entry should appear in the section for the corresponding chapter (it does now). I am sorry that I will not be able to respond to individual comments, but I will consider all reports and correct the text as needed. | (Indeed Luchin Doblies reported this error -- thanks! BM.) The entry should appear in the section for the corresponding chapter (it does now). I am sorry that I will not be able to respond to individual comments, but I will consider all reports and correct the text as needed. | ||
| + | |||
| + | As errors get corrected I move the corresponding reports to the second part of the page ("Previously reported"). | ||
===Preface etc.=== | ===Preface etc.=== | ||
| Line 36: | Line 38: | ||
===15 Recursion and trees=== | ===15 Recursion and trees=== | ||
===16 Devising and engineering an algorithm: Topological Sort=== | ===16 Devising and engineering an algorithm: Topological Sort=== | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
===PART IV: OBJECT-ORIENTED TECHNIQUES === | ===PART IV: OBJECT-ORIENTED TECHNIQUES === | ||
Revision as of 01:11, 2 December 2008
Typos for "Touch of Class" draft
How to report a typo
Report it under the appropriate chapter title below. Please include the original section number. The page number is less important as it changes. The best is to copy-paste the relevant text extract and mark the faulty word(s), for example by **...**. It is convenient to show the extract as a display (start lines with spaces) and also, if you wish, to give your name.
For example:
In section 16.1, just after the first figure: Money, Pass, Map, Louvre, Orsay Money, Pass, **Louvre, Map**, Orsay Money, Map, Pass, Louvre, Orsay The second one is wrong. -- Luchin Doblies, 1.12.2008.
(Indeed Luchin Doblies reported this error -- thanks! BM.) The entry should appear in the section for the corresponding chapter (it does now). I am sorry that I will not be able to respond to individual comments, but I will consider all reports and correct the text as needed.
As errors get corrected I move the corresponding reports to the second part of the page ("Previously reported").
Preface etc.
1 The industry of pure ideas
2 Dealing with objects
3 Program structure basics
4 The interface of a class
5 Just Enough Logic
6 Creating objects and executing systems
7 Control structures
8 Routines, functional abstraction and information hiding
9 Variables, assignment and references
PART II: HOW THINGS WORK
10 Just enough hardware
11 Describing syntax
12 Programming languages
13 Compilers and friends: the basic software tools
PART III: ALGORITHMS AND DATA STRUCTURES
14 Fundamental data structures, genericity, and algorithm complexity
15 Recursion and trees
16 Devising and engineering an algorithm: Topological Sort
PART IV: OBJECT-ORIENTED TECHNIQUES
17 Inheritance
18 Operations as objects: agents and lambda calculus
19 Event-driven design
20 Program correctness and proofs
PART V: TOWARDS SOFTWARE ENGINEERING
21 Introduction to software engineering
PART VI: APPENDICES
A Using the EiffelStudio environment
B Eiffel syntax specification
C An introduction to C++ (material by Nadia Polikarpova)
D An introduction to Java (material by Marco Piccioni)
E An introduction to C# (material by Benjamin Morandi)
EARLIER REPORTS (NOW CORRECTED)
Preface etc.
1 The industry of pure ideas
2 Dealing with objects
3 Program structure basics
4 The interface of a class
5 Just Enough Logic
6 Creating objects and executing systems
7 Control structures
8 Routines, functional abstraction and information hiding
9 Variables, assignment and references
PART II: HOW THINGS WORK
10 Just enough hardware
11 Describing syntax
12 Programming languages
13 Compilers and friends: the basic software tools
PART III: ALGORITHMS AND DATA STRUCTURES
14 Fundamental data structures, genericity, and algorithm complexity
15 Recursion and trees
16 Devising and engineering an algorithm: Topological Sort
In section 16.1, just after the first figure: Money, Pass, Map, Louvre, Orsay Money, Pass, **Louvre, Map**, Orsay Money, Map, Pass, Louvre, Orsay The second one is wrong. -- Luchin Doblies, 1.12.2008.
Section 16.3, topic "Cycles in the constraints", line 4-5: "A topological sort program gets its input **in the form individual ordering constraints**, ..." Missing "of": "in the form of" -- L.D., 1.12.2008
Section 16.4, topic "The Loop", second last line of the code-square: if “Any elements remain” then-- Report cycle: cycle_found := True “Insert these elements into **cyclist**” end I believe cyclist should be plural, "cyclists". -- L.D., 1.12.2008
Section 16.4, topic "The Candidates", second page, line 4: "What concrete **date** structure should we use for candidates?" "date structure" instead of "data structure". -- L.D., 1.12.2008
Section 16.7, second line: "..., such as the "<“ relation on numbers." The quotes do not match in font. -- L.D., 1.12.2008
