Programming Assignments and LaboratoriesTopInstructor   TextsLectures and Readings

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 Sample code Reading Hmwk assigned
1) Aug. 30 Introduction & Overview code Ch 0 & 1, Appendix B.3.2 1.1

2)

Sept. 1 Java & Javadoc code Appendix B.3.2 1.3

3)

Sept. 4 Java Graphics & Events code Standard Java Graphics

4)

Sept. 6 Lists, GUI, and listeners code Ch 2, Using Assertions 2.1,2.3

5)

Sept. 8 Events and Assertions code Ch 3 & 4 3.7

6)

Sept. 11 ArrayList Implementation code Ch 3 & 4 3.5, 3.7

7)

Sept 13 Analysis of Algorithms Ch 5.1 5.5, 5.9, 5.11

8)

Sept. 15 Induction/Sorting code Ch 5.2-3, Ch 6 5.21,5.23

9)

Sept. 18 Sorting 2 code Ch 6 6.7

10)

Sept 20 Iterators code Ch 8 8.3

11)

Sept. 22 Linked Lists 1 Ch 9 9.5

12)

Sept. 25 Linked Lists 2 Ch 9 9.15

13)

Sept. 27 Stacks Ch 10.1 10.3

14)

Sept. 29 Stacks & Queues Ch 10.1 10.3

15)

Oct. 2 Review for Midterm 1

16)

Oct. 4 Queues (midterm in lab) Ch 10.2, 11 10.5

17)

Oct. 6 Binary Trees 1 Chap 12.1-5 12.3, 12.7

18)

Oct. 9 Binary Trees 2 12.6-12.10 12.11

19)

Oct. 11 Trees: Visitor Pattern 12.6-12.10 12.11

20)

Oct. 13 Array Representations of Trees & Priority Queues Ch 13.1-13.4.1 13.1, 13.2

Oct. 16-17 Fall Break

21)

Oct. 18 Heaps & Heapsort Ch 13.4.2-13.6

22)

Oct. 20 Ordered Structures Chap 11

23)

Oct. 23 Binary Search Trees Ch 14.1-8 14.3,14.5,14.11

24)

Oct. 25 Balanced Binary Search Trees

25)

Oct. 27 Maps & Dictionaries Ch 15.1-3

26)

Oct. 30 More Dictionaries & Hashing Ch 15.4-7 15.3, 15.9

27)

Nov. 1 Parallelism 1 Handout, sec. 2, 3

28)

Nov. 3 Parallelism 2 Handout, sec. 4

29)

Nov. 6 Review for Midterm 2

30)

Nov. 8 Concurrency 1 (midterm in lab) Handout, sec. 6

31)

Nov. 10 Concurrency 2 Handout, sec. 7

32)

Nov. 13 Concurrency 3 Handout, sec. 8, 9, Sample Probs

33)

Nov. 15 Concurrency 4 Handout, sec. 8, 9, Sample Probs

34)

Nov. 17 Graphs 1 Ch 16 16.1, 16.3

35)

Nov. 20 Graphs 2 Ch 16 16.7

36)

Nov. 22 Graphs 3 Ch 16 dijkstra's algorithm

Nov. 23-24 Thanksgiving Break
37) Nov. 27 More graph algorithms Ch 16

38)

Nov. 29 Object-Oriented Design

39)

Dec. 1 Design patterns 1

40)

Dec. 4 Design patterns 2

41)

Dec. 6 Summary


Programming Assignments and LaboratoriesTopInstructor   TextsLectures and Readings