Lecture Notes and Example Programs

I will put lecture notes and example programs here after I present them in class.

Lecture Notes

The lecture notes are available as PDF files.

• Weeks 6 and 7: Trees
  Here are my lecture notes about Trees.
• Weeks 5 and 6: Recursion
  Here a slides about recursion, based on originals by Ethan Miller and Scott Brandt.
  • 3 per page.
  • 6 per page.
• Weeks 3 and 4:
  • Here are my lecture notes from January 20.
  • Here are slides about Stacks and Queues, based on originals by Ethan Miller and Scott Brandt.
    • Stacks: 3 per page or 6 per page.
    • Queues: 3 per page or 6 per page.
• Week 2:
  • There are some slides, available either with 3 slides or 6 slides per page. These slides contain some copyrighted material, so you will need to use the username and password I gave out in class to access these from off-campus.
  • There are also some lecture notes.
• Week 1, either with 3 slides or 6 slides per page.

Example Programs

Some of these examples are from the book, and therefore are copyrighted. You will need the username and password that I passed out in class to access these examples from off-campus.

• Weeks 7, 8, and 10: C source code examples
• Week 7:
  Example program showing how to use an Iterator with a Binary Search Tree
  • IteratorTest.java - example program that uses TreeIterator.
  • Name.java - A subclass of KeyedItem. Binary Search Trees require a KeyedItem.
• Week 6:
  Binary Search Tree code from the book
  • Binary Search Tree BinarySearchTree.java
  • Binary Tree BinaryTree.java
  • Binary Tree Basis BinaryTreeBasis.java
  • KeyedItem KeyedItem.java
  • TreeNode TreeNode.java
  • TreeException TreeException.java
  • TreeIterator TreeIterator.java
• Week 3 and 4:
  Stacks and Queue examples from the book
  • Array-based Stack StackArrayBased.java
  • Refernce-based Stack StackReferenceBased.java
  • Stack Exception StackException.java
  • Stack Interface StackInterface.java
  • Reference-based Queue QueueReferenceBased.java
  • Array-based Queue QueueArrayBased.java
• Week 2 and 3:
  • Here are source files for two different implementations of the ADT List
    • ListArrayBased.java - Implements the list using an array.
    • ListReferenceBased.java - Implements the list using references (linked list).
  • Here is the Node class that is used by the reference-based List.
• Week 1
  • The source files for the Clock ADT:
    • Clock.java - implements Clock with hours and minutes fields.
    • Clock2.java - implements Clock with minues field only.
    • ClockTest.java - Uses the Clock ADT. Note that it doesn't matter which one it uses.
  • InputExample.java - Shows how to use BufferedReader.
  • Cards, Javadoc, and gmake examples are available as part of Assignment 1.