ICS 311 - Algorithms & Data Structures
Dr. Kazuo Sugihara
Spring 2000

FINAL EXAM: Wednesday, May 10, 4:30 p.m.(?)

Good luck to everyone!!

B-Tree Deletion notes - our in-class exercises explained.

Boyer-Moore String Matching Algorithm - step-by-step how-to.

I've posted some of my notes for our second assignment. This just includes the process of reading in the links from the first text file and generating the corresponding tree.

Also added:

Finding LCA (updated 02/25/00)

NOTE ON MATRIX NOTATION:

I also asked about the notation for a matrix A = [aij]. For such a matrix, i specifies the row and j specifies the column.

Java 1.2:

Using Java 1.2 helps simplify things enough to make it worth upgrading, if you aren't already using it. Many classes in Java 1.2 implement the Comparable interface automatically, for instance.

You'll probably need to setup your HTML page and your web browser to enable them to view Java 1.2 applets, however. Click the following link to see what's involved:

Using Java 1.2 with Web Browsers

* See also Running Swing Applets for details on using Java 1.2 with your web browser

Contents for 311 notes:

Operator Counting

Representing Input Size As Bits

Using Java 1.2 with Web Browsers

last modified: 05/09/00