C# For Technical Writers: Reading Assignments
Week 1
| Pages | Section |
| 2 - 14 | (Optional) C# and .Net 2.0; Examining Your First Program |
| 16 - 40 | Visual Studio 2005 (skim) |
| 43 - 45 | Types |
| 46 | (Optional) Types and Compiler Errors |
| 56 | Whitespace |
| 59-60 | The Assignment Operator (=) |
Week 2
| Pages | Section |
| 303-304 | (Optional) Escape characters; Verbatim Strings |
| 47-49 | Variables; Definite Assignment; WriteLine() [sidebar] |
| 60-62 | Mathematical Operators |
| 104-113 | (Optional) Object-oriented programming |
| 115-118 | Classes and Objects [introductory section]; Instantiating Objects |
Note: We will not cover the increment and decrement operators (pp 62-64)
Week 3
| Pages | Section |
| 65-66 | Relational Operators; Use of Logical Operators with Conditionals |
| 72 | Branching [introductory section] |
| 75-76 | if Statements |
| 76-79 | (Optional) Single-Statement if Blocks; Brace Styles [side bar] |
| 82-84 | (Optional) Nested if statements |
| 81 | if ... else Statements |
| 89 | Iteration (Looping) Statements [introductory section] |
| 91-92 | The while Loop |
Note: We will not cover switch statements (pp 84-88) or goto statements (pp 89-90).
Week 4
| Pages | Section |
| 52-54 | Enumerations |
| 280-282 | (Optional) Generic Lists: List<T> (see Note) |
| 179 | (Optional) The foreach statement |
| 107 | Defining a Class |
| 115-120 | Defining Classes [esp p.116] |
Note: In this course, I present the List class without formally describing it. (In particular, I do
not cover generics.) Nearly every computer program uses some type of collection; without them, we are
restricted to extremely trivial programs. However, the specific language features used to implement
them are not so important.
The textbook takes a more traditional approach, introducing arrays, interfaces, and foreach loops before
the chapter on collections.
Week 5
| Pages | Section |
| |
| 121-127 | Access Modifiers; Method Arguments; Constructors; Initializers |
| 127 | (Optional) The this Keyword |
| 128-133 | Static and Instance Methods |
| 236-242 | Interfaces |
| 135-140 | (Optional) Memory Allocation: The Stack Versus the Heap |
Main Page