Summary table of COM1201
syllabus, 1/31/98
This is only a summary, so you must consult the full syllabus for the details
of the assignments.
| Thurs 1/8 | C++, Ch. 2. Including Euclid's algorithm for the gcd. |
| Mon 1/12 | Elementary Data Structures, Ch. 3. Read Ch. 1, 2, 3. |
| Tues 1/13 | Ch. 3, continued. |
| Thurs 1/15 | Quiz #1, GCD code, lists, and stacks |
| Mon 1/19 | Trees, Ch. 4. Reading due: Ch. 4. |
| Tues 1/20 | Ch. 4, continued. Read Ch. 5 pgs. 60-61. Exercises
due: Ch 4. #1-8. Machine prob. due: Ch 4. #9 |
| Thurs 1/22 | Code Warrior IDE demos |
| Mon 1/26 | Analysis of Algorithms, Ch. 6. Reading due: Ch. 6. |
| Tues 1/27 | Analysis (cont.). Read Ch. 7. |
| Thurs 1/29 | Elementary Sorting, Ch. 8. Reading due: Ch. 8 pgs. 93-107, 112-113. |
| -------------- | February -------------- |
| Mon 2/2 | Quicksort, Ch. 9. Reading due: Ch. 9. |
| Tues 2/3 | Priority Queues, Ch. 11. Reading due: Ch. 11. |
| Thur 2/5 | Priority Queues (cont.). Exercises due: Ch. 8, #s 3 and 8. Ch. 9, #s 4 and 5. Machine problem due: Count quicksort calls. |
| Mon 2/9 | Elementary Searching Methods, Ch. 14. Reading due:
Ch. 14. Machine problem due: Quicksort applied to records, using pointers. |
| Tues 2/10 | Elementary Searching Methods (cont.). Exercises due: Ch 11. #1, 3, 4, 7. |
| Thurs 2/12 | Hashing, Ch. 16. Reading due: Ch. 16. Machine problem due: Instrument heap operations to see internals. |
| Mon 2/16 | String Searching, Ch. 19. Reading due: Ch. 19. Review for the Midterm |
| Tues 2/17 | MIDTERM EXAM - Entire class period. |
| Thurs 2/19 | String Searching, Ch. 19 |
| Mon 2/23 | Pattern Matching, Ch. 20 |
| Tues 2/24 | Pattern Matching (cont.) |
| Thurs 1/26 | File Compression, Ch. 22 |
| -------------- | March -------------- |
| Mon 3/2 | Elementary Graph Algorithms, Ch. 29 |
| Tues 3/3 | Weighted Graphs, Ch. 31 |
| Thurs 3/5 | Weighted Graphs (cont.) |
| Mon 3/9 | Random Numbers, Ch. 35 |
| Tues 3/10 | catch-up time |
| Thurs 3/12 | Review for Final Exam |