Schedule

Subject to change with minimal notice. In particular, we'll add x-hours as necessary.

Week 1: Java

• Monday, March 24: Introduction. Object-oriented programming and Java. Short assignment 0 out.

• Wednesday, March 26: Classes and objects. Reading: Chapter 1, Sections 2.1–2.3. Short assignment 1 out.

• Thursday, March 27 (x-hour): Optional session for students who have not seen classes and objects before or who want to brush up on them.

• Friday, March 28: More about classes and objects. Arrays. Interfaces and polymorphism. Short assignment 2 out. Reading: Section 3.1.

Week 2: Polymorphism and linear structures

• Monday, March 31: Console input, ArrayLists, and inheritance. Reading: Section 7.2. Short assignment 3 out.

• Wednesday, April 2: More on inheritance. Short assignment 4 out.

• Friday, April 4: Graphics. GUI components. Listeners and callbacks. Short assignment 5 out.

Week 3: User interaction

• Monday, April 7: More on GUIs. Short assignment 6 out.

• Wednesday, April 9: Abstract classes. Access control. Adapter classes. Inheritance vs. interfaces. Linked lists. Reading: Sections 3.2–3.4. Lab assignment 1 out.

• Friday, April 11: Linked lists. Short assignment 7 out.

Week 4: Basic abstract data types

• Monday, April 14: More about linked lists. Review of algorithm analysis. Reading: Chapter 4.

• Wednesday, April 16: Stacks, queues, and dequeues. Iterators. Lab assignment 1 due. Reading: Chapter 6. Short assignment 8 out.

• Friday, April 18: No class.

Week 5: Trees, heaps, maps, and sets

• Monday, April 21: Iterators. Trees and binary trees. Reading: Chapter 8. Short assignment 9 out.

• Wednesday, April 23: Exceptions. Heaps and priority queues. Reading: Section 2.4 and Chapter 9. Short assignment 10 out.

• Thursday, April 24 (x-hour): Heaps and heapsort. Maps and sets. Instant runoff elections. Reading: Section 10.1.

• Friday, April 25: Hash tables. Reading: Section 10.2. Short assignment 11 out.

Week 6: Binary search trees

• Monday, April 28: Binary search trees. Reading: Section 11.1. Lab assignment 2 out.

• Wednesday, April 30: Guest presentation by Chandlee Bryan of the Center for Professional Development and Natalie Hoyt from the Undergraduate Dean's Office. Try to attend the celebration for the 50th anniversary of BASIC in the afternoon.

• Friday, May 2: More on binary search trees. Traversals and expression trees. Exam review session 3:00-4:15 pm, in LSC 200 (not LSC 201).

Week 7: Graphs

• Monday, May 5: Graphs and how to represent them. Reading: Sections 14.1–14.2. Midterm exam at 6:30 pm, LSC 100 (Oopik Auditorium).

• Wednesday, May 7: Traversing a graph with breadth-first and depth-first search. Reading: Section 14.3. Lab assignment 2 due. Lab assignment 3 out.

• Friday, May 9: Dijkstra's algorithm for shortest paths.

Week 8: Game tree search

• Monday, May 12: No class.

• Wednesday, May 14: Game tree search. Lab assignment 3 due. Lab assignment 4 out.

• Thursday, May 15 (x-hour): More on game tree search.

• Friday, May 16: No class.

Week 9: Efficient search structures

• Monday, May 19: Red-black trees. Reading: Sections 11.3–11.6.

• Wednesday, May 21: No class. Lab assignment 4 due.

• Friday, May 23: No class.

Week 10: Wrap up

• Monday, May 26: No class. First day of reading period.

• Wednesday, May 28: Wrap up.

• Thursday, May 29: Review session for final exam, 12:30–2:30 pm, 008 Kemeny.

• Saturday, May 31: Final exam at 8:00 am, LSC 100.