| | | Lectures and Readings |
Students should consult this page regularly to see the most current version of the schedule of topics and readings.
All reading assignments are from the text. Students should come to class having completed the indicated readings for the day. You should attempt to work all the problems at the end of each section as you are reading. Chapter review problems will be assigned during each lecture. While chapter review problems will not be turned in, you should complete them before the next lecture after they are assigned. Many of these will show up in the regular quizes during the first five minutes on Friday mornings, and may also appear on the midterm or final. Problems assigned in association with lecture n should be completed before lecture n+1. Answers are in the back of the book for most problems assigned.
|
Lecture | Date | Topic | Example code | Reading | Hmwk assigned |
| 1. | Jan. 21 | Introduction & Overview | code | Ch 0 & 1, Appendix B.3.2 | 1.1, 1.3 |
|
2. | Jan. 23 | Pre- and Post-Conditions | code | Ch 2 | 2.1,2.3 |
|
3. | Jan. 26 | Java Graphics | code | Standard Java Graphics | |
|
4. | Jan. 28 | Events & ArrayLists | code | Ch 3 & 4 | 3.7 |
|
5. | Jan. 30 | ArrayList Implementation | code | Ch 3 & 4 | 3.5, 3.7 |
|
6. | Feb. 2 | Analysis of Algorithms | Ch 5.1 | 5.5, 5.9, 5.11 | |
|
7. | Feb. 4 | Induction/Sorting | code | Ch 5.2-3, Ch 6 | 5.21,5.23 |
|
8. | Feb. 6 | Sorting 2 | code | Ch 6 | 6.7 |
|
9. | Feb. 9 | Iterators | code | Ch 8 | 8.3 |
|
10. | Feb. 11 | Linked Lists 1 | Ch 9 | 9.5 | |
|
11. | Feb. 13 | Linked Lists 2 | Ch 9 | 9.15 | |
|
12. | Feb. 16 | Stacks | code | Ch 10.1 | 10.3 |
|
13. | Feb. 18 | Queues | code | Ch 10.2 | 10.5 |
|
14. | Feb. 20 | Ordered Structures | code | Chap 11 | |
|
15. | Feb. 23 | Binary Trees 1 | Chap 12.1-5 | 12.3, 12.7 | |
|
16. | Feb. 25 | Binary Trees 2 | code | 12.6-12.10 | 12.11 |
|
17. | Feb. 27 | Array Representations of trees & Priority Queues | code | Ch 13.1-13.4.1 | 13.1, 13.2 |
|
18. | March 2 | Heaps & Heapsort | Ch 13.4.2-13.6 | ||
|
19. | March 4 | Binary Search and Splay Trees | Ch 14.1-8 | 14.3,14.5,14.11 | |
|
20. | March 6 | Parallelism 1 | Handout, sections 2, 3 | ||
|
21. | March 9 | Midterm | |||
|
22. | March 11 | Parallelism 2 | code | Handout, section 4 | |
|
23. | March 13 | Parallelism 3 | Handout, section 5 | ||
| March 16-20 | Spring Break | ||||
|
24. | March 23 | Concurrency 1 | Handout, section 6 | ||
|
25. | March 25 | Concurrency 2 | Handout, section 7 | ||
| March 27 | College Holiday - Chavez Day | ||||
| 26. | March 30 | Concurrency 3 | code | Handout, sections 8, 9, Sample Problems | |
|
27. | April 1 | Maps & Dictionaries | Ch 15.1-3 | ||
|
28. | April 3 | More Dictionaries & Hashing | Ch 15.4-7 | 15.3, 15.9 | |
|
29. | April 6 | Intro to C++ | Weiss Ch. 1 | ||
|
30. | April 8 | More C++ | Weiss Ch. 2 | ||
|
31. | April 10 | More C++ | |||
|
32. | April 13 | More C++ | Weiss Ch. 3 | ||
|
33. | April 15 | More C++ | Weiss Ch. 4.6 | Weiss 3-18 Weiss 3-15 | |
|
34. | April 17 | More C++ | big 3 | ||
|
35. | April 20 | More C++ | Bailey Ch. 16, Weiss Ch. 4 | destructor | |
|
36. | April 22 | More C++ | Wiess Ch. 10 | 16.1, 16.3 | |
|
37. | April 24 | More C++ | Weiss Ch. 5 | 16.11 | |
|
38. | April 27 | Graphs | 16.7 | ||
|
39. | April 29 | Graphs | Ch 16 | dijkstra's algorithm | |
|
40. | May 1 | C++ Inheritance | Ch 16 | ||
|
41. | May 4 | More graph algorithms | Ch 16 | ||
|
42. | May 6 | Summary | |||
| | | Lectures and Readings |