Programming Assignments and LaboratoriesTopInstructor   TextLectures and Readings

Lectures and Readings

The schedule on the following two pages shows the topics to be covered at each class meeting during the semester. 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. They will show up in occasional pop quizes during the term 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. 19 Introduction & Overview code Ch 0 & 1, Appendix B.3.2 1.1, 1.3
2. Jan. 21 Pre- and Post-Conditions code Ch 2 2.1,2.3
3. Jan. 24 ArraysLists 1 code Ch 3 & 4 3.7
4. Jan. 26 Java Graphics/ArrayLists 2 code Standard Java Graphics
5. Jan. 28 ArrayLists 3 code Ch 3 & 4 3.5
6. Jan. 31 Analysis of Algorithms Ch 5.1 5.5, 5.9, 5.11
7. Feb. 2 Induction/Sorting Ch 5.2-3, Ch 6 5.21,5.23
8. Feb. 4 Sorting 2 Ch 6 6.7
9. Feb. 7 Iterators Ch 8 8.3
10. Feb. 9 Linked Lists 1 Ch 9 9.5
11. Feb. 11 Linked Lists 2 Ch 9 9.15

12.

Feb. 14 Stacks Ch 10.1 10.3
13. Feb. 16 Queues Ch 10.2 10.5
14. Feb. 18 Parallelism 1 Handout, sections 1,2
15. Feb. 21 Parallelism 2 code Handout, section 3
16. Feb. 23 Parallelism 3 code Handout
17. Feb. 25 Concurrency 1 Handout
18. Feb. 28 Concurrency 2 Handout
19. Mar. 2 Concurrency 3 code Handout
20. Mar. 4 Ordered Structures Chap 11
21. Mar. 7 Midterm
22. Mar. 9 Binary Trees 1 Chap 12.1-5 12.3, 12.7
23. Mar. 11 Binary Trees 2 12.6-12.10 12.11

Mar. 14-18 Spring Break
24. Mar. 21 Priority Queues Ch 13.1-13.4.1 13.1, 13.2
25. Mar. 23 Heaps & Heapsort Ch 13.4.2-13.6
Mar. 25 College Holiday - Chavez Day

26. Mar. 28 Binary Search and Splay Trees Ch 14.1-8 14.3,14.5,14.11
27. Mar. 30 Maps & Dictionaries Ch 15.1-3
28. April 1 More Dictionaries & Hashing Ch 15.4-7 15.3, 15.9
29. April 4 Intro to C++ Weiss Ch. 1
30. April 6 More C++ Weiss Ch. 2
31. April 8 B-trees
32. April 11 More C++ Weiss Ch. 3
33. April 13 More C++ Weiss Ch. 4.6 Weiss 3-18 Weiss 3-15

34.

April 15 More C++ big 3
35. April 18 More C++ Bailey Ch. 16, Weiss Ch. 4 destructor
36. April 20 More C++ Wiess Ch. 10 16.1, 16.3
37. April 22 More C++ Weiss Ch. 5 16.11
38. April 25 Graphs 16.7
39. April 27 Graphs Ch 16 dijkstra's algorithm
40. April 29 C++: Templates Weiss Ch. 7-7.4 templates
41. May 2 C++: Inheritance Weiss Ch. 6-6.6 inheritance
42. May 4 Summary


Programming Assignments and LaboratoriesTopInstructor   TextLectures and Readings