Regarding Chapter 5, there are some specific comments to be
made:
- p. 67, near middle: Think of the PAT manual when
you see discussion of a query language.
- p. 68, middle: Remember that the key is to have
ordered sistrings.
- p. 69, top: Recall ``trie'' when you think about
digital trees.
- p. 69, middle: Note that the discussion of ``total
displacement'' for bits deals with, as in the figure, cases
when a bit is skipped (e.g., internal nodes 3 and 5 in Figure 5.1).
- p. 69, bottom, Figure 5.1: For later discussion, think about
how to find the frequency of bigrams - they are 00, 01, 10, 11.
- p. 70, 2nd from bottom: ``answer'' means ``answer set''.
- p. 71, line 8-9: replace ``latter'' with ``other''.
- p. 71, end of 5.3.3: consider a complete binary tree.
- p. 72, 1st new par.: work through an example of this.
- p. 72, end of 5.3.5: ``alpha-beta pruning'' is discussed in AI courses.
- p. 73, expression near end of 5.3.6: the first part comes from
the branches in the DFA and the rest comes from the traversal.
- p. 77, end of ``Building PAT ...'' section, insert word ``serves''
before ``as a building''.
- p. 81, line 12 of 5.6, change ``kind'' to ``kinds''.