TAOCP Vol 1: Fundamental Algorithms · Week 34
TAOCP 2.1 Introduction: reading guide
Chapter 2 opens by defining how Knuth represents data in memory: nodes made of fields, links (pointers), and the notation he uses for them. It walks through a small example with a pile of playing cards.
Time About 3 hours this week
Why it matters
This notation is used for the rest of the series. It also forces you to think about data as concrete memory layout, which is exactly what C taught you in clox.
Before you start
- 1.3 MIX
How to approach it
Short and important. Learn the node and field notation until you can read it without thinking. Relate it to C structs and pointers.
Exercises
This is a light section. Skim the exercises, do the ones rated 10 or under in your head, and spend the spare time catching up on earlier exercises you skipped.
Traps
- Mixing up a link and the node it points to in Knuth's notation.