Reading Assignments, Discussion Questions, and Programming Projects will be listed here in chronological order, i.e., with the most recent ones at the bottom of the list.

All reading assignments are from the textbook, Java Software Structures: Designing and Using Data Structures, 2nd Edition by Lewis & Chase, unless specified otherwise.

Jump directly to Week 1 | Week 2 | Week 3 | Week 4 | Week 5 | Week 6 | Week 7 | Week 8 | Week 9 | Week 10

This document was last modified on September 19, 2009.

CS 210 Home Homework Labs Syllabus Bibliography

• Reading Assignment for Monday -- Lists, Linked Structures
  • Be sure to have finished reading Chapter 4.
  • Start reading Chapter 8, Sections 8.1, 8.2.

• Discussion questions for Monday:
  No new questions.

• Reading Assignment for Wednesday -- Lists
  • In Chapter 8, make sure to have read Sections 8.1 and 8.2. Section 8.1 provides not one, but three variations on a List ADT. Please read this section closely and compare the interfaces presented with the one we developed in class. Section 8.2 provides a miniature case study using one of the three interfaces from section 8.1.

• Reading Assignment for Friday -- Recursion
  • In Chapter 10, read Sections 10.1 and 10.2

• Iterator Lab Programming Project (due Monday of Fourth Week)
  • Complete the Grid Iterator Lab. We will have demos on Monday in class. Hand in your iterator implementations for the ReverseColMajorGridIterator class, the Diagonal class, the Triangle class, either the DoubleDiagonal or the PerimeterTraversal class, and either the SpiralTraversal or the Butterfly class. 

• Looking Ahead:
  • Linked List Programming Project is due no later than Friday of 5th Week. (see below)

• Reading Assignment for Monday and Wednesday
  • Read sections 8.3 - 8.5. Sections 8.4 and 8.5 should provide an interesting comparison with the RecLL class we will be developing.
  • Read Sections 10.1 and 10.2.

• Reading Assignment for Friday
  • Read Section 8.6.

• Discussion questions for Friday:
  • What are the key differences you notice among the three implementations (the array implementation in 8.4, the linked implementation in 8.5, and the RecLL implementation), and what is their significance?
  • Be prepared to discuss the Big-O analysis of the different List implementations, as well as the ArraySet implementation.

• Linked List Programming Project (due no later than Friday of Fifth Week!)
  • Complete the implementation of the OrderedRecLL class which implements the CS210OrderedListADT interface, which extends the CS210ListADT interface Run the junit tests that have been provided to test each of your methods.

• Looking Ahead:
  • Midterm Exam will be Wednesday of Fifth Week.

Jump directly to Week 1 | Week 2 | Week 3 | Week 4 | Week 5 | Week 6 | Week 7 | Week 8 | Week 9 | Week 10

This page is maintained by Alyce Brady (abrady{at}kzoo{dot}edu) and Pamela Cutter (pcutter{at}kzoo{dot}edu). It was last modified on September 19, 2009 .