Final Grades
Administrative Announcements
- Introduction to this course. We explain
the goals, overview the content, and descirbe the textbooks.
Assignments
- Assignment 0.
Due Date: Thurs, 12 September.
This is a preliminary
assignment to familiarize students with the Unix/IRIX computing
environment in the Indy Lab
and the Java development environment.
- Assignment 1.
New Due Date: Tues, 24 September.
An acquaintance with binary search trees and Java programming.
- Assignment 2.
Due Date: Tues, 1 October.
Practice with recursion.
- Assignment 3.
Due Date: Tues, 8 October.
In this assignment, the student implements Insertion Sort.
- In-class assignment, a review
of Java Applets and the AWT.
- Assignment 4.
Due Date: Tues, 15 October.
In this assignment, the student implements Quicksort.
- Assignment 5.
Due Date: Tues, 22 October.
Implements either a MergeSort or HeapSort.
- Assignment 6.
Due Date: Tues, 28 October.
In this assignment, the student implements single and double
rotation in a binary search tree.
- Assignment 7.
Due Date: Tues, 12 November.
Implement a Splay tree.
- Red-Black Trees,
a non-assignment. The splay tree is easier to implement, but
the red-black tree was covered in the class text. Here is
an implementation example to play with.
- Assignment 8.
Due Date: Tues, 26 November. Huffman trees.
This assignment exercises the student's knowledge of
Tries, introduces files and some mutli-threading concepts.
Online Notes