|
| | You will need to set aside a few hours each week to read the text
book. As you read I suggest that you highlight text that you find
difficult. Bring your text to every class. I will ask you to raise
in class concepts that you read about but for which you would like further elucidation
and examples. The quizzes will be on Wednesdays and may include any of the
exercises assigned for the previous week.
| Week beginning: |
Read pages: |
exercises: |
| Aug 28 |
124-137 java 5.0 |
4.4,4.11,4.16 |
| Sep 4 |
251-272 recursion
exponentiation |
7.1,7.4,7.10 |
| Sept 11 |
357-360 pseudo primes |
9.2 |
| Sept 18 |
472-489 graphs |
14.1,14.2 |
| Sept 25 |
489-496 Dijkstra's |
|
| Oct 2 |
499-504 Top sort, DAG |
|
| Oct 9 |
595-623 trees |
p. 626 18.1, 18.2, 18.5 (due 10/18) |
| Oct 16 |
629-648 Binary Search trees |
p.707 19.1, 19.2 (due 10/25) |
| Oct 23 |
648-657 AVL trees |
p.707 19.3, 19.4, 19.5(avl part) (due 10/30 |
| Oct 30 |
657-670 red-black trees |
p.707 19.5, 19.6(for red/black trees) (due 11/6) |
| Nov 6 |
670-698 aa trees, TreeMap, TreeSet |
|
| Nov13 |
698-704 B-trees |
|
| Nov 20 |
714-736 Hashing |
|
| Nov 27 |
|
|
| Dec 4 |
746-764 heaps, priority queue |
|
| Dec 11 |
Finals week |
|
|