Assigned Wednesday 3/28/01, due on paper at class time Friday 3/30/01.
Do problems 2, 5abcdj, 6ef, 7ef, 10b (prove as in class), and 14
from section 0.1; 8, 9, and 10 from section 0.2;
8bd from section 0.3 (prove your answer for 8b as in class);
10ab, 24, 31, and 34 from section 0.4;
5b, 8, and 12b from section 0.5;
and 3 and 7 from section 0.7.
(Note that you probably already know a lot but not all of the
material from Chapter 0. You can expect problems to be less
numerous and more interesting in later assignments.)
Assigned Wednesday 4/4/01, due on paper at class time
Monday 4/9/01.
Do problems 3, 8, 16, and 18 from section 2.2;
8, 14, 16, and 17b from section 2.3;
2 and 10 from section 2.4; and the following:
What is the maximum number of nodes in a ternary
tree of depth D? Prove your answer.
What is the maximum number of leaves in a binary
tree with N nodes? Prove your answer.
Consider the following function:
int fib( int n )
{
if( n <= 2 )
return 1;
else
return fib( n - 1 ) + fib( n - 2 );
}
How many calls of fib take place when you call fib( N )?
Prove your answer.
Assigned 4/18/01. Due at class time, Monday, 4/23/01.
A programming assignment to count poker hands.
Assigned 5/4/01. Due at class time, Friday, 5/11/01.
Problems 3, 4 from section 5.3; 12 from 5.4; 3, 4 from 5.5; 5, 6 from 5.6;
1 from 5.7; 1, 2 from 5.8; and 16-19 from 5.9.
Assigned 5/16/01. Due at class time, Wednesday, 5/23/01.
A programming assignment using conditional probabilities
and bigrams to classify sentences
by most probable author.
Assigned 5/21/01. Due at class time, Wednesday 5/30/01.
Do problems 2, 7, 9 from section 6.3; 1-4 from section 6.4;
6 from section 6.5; 3, 16, 24, 25, and 28a-d from section 7.2;
and 5 from section 7.3.
Suggested Reading
The dates below are the dates on which it would
be useful to start reading the indicated chapters.
3/26/01. Read Chapter 0 of Maurer & Ralston. When you read
a book like this, it's a good idea to read through
the exercises, too. This often gives you a sense of what the
authors think is most important.