-Here are some additional homeworks, that will consolidate your understanding of what we've covered in the last weeks of the seminar. Those who are taking the class for credit: since we're so late to post these, and they add up to a substantial chunk of thinking, we won't require you to do them. But we will strongly encourage it. If you'd like to do them, and have us take account of your efforts when deciding on grades, let us know now when you propose to submit the work. (Up to the start of next term would be viable.)
+***Non-required but strongly suggested work***: Here are some
+additional homework problems that will consolidate your understanding
+of what we've covered in the last weeks of the seminar. Those who are
+taking the class for credit: since we're so late to post these, and
+they add up to a substantial chunk of thinking, we won't officially
+require you to do them, since we don't want to get into a bureaucratic
+bind if you've planned your next month in a way that would not permit
+you to get the work done. But ***we strongly encourage*** you to work on
+the problem set: solving these problems will produce a qualitatively
+deeper understanding of continuations. If you plan to do some or all
+of these problems, and would like us to take them into account in our
+evaluation of your work for the course, please let us know when to
+expect to see them. (Up to the start of next term, which begins on 24
+January 2011, would be viable.)
Of course, if you need help or want us to review your efforts, we'll be glad to discuss with you at any later point as well.
As Ken Shan points out, this is an instance of the algorithm
for converting name/year citations (like 'see Montague 1970')
- to numerals corresponding to their ('see [24]'). Except that
- bibliograpic numerals don't start with zero.
+ to numerals corresponding to their position in the
+ bibliography ('see [24]'). Except that bibliographic numerals
+ don't start with zero.
Give some thought to efficiency: there are straightforward
solutions that involve traversing the tree once (in order to,
its number of occurrences in the tree. Is there any way to do
that with a single traversal?
- You can assume that the tree is leaf-labeled (no labels on the
- internal nodes), and that the leafs are, say, chars.
+ You can assume that the tree is binary, leaf-labeled (no
+ labels on the internal nodes), and that the leafs are, say,
+ chars.
Here is [a hint](/hints/assignment_10_hint).