CS241: Topics for the Week of September 17, 2007

• Go over Problems: Chp 2 - p. 43: 2.2, 2.3, 2.6 p. 53-4: 2.10, 2.11, 2.13, 2.15, 2.16 p. 58-9: 2.20, 2.22, 2.24
  Chp 3 - p. 76: 3.3; p. 82: 3.9

• Labs

  • Monday: Lab 2: MineSweeper is due.
  • Begin: Lab 3: Shape Graphs

• Look at a games:

  • Mancala - how do you move in circle?
  • Reversi - how do you check for legal moves?

• Chapter 2: Polymorphism

  • Wrappers
  • What is polymorphism? What are polymorphic types?
  • Overloading of methods
  • Interfaces and abtract classes
  • References to objects

• Chapter 3: Inheritance
  or Structures that enforce modularity and re-usability

  • Packages
  • Abstract classes
  • Interfaces
  • Inhertance
  • Dynamic Dispatch
  • Access levels - package, public, private, protected
  • Be careful with constructors.

• Begin: Chapter 4: Stacks and Queues

  • Stacks
    • LIFO policy - Last in, first out.
    • The stack abstract data type (p. 88)
    • java.util.Stack - see p. 177 Java Collections Framework. Also look in Java documentation for full description.
    • Applications:
      • Towers of Hanoi
      • Postfix Calculator (see lab, and problem 4.20 in text)
      • Call stacks
      • Many card games: solitaire, idiot's delight